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. In a search tree - a program that changes a state into a child state e.g a move in a game
goal
alias
operator
structure sharing
2. A list of pairs - where each pair has a key and a value associated with the key
backtrack
association list
array
type
3. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
child
cons
union
4. Depth first search
DFS
gedanken
quadratic
queue
5. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java
ancestors
boxed number
pointer
depth
6. An elements of a linked list - tree - or graph - often represented by a data structure
merge
node
fifo
inorder
7. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents
binary search tree (bst)
recursive case
doubly linked list
backtrack
8. Any container with linear ordering
general list
successor
operator
binary search tree (bst)
9. Composed of multiple sequential elements stored in contiguous bytes of memory
ontology
array
circularly linked list
procedural abstraction
10. A pattern that describes a set of similar programs
node
simple ADT
goal
design pattern
11. The area of program text over which a variable can be referenced
type
quadratic
scope
goal
12. A collection of objects that are inserted and removed according to the LIFO principle
DFS
stack
filter
simple ADT
13. A data structure that can be identified at runtime as being a member of a class
array
type
object
descendants
14. In a tree - a node that points to a given node
dictionary
node
depth
parent
15. The number of links between the root of a tree and the leaves
depth
binary search tree (bst)
array
base case
16. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
state
garbage
well-founded ordering xml
runtime stack
17. A description of the state of a process such as a board game
interior node
side-effect
garbage collection
state
18. A pointer to data
design pattern
reference
taxonomy
merge
19. In a tree - a node pointed to by a parent node
garbage
dictionary
circular queue
child
20. A runtime error that occurs when an operation such as method call is attempted on a null pointer
taxonomy
stack frame
binary search tree (bst)
null dereference
21. A condition of the input data where the data will be handled by call(s) to the same program
runtime stack
stack
recursive case
amortized Analysis
22. Describes a though experiment or view of an entity
tail recursive
depth-first search
pointer
gedanken
23. A section of the runtime stack holding the values of all variables for one invocation
stack frame
array
garbage
well-founded ordering xml
24. Describes a data structure or device in which all accesses have the same cost - O(1)
postorder
queue
operator
random access
25. Composed of a collection of data values; implemented with a data structure
complex ADT
tail recursive
procedural abstraction
structure sharing
26. Composed of individually named data fields
immutable
branching factor
simple ADT
complex data type
27. Container for storing a collection of data in unique key/value pairs
dictionary
big o
recursive case
binary tree
28. An item (or description of items) being sough in a search
DFS
shadow
goal
abstract data type
29. A stack containing a stack frame of variable value for each active invocation of procedure
well-founded ordering xml
operator
runtime stack
base case
30. An order of processing a tree in which the parent node is processed before its children
stack
random access
preorder
shadow
31. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
random access
quadratic
abstract data type
tail recursive
32. Separation of the properties of a data type from its implementation
inorder
data abstraction
node
garbage
33. An order of processing a tree in which the parent node is processed after its children
node
stack space
postorder
garbage
34. A tree node containing a contents value but with no children
leaf
ancestors
stack frame
simple ADT
35. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
random access
LIFO
recursive case
side-effect
36. The process of collecting garbage for recycling
random access
garbage collection
pointer
set difference
37. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children
union
postorder
binary tree
taxonomy
38. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
divide and conquer
general list
alias
39. A variable containing the address of other data
interior node
ancestors
pointer
array
40. A linked list in which each elements has both forward and backward pointers
null dereference
doubly linked list
node
depth-first search
41. Last in first out: describes the order of a stack
type
null dereference
LIFO
reference type
42. Given two sets -the union is the set of elements that are members of either set
dereference
data structure
union
merge
43. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
reference type
runtime stack
tail recursive
algorithm
44. Describes a function that modifies its arguments
complex ADT
class
destructive
branching factor
45. A description of operations on a data type that could have multiple possible implementations
fifo
ancestors
random access
abstract data type
46. A given collection of values along with a collection of operations for use on those values
root
data type
node
scope
47. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
inorder
data structure
merge
cons
48. 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
complex ADT
parent
cons
intersection
49. The top node of a tree - from which all other nodes can be reached
stack
base case
runtime stack
root
50. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
circular queue
search
immutable
LIFO