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