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 section of the runtime stack holding the values of all variables for one invocation
binary search tree (bst)
stack frame
postorder
shadow
2. A classification of objects into a tree structure that groups related objects
grammar
taxonomy
postorder
doubly linked list
3. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
dereference
state
data type
4. Composed of multiple sequential elements stored in contiguous bytes of memory
union
array
divide and conquer
binary tree
5. A node of a tree that has children
LIFO
gedanken
interior node
algorithm
6. A pattern that describes a set of similar programs
garbage collection
sort
design pattern
successor
7. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
queue
intersection
successor
data structure
8. A data structure that can be identified at runtime as being a member of a class
goal
object
intersection
branching factor
9. Describes a function that makes a new data structure but does not modify its arguments
ancestors
stack
union
constructive
10. A problem whose solution requires a linear amount of time or space if the problem is size n
circularly linked list
scope
linear O(n)
stack space
11. Composed of individually named data fields
queue
leaf
algorithm
simple ADT
12. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
association list
immutable
stack space
simple data type
13. A search in which children of a node are considered before siblings are considered
base case
depth-first search
parent
random access
14. In a tree - the union of a node's parent and the parent's ancestors
algorithm
ancestors
root
random access
15. 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
big o
descendants
class
general list
16. The area of program text over which a variable can be referenced
scope
structure sharing
sort
merge
17. In a tree search - to move back from the node currently being examined to its parent
backtrack
immutable
successor
entinel
18. A list of pairs - where each pair has a key and a value associated with the key
class
association list
recursion
linear O(n)
19. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
design pattern
parent
algorithm
recursion
20. 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
grammar
association list
cons
state
21. An order of processing a tree in which the parent node is processed in between its children
inorder
design pattern
runtime stack
data structure
22. Container for storing a collection of data in unique key/value pairs
gedanken
dictionary
sort
design pattern
23. 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
null dereference
node
ancestors
24. The number of links between the root of a tree and the leaves
binary tree
shadow
fair
depth
25. A variable containing the address of other data
pointer
data abstraction
leaf
algorithm
26. In a tree - a node pointed to by a parent node
child
branching factor
search
garbage collection
27. 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?"
class
amortized Analysis
scope
grammar
28. Constructed of multiple components (simple or complex types)
class
complex data type
circularly linked list
linked list
29. An elements of a linked list - tree - or graph - often represented by a data structure
goal
ontology
node
fair
30. Composed of a collection of data values; implemented with a data structure
search
root
child
complex ADT
31. All nodes below a give node in a tree
stack
constructive
descendants
taxonomy
32. Use of a function or method without knowing how it's accomplished
procedural abstraction
garbage collection
side-effect
circular queue
33. A problem that is so hard that it cannot be solved unless the problem is small
intractable
entinel
complex ADT
intersection
34. A given collection of values along with a collection of operations for use on those values
operator
algorithm
data type
divide and conquer
35. The next element in a linked list
immutable
intersection
divide and conquer
successor
36. The amount of space on the runtime stack required for execution of a program
root
stack space
taxonomy
gedanken
37. 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
quadratic
recursive case
big o
38. A linked list in which each elements has both forward and backward pointers
doubly linked list
dereference
reference
descendants
39. 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
binary search tree (bst)
binary tree
alias
ancestors
40. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
binary search tree (bst)
structure sharing
depth-first search
set difference
41. Separation of the properties of a data type from its implementation
base case
depth
constructive
data abstraction
42. Describes a function that modifies its arguments
type
garbage
destructive
class
43. Describes a data structure or device in which all accesses have the same cost - O(1)
search
doubly linked list
random access
general list
44. A case where tow data structures share some elements
recursive case
parent
link
structure sharing
45. Given two sets - the intersection is the set of elements that are members of both sets
link
intersection
design pattern
side-effect
46. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
general list
simple data type
side-effect
47. A runtime error that occurs when an operation such as method call is attempted on a null pointer
LIFO
array
DFS
null dereference
48. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
doubly linked list
array
side-effect
data structure
49. An order of processing a tree in which the parent node is processed before its children
preorder
depth-first search
descendants
LIFO
50. A simple case that can be solved easily - without recursion
base case
abstract data type
simple data type
successor