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. First-child/next-sibling
quadratic
fair
node
linear O(n)
2. Composed of individually named data fields
state
doubly linked list
simple ADT
design pattern
3. Any container with linear ordering
dictionary
general list
class
stack space
4. In a tree - a node pointed to by a parent node
child
interior node
constructive
binary tree
5. A linked list in which each elements has both forward and backward pointers
fifo
state
doubly linked list
immutable
6. The amount of space on the runtime stack required for execution of a program
side-effect
sort
reference type
stack space
7. A problem that is so hard that it cannot be solved unless the problem is small
reference type
intractable
goal
queue
8. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
filter
alias
recursion
9. In a tree - a node that points to a given node
quadratic
linear O(n)
parent
LIFO
10. A simple case that can be solved easily - without recursion
dictionary
set difference
base case
reference type
11. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
tail recursive
operator
algorithm
grammar
12. To combine two ordered linear structures into one
simple data type
merge
simple ADT
alias
13. Depth first search
linked list
fair
queue
DFS
14. To convert from a pointer to the data that is pointed to
parent
tail recursive
dereference
runtime stack
15. A stack containing a stack frame of variable value for each active invocation of procedure
ontology
random access
search
runtime stack
16. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
operator
shadow
fair
17. The number of links between the root of a tree and the leaves
interior node
state
search
depth
18. Use of a function or method without knowing how it's accomplished
destructive
random access
procedural abstraction
stack space
19. 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
reference
simple data type
scope
20. 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
link
big o
node
set difference
21. A description of the state of a process such as a board game
state
immutable
circularly linked list
algorithm
22. To look through a data structure until a goal object is found
search
fifo
circularly linked list
object
23. A problem whose solution requires a linear amount of time or space if the problem is size n
algorithm
backtrack
linear O(n)
type
24. A given collection of values along with a collection of operations for use on those values
descendants
sort
data type
circular queue
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
array
fifo
cons
entinel
26. The area of program text over which a variable can be referenced
scope
big o
data abstraction
doubly linked list
27. A list of pairs - where each pair has a key and a value associated with the key
ontology
association list
recursive case
interior node
28. 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
structure sharing
taxonomy
array
binary tree
29. Two variables that reference the same object
alias
doubly linked list
intractable
child
30. The next element in a linked list
side-effect
object
structure sharing
successor
31. A search in which children of a node are considered before siblings are considered
data type
pointer
depth-first search
divide and conquer
32. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
class
side-effect
goal
array
33. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
big o
data abstraction
amortized Analysis
34. A linked list in which the last element points back to the first element
circularly linked list
state
merge
side-effect
35. An order of processing a tree in which the parent node is processed in between its children
inorder
entinel
goal
amortized Analysis
36. In a tree - the union of a node's parent and the parent's ancestors
type
base case
immutable
ancestors
37. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
immutable
binary search tree (bst)
union
38. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
merge
link
quadratic
39. Given two sets -the union is the set of elements that are members of either set
inorder
union
sort
destructive
40. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
complex ADT
depth-first search
fifo
41. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
data type
depth
constructive
immutable
42. A description of operations on a data type that could have multiple possible implementations
data abstraction
abstract data type
garbage collection
taxonomy
43. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
grammar
data type
type
44. Describes a though experiment or view of an entity
big o
gedanken
association list
binary tree
45. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
complex ADT
structure sharing
data structure
46. A classification of objects into a tree structure that groups related objects
intersection
taxonomy
ancestors
depth
47. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
root
reference
immutable
48. A collection of values
search
linear O(n)
DFS
type
49. A tree node containing a contents value but with no children
leaf
algorithm
data structure
state
50. A collection of objects that are inserted and removed according to the LIFO principle
immutable
stack
dereference
intersection