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. Depth first search
state
procedural abstraction
ancestors
DFS
2. In a search tree - a program that changes a state into a child state e.g a move in a game
boxed number
queue
data structure
operator
3. Constructed of multiple components (simple or complex types)
array
array
complex data type
binary tree
4. Composed of individually named data fields
algorithm
data structure
simple ADT
simple data type
5. An elements of a linked list - tree - or graph - often represented by a data structure
node
data abstraction
algorithm
amortized Analysis
6. Use of a function or method without knowing how it's accomplished
linked list
postorder
procedural abstraction
base case
7. A condition of the input data where the data will be handled by call(s) to the same program
LIFO
simple ADT
linked list
recursive case
8. Any container with linear ordering
garbage
tail recursive
filter
general list
9. Container for storing a collection of data in unique key/value pairs
LIFO
design pattern
divide and conquer
dictionary
10. First-child/next-sibling
immutable
complex data type
fair
null dereference
11. A queue implemented within an array - where the first elements of the array logically follows the last elements
side-effect
boxed number
inorder
circular queue
12. Describes a function that modifies its arguments
destructive
backtrack
successor
binary search tree (bst)
13. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
union
quadratic
array
14. A tree node containing a contents value but with no children
quadratic
leaf
descendants
stack frame
15. The amount of space on the runtime stack required for execution of a program
branching factor
data abstraction
stack space
association list
16. A contiguous block of memory containing elements of the same type - accessed by numeric index
simple data type
intersection
link
array
17. Given two sets -the union is the set of elements that are members of either set
union
simple ADT
random access
array
18. A linked list in which each elements has both forward and backward pointers
doubly linked list
inorder
preorder
well-founded ordering xml
19. A description of operations on a data type that could have multiple possible implementations
abstract data type
association list
child
data type
20. To convert from a pointer to the data that is pointed to
runtime stack
array
dereference
LIFO
21. A stack containing a stack frame of variable value for each active invocation of procedure
shadow
runtime stack
complex ADT
stack frame
22. A simple case that can be solved easily - without recursion
circular queue
complex data type
fifo
base case
23. In a tree search - to move back from the node currently being examined to its parent
data type
branching factor
DFS
backtrack
24. In a tree - the union of a node's parent and the parent's ancestors
link
ancestors
data structure
node
25. 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
boxed number
general list
sort
grammar
26. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
array
set difference
queue
binary search tree (bst)
27. Composed of multiple sequential elements stored in contiguous bytes of memory
array
binary tree
goal
child
28. 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
pointer
circularly linked list
inorder
29. An item (or description of items) being sough in a search
operator
binary tree
union
goal
30. A pattern that describes a set of similar programs
design pattern
alias
child
divide and conquer
31. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
reference
constructive
abstract data type
32. The area of program text over which a variable can be referenced
recursive case
simple data type
operator
scope
33. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
filter
array
well-founded ordering xml
base case
34. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
stack frame
big o
quadratic
reference type
35. All nodes below a give node in a tree
descendants
quadratic
state
boxed number
36. A section of the runtime stack holding the values of all variables for one invocation
entinel
stack frame
random access
grammar
37. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
array
tail recursive
linked list
38. In object oriented programming - a description of a set of similar objects
stack
design pattern
fair
class
39. 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
goal
merge
complex ADT
binary tree
40. A case where tow data structures share some elements
structure sharing
complex data type
scope
array
41. A node of a tree that has children
interior node
ancestors
base case
intersection
42. A process that removes unwanted elements from a collection
divide and conquer
search
leaf
filter
43. The top node of a tree - from which all other nodes can be reached
root
preorder
branching factor
fifo
44. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip
interior node
type
successor
big o
45. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
scope
tail recursive
linear O(n)
dictionary
46. A data structure that can be identified at runtime as being a member of a class
depth
side-effect
object
taxonomy
47. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
postorder
set difference
union
48. To hide similar items with the same name
alias
recursive case
shadow
divide and conquer
49. A runtime error that occurs when an operation such as method call is attempted on a null pointer
parent
data abstraction
null dereference
type
50. Last in first out: describes the order of a stack
LIFO
preorder
binary tree
interior node