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. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
goal
object
state
2. In object oriented programming - a description of a set of similar objects
garbage collection
design pattern
class
divide and conquer
3. A collection of values
type
alias
depth
successor
4. A description of the state of a process such as a board game
state
reference
binary search tree (bst)
algorithm
5. A list of pairs - where each pair has a key and a value associated with the key
data structure
object
association list
leaf
6. An item (or description of items) being sough in a search
data type
scope
goal
merge
7. 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
backtrack
stack frame
binary tree
dereference
8. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
boxed number
alias
shadow
9. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
reference
class
circular queue
10. The process of collecting garbage for recycling
postorder
dereference
garbage collection
union
11. Composed of individually named data fields
doubly linked list
preorder
pointer
simple ADT
12. All nodes below a give node in a tree
base case
reference
circular queue
descendants
13. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
preorder
algorithm
array
intersection
14. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
constructive
data structure
queue
alias
15. A simple case that can be solved easily - without recursion
LIFO
base case
immutable
scope
16. A runtime error that occurs when an operation such as method call is attempted on a null pointer
queue
complex data type
null dereference
DFS
17. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
garbage
complex data type
alias
18. A description of operations on a data type that could have multiple possible implementations
abstract data type
divide and conquer
inorder
binary search tree (bst)
19. A pointer to data
data type
amortized Analysis
reference
side-effect
20. A pattern that describes a set of similar programs
successor
abstract data type
shadow
design pattern
21. A stack containing a stack frame of variable value for each active invocation of procedure
leaf
inorder
array
runtime stack
22. To hide similar items with the same name
goal
interior node
shadow
gedanken
23. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
null dereference
recursion
root
side-effect
24. In a tree - the union of a node's parent and the parent's ancestors
ancestors
alias
merge
interior node
25. A sequence of records - where each record contains a link to the next one
node
postorder
sort
linked list
26. A variable containing the address of other data
taxonomy
dictionary
pointer
complex ADT
27. In a tree - a node that points to a given node
base case
simple data type
parent
data type
28. The number of links between the root of a tree and the leaves
garbage collection
depth
big o
union
29. An order of processing a tree in which the parent node is processed before its children
preorder
grammar
divide and conquer
simple data type
30. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
backtrack
fair
type
quadratic
31. A collection of objects that are inserted and removed according to the LIFO principle
depth-first search
structure sharing
descendants
stack
32. A node of a tree that has children
tail recursive
interior node
ontology
grammar
33. A contiguous block of memory containing elements of the same type - accessed by numeric index
dereference
array
fifo
child
34. First in first out: describes ordering of a queue
null dereference
union
fifo
structure sharing
35. A case where tow data structures share some elements
cons
state
structure sharing
simple data type
36. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
taxonomy
big o
queue
child
37. Constructed of multiple components (simple or complex types)
sort
goal
big o
complex data type
38. Describes a function that modifies its arguments
destructive
root
reference
data abstraction
39. An order of processing a tree in which the parent node is processed after its children
stack
postorder
descendants
procedural abstraction
40. Container for storing a collection of data in unique key/value pairs
dictionary
immutable
data type
set difference
41. A pointer to the next element in a linked list
tail recursive
shadow
link
successor
42. A section of the runtime stack holding the values of all variables for one invocation
grammar
stack frame
entinel
base case
43. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
well-founded ordering xml
data abstraction
recursive case
44. A queue implemented within an array - where the first elements of the array logically follows the last elements
shadow
quadratic
constructive
circular queue
45. A classification of objects into a tree structure that groups related objects
constructive
scope
taxonomy
shadow
46. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
operator
set difference
linear O(n)
leaf
47. A search in which children of a node are considered before siblings are considered
depth-first search
doubly linked list
link
complex ADT
48. First-child/next-sibling
null dereference
fifo
parent
fair
49. The amount of space on the runtime stack required for execution of a program
inorder
gedanken
stack space
union
50. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
boxed number
parent
circularly linked list