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 process of collecting garbage for recycling
link
garbage collection
stack frame
node
2. In a search tree - a program that changes a state into a child state e.g a move in a game
entinel
node
operator
class
3. A description of the state of a process such as a board game
linear O(n)
child
well-founded ordering xml
state
4. In a tree search - to move back from the node currently being examined to its parent
child
backtrack
association list
data type
5. A description of operations on a data type that could have multiple possible implementations
tail recursive
shadow
complex ADT
abstract data type
6. A tree node containing a contents value but with no children
complex data type
set difference
state
leaf
7. To convert from a pointer to the data that is pointed to
complex data type
dereference
alias
DFS
8. A stack containing a stack frame of variable value for each active invocation of procedure
doubly linked list
abstract data type
runtime stack
array
9. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
taxonomy
depth
node
10. Two variables that reference the same object
null dereference
well-founded ordering xml
alias
complex data type
11. 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?"
abstract data type
linked list
amortized Analysis
parent
12. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
interior node
tail recursive
object
13. The amount of space on the runtime stack required for execution of a program
immutable
goal
stack space
big o
14. A queue implemented within an array - where the first elements of the array logically follows the last elements
garbage collection
union
circular queue
branching factor
15. A condition of the input data where the data will be handled by call(s) to the same program
intractable
fair
destructive
recursive case
16. storage that is no longer pointed to by any variable and therefore can no longer be accessed
intersection
reference type
garbage
fair
17. A collection of values
simple ADT
type
DFS
array
18. Container for storing a collection of data in unique key/value pairs
dictionary
sort
alias
quadratic
19. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
stack frame
branching factor
link
20. A linked list in which the last element points back to the first element
random access
circularly linked list
simple data type
dereference
21. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
type
runtime stack
algorithm
set difference
22. 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
immutable
base case
reference type
procedural abstraction
23. A case where tow data structures share some elements
class
operator
structure sharing
link
24. First-child/next-sibling
pointer
operator
fair
entinel
25. A linked list in which each elements has both forward and backward pointers
divide and conquer
dictionary
descendants
doubly linked list
26. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
array
doubly linked list
well-founded ordering xml
27. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
depth-first search
divide and conquer
ancestors
root
28. A node of a tree that has children
union
interior node
design pattern
backtrack
29. An order of processing a tree in which the parent node is processed in between its children
inorder
immutable
queue
array
30. Last in first out: describes the order of a stack
association list
LIFO
inorder
stack
31. A pointer to the next element in a linked list
depth-first search
stack space
inorder
link
32. Composed of multiple sequential elements stored in contiguous bytes of memory
array
intersection
ancestors
procedural abstraction
33. Describes a though experiment or view of an entity
shadow
gedanken
data type
circularly linked list
34. An item (or description of items) being sough in a search
general list
dereference
goal
sort
35. A process that removes unwanted elements from a collection
simple data type
parent
filter
big o
36. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
stack frame
inorder
well-founded ordering xml
queue
37. An order of processing a tree in which the parent node is processed before its children
preorder
simple data type
base case
binary tree
38. A given collection of values along with a collection of operations for use on those values
runtime stack
data type
preorder
leaf
39. Describes a data structure or device in which all accesses have the same cost - O(1)
link
random access
structure sharing
alias
40. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
constructive
simple ADT
reference type
41. All nodes below a give node in a tree
immutable
interior node
descendants
LIFO
42. To combine two ordered linear structures into one
structure sharing
merge
data abstraction
big o
43. Values are in the most basic form and cannot be decomposed into smaller parts
branching factor
taxonomy
tail recursive
simple data type
44. 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
inorder
binary search tree (bst)
LIFO
45. In a tree - the union of a node's parent and the parent's ancestors
garbage
class
ancestors
union
46. A search in which children of a node are considered before siblings are considered
algorithm
doubly linked list
depth-first search
scope
47. The number of links between the root of a tree and the leaves
big o
runtime stack
filter
depth
48. An order of processing a tree in which the parent node is processed after its children
postorder
recursive case
merge
reference type
49. An elements of a linked list - tree - or graph - often represented by a data structure
structure sharing
array
node
search
50. A collection of objects that are inserted and removed according to the LIFO principle
divide and conquer
stack
scope
state