SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Data Structures
Start Test
Study First
Subject
:
it-skills
Instructions:
Answer 50 questions in 15 minutes.
If you are not ready to take this test, you can
study here
.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.
This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. Composed of multiple sequential elements stored in contiguous bytes of memory
reference type
stack
array
successor
2. A given collection of values along with a collection of operations for use on those values
data type
immutable
state
cons
3. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
immutable
cons
data type
root
4. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
fifo
leaf
well-founded ordering xml
5. To look through a data structure until a goal object is found
depth-first search
random access
cons
search
6. An extra record at the start or end of a data structure such as a linked list - to simplify processing
intractable
array
constructive
entinel
7. Container for storing a collection of data in unique key/value pairs
dictionary
association list
data type
side-effect
8. Given two sets -the union is the set of elements that are members of either set
random access
link
DFS
union
9. Describes a function that makes a new data structure but does not modify its arguments
runtime stack
pointer
data abstraction
constructive
10. A process that removes unwanted elements from a collection
filter
merge
immutable
circularly linked list
11. A case where a program calls itself
class
circular queue
descendants
recursion
12. In a tree search - to move back from the node currently being examined to its parent
ontology
data type
backtrack
general list
13. First in first out: describes ordering of a queue
fifo
amortized Analysis
circularly linked list
node
14. All nodes below a give node in a tree
pointer
descendants
boxed number
inorder
15. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
runtime stack
data abstraction
LIFO
data structure
16. Use of a function or method without knowing how it's accomplished
procedural abstraction
inorder
base case
backtrack
17. A simple case that can be solved easily - without recursion
runtime stack
base case
goal
doubly linked list
18. A tree node containing a contents value but with no children
leaf
link
amortized Analysis
class
19. A data structure that can be identified at runtime as being a member of a class
runtime stack
backtrack
object
boxed number
20. A search in which children of a node are considered before siblings are considered
branching factor
depth-first search
runtime stack
set difference
21. A pattern that describes a set of similar programs
well-founded ordering xml
array
runtime stack
design pattern
22. A linked list in which the last element points back to the first element
DFS
circularly linked list
descendants
set difference
23. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
queue
immutable
successor
24. An order of processing a tree in which the parent node is processed in between its children
fair
procedural abstraction
inorder
boxed number
25. Values are in the most basic form and cannot be decomposed into smaller parts
search
simple data type
recursion
inorder
26. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
taxonomy
queue
grammar
destructive
27. Composed of a collection of data values; implemented with a data structure
LIFO
complex data type
complex ADT
fair
28. A pointer to data
recursion
complex ADT
reference
preorder
29. A problem that is so hard that it cannot be solved unless the problem is small
simple ADT
intractable
interior node
doubly linked list
30. An order of processing a tree in which the parent node is processed before its children
alias
search
well-founded ordering xml
preorder
31. A description of operations on a data type that could have multiple possible implementations
root
backtrack
object
abstract data type
32. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
design pattern
ontology
union
operator
33. A variable containing the address of other data
binary search tree (bst)
shadow
null dereference
pointer
34. A runtime error that occurs when an operation such as method call is attempted on a null pointer
array
fifo
null dereference
root
35. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
postorder
search
shadow
36. In object oriented programming - a description of a set of similar objects
linear O(n)
algorithm
class
array
37. In a tree - a node that points to a given node
general list
state
parent
class
38. A pointer to the next element in a linked list
merge
link
boxed number
taxonomy
39. An item (or description of items) being sough in a search
linear O(n)
merge
goal
circular queue
40. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used
branching factor
ontology
garbage collection
union
41. A queue implemented within an array - where the first elements of the array logically follows the last elements
type
cons
circular queue
big o
42. A classification of objects into a tree structure that groups related objects
taxonomy
state
object
DFS
43. An elements of a linked list - tree - or graph - often represented by a data structure
divide and conquer
postorder
node
circular queue
44. The amount of space on the runtime stack required for execution of a program
leaf
garbage
stack frame
stack space
45. In a tree - the union of a node's parent and the parent's ancestors
depth
descendants
class
ancestors
46. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
stack frame
well-founded ordering xml
simple data type
sort
47. The area of program text over which a variable can be referenced
shadow
random access
descendants
scope
48. Describes a function that modifies its arguments
alias
destructive
merge
null dereference
49. A node of a tree that has children
interior node
leaf
set difference
DFS
50. Composed of individually named data fields
circular queue
constructive
simple ADT
reference type