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 top node of a tree - from which all other nodes can be reached
design pattern
root
scope
interior node
2. A classification of objects into a tree structure that groups related objects
leaf
taxonomy
pointer
linked list
3. A case where a program calls itself
base case
amortized Analysis
recursion
big o
4. A problem whose solution requires a linear amount of time or space if the problem is size n
quadratic
boxed number
general list
linear O(n)
5. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
DFS
shadow
backtrack
6. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
child
immutable
array
7. An item (or description of items) being sough in a search
intractable
pointer
stack space
goal
8. A node of a tree that has children
link
dictionary
interior node
doubly linked list
9. A list of pairs - where each pair has a key and a value associated with the key
depth-first search
stack
LIFO
association list
10. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
merge
procedural abstraction
queue
11. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
abstract data type
reference type
LIFO
12. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
side-effect
inorder
garbage collection
13. Given two sets -the union is the set of elements that are members of either set
fifo
union
root
recursive case
14. A pointer to data
reference
fair
destructive
inorder
15. An elements of a linked list - tree - or graph - often represented by a data structure
node
complex data type
postorder
merge
16. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
search
data structure
pointer
17. Describes a function that makes a new data structure but does not modify its arguments
constructive
object
inorder
fair
18. In object oriented programming - a description of a set of similar objects
reference
class
algorithm
preorder
19. A process that removes unwanted elements from a collection
array
preorder
filter
simple data type
20. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
reference
depth-first search
postorder
quadratic
21. A problem that is so hard that it cannot be solved unless the problem is small
array
link
design pattern
intractable
22. A simple case that can be solved easily - without recursion
leaf
descendants
base case
procedural abstraction
23. In a tree - a node that points to a given node
runtime stack
parent
class
amortized Analysis
24. A data structure that can be identified at runtime as being a member of a class
object
big o
postorder
LIFO
25. A contiguous block of memory containing elements of the same type - accessed by numeric index
garbage
array
inorder
ontology
26. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
intersection
immutable
grammar
data structure
27. Separation of the properties of a data type from its implementation
data abstraction
algorithm
garbage collection
type
28. A condition of the input data where the data will be handled by call(s) to the same program
constructive
recursive case
random access
child
29. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
constructive
grammar
postorder
entinel
30. The area of program text over which a variable can be referenced
scope
intractable
recursion
depth-first search
31. In a tree search - to move back from the node currently being examined to its parent
sort
complex ADT
complex data type
backtrack
32. To look through a data structure until a goal object is found
grammar
linear O(n)
search
branching factor
33. A linked list in which the last element points back to the first element
set difference
association list
recursion
circularly linked list
34. A description of the state of a process such as a board game
state
postorder
constructive
operator
35. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
algorithm
goal
garbage
36. Describes a though experiment or view of an entity
gedanken
fifo
depth
postorder
37. A description of operations on a data type that could have multiple possible implementations
DFS
operator
abstract data type
tail recursive
38. A section of the runtime stack holding the values of all variables for one invocation
postorder
stack frame
goal
depth-first search
39. Depth first search
data type
DFS
successor
doubly linked list
40. 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
dereference
abstract data type
binary search tree (bst)
base case
41. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
interior node
binary tree
random access
42. All nodes below a give node in a tree
association list
DFS
descendants
linked list
43. An order of processing a tree in which the parent node is processed after its children
root
taxonomy
sort
postorder
44. A linked list in which each elements has both forward and backward pointers
linear O(n)
binary tree
branching factor
doubly linked list
45. To hide similar items with the same name
backtrack
shadow
boxed number
reference
46. A search in which children of a node are considered before siblings are considered
null dereference
depth-first search
data type
sort
47. A collection of objects that are inserted and removed according to the LIFO principle
stack
amortized Analysis
well-founded ordering xml
search
48. An order of processing a tree in which the parent node is processed before its children
successor
doubly linked list
abstract data type
preorder
49. 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
garbage collection
sort
binary tree
operator
50. A pointer to the next element in a linked list
interior node
depth
link
complex ADT