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. The number of links between the root of a tree and the leaves
root
depth
type
reference type
2. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
node
stack
destructive
set difference
3. A problem that is so hard that it cannot be solved unless the problem is small
intractable
abstract data type
quadratic
object
4. An elements of a linked list - tree - or graph - often represented by a data structure
node
procedural abstraction
root
recursion
5. Composed of a collection of data values; implemented with a data structure
complex ADT
cons
union
root
6. In a tree - the union of a node's parent and the parent's ancestors
depth-first search
root
reference
ancestors
7. All nodes below a give node in a tree
well-founded ordering xml
descendants
linked list
operator
8. A queue implemented within an array - where the first elements of the array logically follows the last elements
filter
simple data type
reference type
circular queue
9. Describes a function that modifies its arguments
destructive
descendants
abstract data type
depth-first search
10. In a tree - a node pointed to by a parent node
scope
binary search tree (bst)
child
search
11. 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
stack
big o
dictionary
structure sharing
12. A section of the runtime stack holding the values of all variables for one invocation
branching factor
sort
gedanken
stack frame
13. In a tree - a node that points to a given node
goal
simple ADT
reference
parent
14. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
root
circularly linked list
grammar
reference
15. An order of processing a tree in which the parent node is processed in between its children
constructive
inorder
divide and conquer
null dereference
16. Describes a though experiment or view of an entity
recursion
stack
tail recursive
gedanken
17. To combine two ordered linear structures into one
linear O(n)
backtrack
merge
grammar
18. Two variables that reference the same object
alias
branching factor
circularly linked list
intersection
19. A node of a tree that has children
interior node
intractable
stack
destructive
20. A given collection of values along with a collection of operations for use on those values
pointer
data type
search
fair
21. Any container with linear ordering
general list
object
recursion
simple data type
22. Given two sets - the intersection is the set of elements that are members of both sets
recursion
circular queue
intersection
linear O(n)
23. An item (or description of items) being sough in a search
tail recursive
type
dictionary
goal
24. 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?"
stack
descendants
abstract data type
amortized Analysis
25. Given two sets -the union is the set of elements that are members of either set
branching factor
union
boxed number
stack
26. A pointer to data
backtrack
link
circularly linked list
reference
27. 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
ontology
goal
binary tree
well-founded ordering xml
28. A list of pairs - where each pair has a key and a value associated with the key
association list
structure sharing
grammar
complex data type
29. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
association list
data structure
inorder
gedanken
30. A stack containing a stack frame of variable value for each active invocation of procedure
procedural abstraction
reference
interior node
runtime stack
31. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
design pattern
ontology
postorder
simple data type
32. Depth first search
parent
design pattern
leaf
DFS
33. 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
big o
linear O(n)
pointer
reference type
34. A collection of objects that are inserted and removed according to the LIFO principle
procedural abstraction
entinel
ontology
stack
35. Constructed of multiple components (simple or complex types)
destructive
binary search tree (bst)
merge
complex data type
36. First in first out: describes ordering of a queue
fifo
association list
ontology
root
37. A search in which children of a node are considered before siblings are considered
complex ADT
dereference
well-founded ordering xml
depth-first search
38. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
fifo
garbage
entinel
side-effect
39. 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
alias
intersection
design pattern
40. The top node of a tree - from which all other nodes can be reached
root
dictionary
inorder
taxonomy
41. The amount of space on the runtime stack required for execution of a program
cons
stack space
array
procedural abstraction
42. Describes a function that makes a new data structure but does not modify its arguments
constructive
random access
reference
depth-first search
43. A collection of values
data structure
union
type
sort
44. First-child/next-sibling
dictionary
fair
simple data type
tail recursive
45. A description of operations on a data type that could have multiple possible implementations
merge
abstract data type
recursion
doubly linked list
46. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
stack space
algorithm
node
array
47. In a tree search - to move back from the node currently being examined to its parent
general list
backtrack
complex data type
complex ADT
48. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
data structure
type
tail recursive
operator
49. The process of collecting garbage for recycling
class
garbage collection
preorder
child
50. Last in first out: describes the order of a stack
garbage collection
LIFO
linear O(n)
descendants