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. 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?"
design pattern
amortized Analysis
binary search tree (bst)
interior node
2. A collection of objects that are inserted and removed according to the LIFO principle
stack
branching factor
gedanken
general list
3. Two variables that reference the same object
alias
data abstraction
recursion
set difference
4. Composed of multiple sequential elements stored in contiguous bytes of memory
array
algorithm
garbage collection
linked list
5. 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 tree
structure sharing
simple data type
postorder
6. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
queue
algorithm
class
set difference
7. Composed of individually named data fields
simple ADT
destructive
alias
LIFO
8. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
branching factor
algorithm
intersection
inorder
9. A given collection of values along with a collection of operations for use on those values
data type
destructive
general list
branching factor
10. Composed of a collection of data values; implemented with a data structure
pointer
complex ADT
interior node
binary tree
11. A sequence of records - where each record contains a link to the next one
postorder
linked list
alias
sort
12. Separation of the properties of a data type from its implementation
binary tree
data abstraction
binary search tree (bst)
dereference
13. 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
binary tree
recursive case
boxed number
shadow
14. A simple case that can be solved easily - without recursion
general list
quadratic
depth-first search
base case
15. First-child/next-sibling
parent
goal
fair
cons
16. Any container with linear ordering
general list
reference
depth-first search
descendants
17. Values are in the most basic form and cannot be decomposed into smaller parts
child
simple data type
binary tree
entinel
18. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
sort
doubly linked list
stack
19. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
garbage collection
child
search
ontology
20. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
boxed number
stack space
binary tree
21. An elements of a linked list - tree - or graph - often represented by a data structure
procedural abstraction
node
DFS
operator
22. In a search tree - a program that changes a state into a child state e.g a move in a game
complex data type
operator
class
taxonomy
23. A node of a tree that has children
successor
side-effect
interior node
pointer
24. The number of links between the root of a tree and the leaves
depth
binary search tree (bst)
divide and conquer
ancestors
25. A queue implemented within an array - where the first elements of the array logically follows the last elements
alias
stack space
circular queue
well-founded ordering xml
26. 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
linked list
ontology
reference
branching factor
27. A process that removes unwanted elements from a collection
successor
filter
scope
amortized Analysis
28. A pointer to the next element in a linked list
base case
link
complex data type
depth
29. The process of collecting garbage for recycling
garbage collection
recursion
side-effect
design pattern
30. A section of the runtime stack holding the values of all variables for one invocation
linked list
simple data type
stack frame
procedural abstraction
31. To look through a data structure until a goal object is found
parent
search
data type
node
32. A pointer to data
reference
complex data type
queue
general list
33. To combine two ordered linear structures into one
linked list
well-founded ordering xml
intersection
merge
34. 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 space
well-founded ordering xml
garbage
big o
35. A linked list in which the last element points back to the first element
postorder
well-founded ordering xml
stack space
circularly linked list
36. A linked list in which each elements has both forward and backward pointers
binary tree
depth
doubly linked list
ancestors
37. To hide similar items with the same name
shadow
node
null dereference
merge
38. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
destructive
leaf
type
39. A variable containing the address of other data
data structure
pointer
search
class
40. A tree node containing a contents value but with no children
circularly linked list
set difference
leaf
stack
41. A description of operations on a data type that could have multiple possible implementations
abstract data type
sort
association list
intractable
42. A classification of objects into a tree structure that groups related objects
taxonomy
circularly linked list
association list
simple data type
43. In a tree - a node that points to a given node
parent
dereference
binary tree
ancestors
44. An order of processing a tree in which the parent node is processed before its children
stack space
shadow
linear O(n)
preorder
45. An item (or description of items) being sough in a search
goal
data structure
class
preorder
46. A case where tow data structures share some elements
intersection
structure sharing
ontology
inorder
47. A runtime error that occurs when an operation such as method call is attempted on a null pointer
preorder
null dereference
algorithm
operator
48. Describes a function that makes a new data structure but does not modify its arguments
constructive
dereference
design pattern
root
49. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
shadow
intersection
queue
procedural abstraction
50. All nodes below a give node in a tree
descendants
constructive
recursive case
queue