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. Separation of the properties of a data type from its implementation
depth-first search
well-founded ordering xml
binary tree
data abstraction
2. A tree node containing a contents value but with no children
circular queue
leaf
merge
random access
3. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
node
divide and conquer
ontology
gedanken
4. An order of processing a tree in which the parent node is processed after its children
shadow
depth
side-effect
postorder
5. Any container with linear ordering
circularly linked list
stack
general list
base case
6. A linked list in which each elements has both forward and backward pointers
doubly linked list
pointer
taxonomy
intractable
7. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
quadratic
linked list
LIFO
8. A problem that is so hard that it cannot be solved unless the problem is small
intractable
branching factor
union
array
9. To convert from a pointer to the data that is pointed to
complex ADT
descendants
constructive
dereference
10. Composed of a collection of data values; implemented with a data structure
DFS
complex ADT
constructive
circularly linked list
11. A given collection of values along with a collection of operations for use on those values
entinel
stack space
data type
interior node
12. The process of collecting garbage for recycling
array
garbage collection
simple ADT
linear O(n)
13. Composed of multiple sequential elements stored in contiguous bytes of memory
array
procedural abstraction
garbage
dereference
14. In a tree search - to move back from the node currently being examined to its parent
queue
tail recursive
backtrack
type
15. 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
merge
branching factor
stack frame
taxonomy
16. A queue implemented within an array - where the first elements of the array logically follows the last elements
binary tree
circular queue
binary search tree (bst)
tail recursive
17. Describes a though experiment or view of an entity
gedanken
general list
operator
divide and conquer
18. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
shadow
destructive
scope
19. Composed of individually named data fields
simple ADT
garbage
array
taxonomy
20. A collection of objects that are inserted and removed according to the LIFO principle
simple ADT
null dereference
stack
reference type
21. The next element in a linked list
successor
divide and conquer
abstract data type
state
22. 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
amortized Analysis
pointer
tail recursive
cons
23. To look through a data structure until a goal object is found
search
immutable
descendants
array
24. A classification of objects into a tree structure that groups related objects
taxonomy
child
scope
pointer
25. Container for storing a collection of data in unique key/value pairs
simple data type
inorder
entinel
dictionary
26. A simple case that can be solved easily - without recursion
reference
base case
boxed number
structure sharing
27. In a tree - a node that points to a given node
parent
stack
filter
class
28. Given two sets - the intersection is the set of elements that are members of both sets
link
depth
complex data type
intersection
29. An order of processing a tree in which the parent node is processed before its children
random access
preorder
inorder
binary tree
30. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
LIFO
pointer
quadratic
set difference
31. A runtime error that occurs when an operation such as method call is attempted on a null pointer
depth
binary tree
null dereference
preorder
32. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
child
complex data type
depth-first search
33. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
recursive case
algorithm
general list
binary tree
34. The number of links between the root of a tree and the leaves
depth
gedanken
data type
set difference
35. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
reference
base case
linear O(n)
36. To hide similar items with the same name
shadow
side-effect
constructive
base case
37. First in first out: describes ordering of a queue
descendants
complex ADT
circular queue
fifo
38. To combine two ordered linear structures into one
ontology
LIFO
node
merge
39. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"
amortized Analysis
procedural abstraction
tail recursive
preorder
40. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
well-founded ordering xml
fifo
stack
41. A description of operations on a data type that could have multiple possible implementations
array
abstract data type
tail recursive
reference type
42. A section of the runtime stack holding the values of all variables for one invocation
stack frame
search
child
data structure
43. A list of pairs - where each pair has a key and a value associated with the key
association list
node
circular queue
circularly linked list
44. An elements of a linked list - tree - or graph - often represented by a data structure
node
dictionary
side-effect
root
45. A case where a program calls itself
intersection
recursion
immutable
simple data type
46. A linked list in which the last element points back to the first element
circularly linked list
entinel
shadow
array
47. 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
data structure
filter
binary tree
simple data type
48. 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
base case
association list
doubly linked list
binary search tree (bst)
49. Constructed of multiple components (simple or complex types)
reference type
complex data type
postorder
inorder
50. Describes a function that makes a new data structure but does not modify its arguments
LIFO
constructive
amortized Analysis
data abstraction