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 hide similar items with the same name
recursive case
simple ADT
stack frame
shadow
2. In a search tree - a program that changes a state into a child state e.g a move in a game
ontology
operator
reference type
constructive
3. A problem that is so hard that it cannot be solved unless the problem is small
divide and conquer
array
pointer
intractable
4. To combine two ordered linear structures into one
node
depth
garbage collection
merge
5. All nodes below a give node in a tree
DFS
general list
quadratic
descendants
6. To convert from a pointer to the data that is pointed to
recursion
depth-first search
dereference
simple ADT
7. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
dictionary
root
ontology
data type
8. The number of links between the root of a tree and the leaves
structure sharing
union
linear O(n)
depth
9. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
divide and conquer
goal
algorithm
reference
10. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
abstract data type
postorder
set difference
simple ADT
11. Last in first out: describes the order of a stack
LIFO
operator
cons
leaf
12. Composed of multiple sequential elements stored in contiguous bytes of memory
divide and conquer
array
filter
simple data type
13. A tree node containing a contents value but with no children
preorder
depth
leaf
association list
14. A collection of objects that are inserted and removed according to the LIFO principle
dereference
stack
shadow
union
15. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
garbage collection
goal
type
16. An elements of a linked list - tree - or graph - often represented by a data structure
constructive
node
runtime stack
procedural abstraction
17. A queue implemented within an array - where the first elements of the array logically follows the last elements
data type
quadratic
boxed number
circular queue
18. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
leaf
ontology
interior node
well-founded ordering xml
19. storage that is no longer pointed to by any variable and therefore can no longer be accessed
parent
binary tree
garbage
linear O(n)
20. In a tree - the union of a node's parent and the parent's ancestors
backtrack
ancestors
general list
side-effect
21. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
fifo
side-effect
simple data type
data type
22. A linked list in which each elements has both forward and backward pointers
tail recursive
array
doubly linked list
simple ADT
23. An order of processing a tree in which the parent node is processed in between its children
reference
association list
inorder
taxonomy
24. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
depth-first search
scope
base case
25. A case where tow data structures share some elements
structure sharing
general list
grammar
postorder
26. Two variables that reference the same object
alias
design pattern
null dereference
binary tree
27. Composed of a collection of data values; implemented with a data structure
complex ADT
DFS
state
tail recursive
28. A pointer to data
pointer
intersection
reference
sort
29. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
root
ontology
data structure
quadratic
30. Any container with linear ordering
general list
preorder
state
branching factor
31. A description of operations on a data type that could have multiple possible implementations
abstract data type
linear O(n)
child
pointer
32. An item (or description of items) being sough in a search
linked list
goal
taxonomy
reference type
33. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
data structure
LIFO
branching factor
divide and conquer
34. Constructed of multiple components (simple or complex types)
child
data abstraction
preorder
complex data type
35. A given collection of values along with a collection of operations for use on those values
stack
descendants
runtime stack
data type
36. The area of program text over which a variable can be referenced
type
scope
root
LIFO
37. Composed of individually named data fields
random access
simple ADT
stack space
depth-first search
38. A problem whose solution requires a linear amount of time or space if the problem is size n
interior node
linear O(n)
taxonomy
queue
39. In object oriented programming - a description of a set of similar objects
class
array
intractable
pointer
40. Container for storing a collection of data in unique key/value pairs
dictionary
recursive case
data abstraction
grammar
41. An extra record at the start or end of a data structure such as a linked list - to simplify processing
design pattern
fifo
entinel
binary tree
42. Use of a function or method without knowing how it's accomplished
descendants
procedural abstraction
LIFO
queue
43. Describes a function that modifies its arguments
destructive
dereference
complex ADT
leaf
44. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
data structure
recursion
garbage collection
45. In a tree - a node that points to a given node
branching factor
parent
LIFO
binary tree
46. The amount of space on the runtime stack required for execution of a program
stack space
entinel
fair
merge
47. In a tree search - to move back from the node currently being examined to its parent
backtrack
stack
stack space
child
48. A search in which children of a node are considered before siblings are considered
state
dictionary
depth-first search
link
49. To look through a data structure until a goal object is found
dictionary
backtrack
search
pointer
50. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
postorder
pointer
quadratic
queue