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. Constructed of multiple components (simple or complex types)
complex data type
doubly linked list
depth
well-founded ordering xml
2. In a tree - the union of a node's parent and the parent's ancestors
circular queue
cons
reference type
ancestors
3. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
interior node
complex data type
state
4. Describes a function that makes a new data structure but does not modify its arguments
union
intractable
constructive
stack
5. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
recursion
link
data type
6. A simple case that can be solved easily - without recursion
structure sharing
entinel
descendants
base case
7. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
complex ADT
ontology
reference type
data structure
8. A given collection of values along with a collection of operations for use on those values
garbage
data type
pointer
filter
9. A description of the state of a process such as a board game
base case
state
simple data type
boxed number
10. First-child/next-sibling
complex data type
fair
garbage collection
structure sharing
11. To combine two ordered linear structures into one
backtrack
merge
constructive
intractable
12. First in first out: describes ordering of a queue
stack
side-effect
reference type
fifo
13. Given two sets - the intersection is the set of elements that are members of both sets
algorithm
intersection
side-effect
shadow
14. A section of the runtime stack holding the values of all variables for one invocation
stack
tail recursive
data abstraction
stack frame
15. Any container with linear ordering
runtime stack
search
dereference
general list
16. A stack containing a stack frame of variable value for each active invocation of procedure
recursive case
class
runtime stack
circularly linked list
17. The number of links between the root of a tree and the leaves
tail recursive
intersection
depth
random access
18. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
side-effect
sort
association list
goal
19. An order of processing a tree in which the parent node is processed in between its children
depth-first search
destructive
reference type
inorder
20. An order of processing a tree in which the parent node is processed after its children
circular queue
ancestors
general list
postorder
21. The area of program text over which a variable can be referenced
scope
DFS
entinel
inorder
22. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
random access
child
goal
23. A sequence of records - where each record contains a link to the next one
linked list
simple data type
algorithm
data structure
24. Use of a function or method without knowing how it's accomplished
procedural abstraction
simple data type
search
leaf
25. 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
pointer
intractable
data type
26. A runtime error that occurs when an operation such as method call is attempted on a null pointer
union
backtrack
recursive case
null dereference
27. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
stack
grammar
design pattern
general list
28. In a tree search - to move back from the node currently being examined to its parent
fair
backtrack
runtime stack
simple ADT
29. Composed of individually named data fields
simple ADT
dereference
association list
sort
30. A pointer to data
root
side-effect
depth-first search
reference
31. A node of a tree that has children
simple data type
child
interior node
dictionary
32. In a tree - a node pointed to by a parent node
child
data structure
LIFO
recursive case
33. A condition of the input data where the data will be handled by call(s) to the same program
alias
boxed number
complex data type
recursive case
34. The top node of a tree - from which all other nodes can be reached
backtrack
algorithm
root
base case
35. Last in first out: describes the order of a stack
ancestors
LIFO
amortized Analysis
side-effect
36. An elements of a linked list - tree - or graph - often represented by a data structure
dereference
linked list
abstract data type
node
37. Container for storing a collection of data in unique key/value pairs
postorder
dictionary
preorder
reference type
38. Composed of multiple sequential elements stored in contiguous bytes of memory
fifo
pointer
array
structure sharing
39. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
simple ADT
runtime stack
binary tree
ontology
40. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
procedural abstraction
linked list
queue
operator
41. An item (or description of items) being sough in a search
class
DFS
preorder
goal
42. 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
reference type
general list
gedanken
fair
43. 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
branching factor
well-founded ordering xml
data abstraction
gedanken
44. The amount of space on the runtime stack required for execution of a program
stack space
branching factor
goal
structure sharing
45. 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
DFS
intersection
binary tree
association list
46. A collection of values
dereference
intersection
dictionary
type
47. A description of operations on a data type that could have multiple possible implementations
complex data type
abstract data type
LIFO
DFS
48. A pointer to the next element in a linked list
fifo
cons
reference
link
49. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
garbage collection
immutable
taxonomy
operator
50. A search in which children of a node are considered before siblings are considered
backtrack
stack space
depth
depth-first search