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. An order of processing a tree in which the parent node is processed before its children
set difference
descendants
filter
preorder
2. A list of pairs - where each pair has a key and a value associated with the key
array
boxed number
algorithm
association list
3. 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
leaf
operator
merge
4. Composed of individually named data fields
simple ADT
array
parent
object
5. A queue implemented within an array - where the first elements of the array logically follows the last elements
union
linear O(n)
circularly linked list
circular queue
6. In a search tree - a program that changes a state into a child state e.g a move in a game
well-founded ordering xml
operator
link
inorder
7. Constructed of multiple components (simple or complex types)
parent
circularly linked list
divide and conquer
complex data type
8. Given two sets -the union is the set of elements that are members of either set
base case
operator
union
backtrack
9. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
recursion
grammar
random access
binary tree
10. The top node of a tree - from which all other nodes can be reached
root
type
descendants
circular queue
11. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
object
structure sharing
tail recursive
12. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types
stack space
reference type
filter
leaf
13. To convert from a pointer to the data that is pointed to
merge
garbage collection
dereference
link
14. 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
node
state
base case
cons
15. Use of a function or method without knowing how it's accomplished
reference
complex ADT
procedural abstraction
merge
16. Composed of multiple sequential elements stored in contiguous bytes of memory
operator
fifo
array
set difference
17. All nodes below a give node in a tree
depth
merge
divide and conquer
descendants
18. A node of a tree that has children
amortized Analysis
runtime stack
interior node
circularly linked list
19. A simple case that can be solved easily - without recursion
grammar
preorder
entinel
base case
20. Describes a data structure or device in which all accesses have the same cost - O(1)
amortized Analysis
random access
immutable
fifo
21. An elements of a linked list - tree - or graph - often represented by a data structure
recursion
node
filter
type
22. An order of processing a tree in which the parent node is processed in between its children
child
fair
sort
inorder
23. A search in which children of a node are considered before siblings are considered
depth-first search
operator
reference type
gedanken
24. A problem that is so hard that it cannot be solved unless the problem is small
binary tree
alias
intractable
root
25. 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
procedural abstraction
linear O(n)
big o
DFS
26. A pointer to the next element in a linked list
circular queue
link
taxonomy
boxed number
27. Describes a function that makes a new data structure but does not modify its arguments
dereference
constructive
backtrack
procedural abstraction
28. A sequence of records - where each record contains a link to the next one
linked list
gedanken
type
linear O(n)
29. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
inorder
well-founded ordering xml
reference type
set difference
30. 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
successor
binary tree
array
ontology
31. Separation of the properties of a data type from its implementation
data abstraction
postorder
data type
garbage collection
32. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
dictionary
divide and conquer
algorithm
amortized Analysis
33. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
entinel
queue
simple data type
object
34. Composed of a collection of data values; implemented with a data structure
shadow
child
complex ADT
operator
35. To hide similar items with the same name
object
node
type
shadow
36. A tree node containing a contents value but with no children
grammar
queue
leaf
big o
37. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
dereference
algorithm
filter
divide and conquer
38. Values are in the most basic form and cannot be decomposed into smaller parts
shadow
simple data type
garbage collection
recursive case
39. A contiguous block of memory containing elements of the same type - accessed by numeric index
abstract data type
queue
array
fifo
40. To combine two ordered linear structures into one
procedural abstraction
data abstraction
design pattern
merge
41. A linked list in which each elements has both forward and backward pointers
stack
general list
doubly linked list
garbage collection
42. Any container with linear ordering
random access
general list
constructive
boxed number
43. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
preorder
pointer
object
immutable
44. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
intersection
taxonomy
operator
data structure
45. A problem whose solution requires a linear amount of time or space if the problem is size n
simple ADT
data abstraction
linear O(n)
object
46. Given two sets - the intersection is the set of elements that are members of both sets
intersection
stack
complex ADT
amortized Analysis
47. The next element in a linked list
pointer
complex data type
successor
inorder
48. To look through a data structure until a goal object is found
stack frame
simple data type
search
pointer
49. A linked list in which the last element points back to the first element
stack
grammar
circularly linked list
data abstraction
50. In a tree search - to move back from the node currently being examined to its parent
stack
node
backtrack
recursive case