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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
data structure
ontology
queue
shadow
2. 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
link
ancestors
depth
3. A pattern that describes a set of similar programs
design pattern
null dereference
boxed number
preorder
4. 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?"
interior node
well-founded ordering xml
cons
amortized Analysis
5. A given collection of values along with a collection of operations for use on those values
type
dictionary
data type
null dereference
6. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
inorder
dictionary
tail recursive
recursion
7. Describes a data structure or device in which all accesses have the same cost - O(1)
constructive
random access
ontology
linear O(n)
8. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents
data type
binary search tree (bst)
side-effect
taxonomy
9. A collection of values
doubly linked list
search
type
boxed number
10. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
type
taxonomy
divide and conquer
boxed number
11. A linked list in which each elements has both forward and backward pointers
filter
doubly linked list
entinel
depth
12. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
array
algorithm
intractable
operator
13. 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
child
divide and conquer
big o
circularly linked list
14. Describes a function that makes a new data structure but does not modify its arguments
constructive
child
intersection
object
15. A process that removes unwanted elements from a collection
filter
procedural abstraction
linked list
array
16. Describes a function that modifies its arguments
union
destructive
boxed number
pointer
17. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
union
filter
array
immutable
18. Given two sets - the intersection is the set of elements that are members of both sets
circularly linked list
stack
depth-first search
intersection
19. An order of processing a tree in which the parent node is processed after its children
postorder
quadratic
structure sharing
null dereference
20. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
divide and conquer
sort
filter
set difference
21. An elements of a linked list - tree - or graph - often represented by a data structure
link
node
branching factor
root
22. Describes a though experiment or view of an entity
scope
intersection
null dereference
gedanken
23. Container for storing a collection of data in unique key/value pairs
divide and conquer
root
dictionary
recursion
24. The next element in a linked list
successor
binary tree
binary search tree (bst)
garbage
25. A case where tow data structures share some elements
DFS
structure sharing
type
garbage
26. A section of the runtime stack holding the values of all variables for one invocation
stack frame
big o
null dereference
filter
27. A description of operations on a data type that could have multiple possible implementations
association list
binary search tree (bst)
abstract data type
binary tree
28. To combine two ordered linear structures into one
general list
merge
link
queue
29. A variable containing the address of other data
well-founded ordering xml
pointer
side-effect
leaf
30. All nodes below a give node in a tree
descendants
well-founded ordering xml
gedanken
shadow
31. A search in which children of a node are considered before siblings are considered
circularly linked list
depth-first search
intractable
side-effect
32. 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
amortized Analysis
branching factor
queue
constructive
33. Composed of individually named data fields
structure sharing
simple ADT
type
data abstraction
34. First-child/next-sibling
dereference
DFS
fair
random access
35. To hide similar items with the same name
dictionary
shadow
simple ADT
successor
36. A list of pairs - where each pair has a key and a value associated with the key
divide and conquer
association list
parent
boxed number
37. An extra record at the start or end of a data structure such as a linked list - to simplify processing
ancestors
recursion
goal
entinel
38. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
quadratic
data structure
linear O(n)
side-effect
39. A pointer to data
intersection
runtime stack
ontology
reference
40. Last in first out: describes the order of a stack
LIFO
leaf
structure sharing
recursion
41. A problem that is so hard that it cannot be solved unless the problem is small
garbage
intractable
descendants
search
42. A linked list in which the last element points back to the first element
reference
merge
circularly linked list
class
43. Use of a function or method without knowing how it's accomplished
taxonomy
procedural abstraction
sort
destructive
44. The process of collecting garbage for recycling
DFS
simple ADT
garbage collection
grammar
45. A tree node containing a contents value but with no children
shadow
backtrack
leaf
linked list
46. An item (or description of items) being sough in a search
cons
backtrack
goal
linked list
47. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
data abstraction
intractable
scope
48. Composed of a collection of data values; implemented with a data structure
complex ADT
tail recursive
random access
fifo
49. In a tree - the union of a node's parent and the parent's ancestors
dereference
simple ADT
ancestors
entinel
50. The amount of space on the runtime stack required for execution of a program
DFS
data abstraction
stack space
grammar