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 collection of values
random access
type
postorder
search
2. In a tree - a node pointed to by a parent node
data type
child
structure sharing
complex data type
3. Composed of individually named data fields
simple ADT
union
constructive
shadow
4. Any container with linear ordering
object
fifo
general list
state
5. First in first out: describes ordering of a queue
fifo
goal
child
quadratic
6. The amount of space on the runtime stack required for execution of a program
grammar
stack space
root
interior node
7. A case where a program calls itself
dereference
recursion
linked list
set difference
8. Container for storing a collection of data in unique key/value pairs
immutable
binary search tree (bst)
reference
dictionary
9. A pointer to data
abstract data type
reference
LIFO
design pattern
10. The process of collecting garbage for recycling
class
side-effect
garbage collection
binary search tree (bst)
11. Describes a though experiment or view of an entity
filter
constructive
alias
gedanken
12. The next element in a linked list
side-effect
successor
constructive
procedural abstraction
13. A list of pairs - where each pair has a key and a value associated with the key
descendants
parent
DFS
association list
14. A linked list in which each elements has both forward and backward pointers
reference type
stack space
binary tree
doubly linked list
15. Constructed of multiple components (simple or complex types)
gedanken
postorder
depth-first search
complex data type
16. The area of program text over which a variable can be referenced
side-effect
branching factor
sort
scope
17. To convert from a pointer to the data that is pointed to
fifo
abstract data type
dereference
descendants
18. In a search tree - a program that changes a state into a child state e.g a move in a game
set difference
operator
procedural abstraction
immutable
19. A simple case that can be solved easily - without recursion
data type
garbage collection
simple ADT
base case
20. An order of processing a tree in which the parent node is processed before its children
preorder
procedural abstraction
garbage
object
21. In a tree - the union of a node's parent and the parent's ancestors
ancestors
intractable
ontology
pointer
22. A tree node containing a contents value but with no children
binary search tree (bst)
child
leaf
stack
23. A stack containing a stack frame of variable value for each active invocation of procedure
ontology
runtime stack
dictionary
cons
24. The top node of a tree - from which all other nodes can be reached
abstract data type
root
cons
fair
25. An elements of a linked list - tree - or graph - often represented by a data structure
boxed number
algorithm
stack frame
node
26. All nodes below a give node in a tree
state
descendants
linear O(n)
recursion
27. A description of operations on a data type that could have multiple possible implementations
abstract data type
linked list
class
big o
28. Separation of the properties of a data type from its implementation
design pattern
intractable
data abstraction
pointer
29. Composed of a collection of data values; implemented with a data structure
ancestors
complex ADT
intersection
circular queue
30. Composed of multiple sequential elements stored in contiguous bytes of memory
data type
array
constructive
recursion
31. storage that is no longer pointed to by any variable and therefore can no longer be accessed
null dereference
grammar
leaf
garbage
32. 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
algorithm
linear O(n)
boxed number
postorder
33. Two variables that reference the same object
procedural abstraction
union
alias
sort
34. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
dictionary
ontology
complex ADT
35. A section of the runtime stack holding the values of all variables for one invocation
data structure
stack frame
recursion
stack space
36. Given two sets -the union is the set of elements that are members of either set
intractable
amortized Analysis
union
constructive
37. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
complex ADT
postorder
array
38. A classification of objects into a tree structure that groups related objects
node
structure sharing
well-founded ordering xml
taxonomy
39. In a tree search - to move back from the node currently being examined to its parent
backtrack
pointer
child
structure sharing
40. 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
parent
garbage collection
descendants
binary tree
41. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
doubly linked list
linked list
postorder
42. A contiguous block of memory containing elements of the same type - accessed by numeric index
side-effect
array
big o
dereference
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
divide and conquer
merge
amortized Analysis
44. Use of a function or method without knowing how it's accomplished
procedural abstraction
scope
successor
pointer
45. A node of a tree that has children
interior node
well-founded ordering xml
boxed number
merge
46. A case where tow data structures share some elements
branching factor
postorder
stack frame
structure sharing
47. A linked list in which the last element points back to the first element
well-founded ordering xml
dereference
operator
circularly linked list
48. Given two sets - the intersection is the set of elements that are members of both sets
linked list
complex data type
child
intersection
49. 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
leaf
binary search tree (bst)
well-founded ordering xml
type
50. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
filter
well-founded ordering xml
reference type