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. In a tree search - to move back from the node currently being examined to its parent
search
state
backtrack
immutable
2. 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
dereference
algorithm
data abstraction
big o
3. First-child/next-sibling
fair
taxonomy
postorder
sort
4. The number of links between the root of a tree and the leaves
descendants
depth
garbage collection
design pattern
5. A linked list in which the last element points back to the first element
circularly linked list
stack space
tail recursive
child
6. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
structure sharing
depth
null dereference
divide and conquer
7. A variable containing the address of other data
LIFO
pointer
depth-first search
data abstraction
8. An order of processing a tree in which the parent node is processed in between its children
depth
inorder
branching factor
search
9. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
fair
circularly linked list
merge
10. Given two sets -the union is the set of elements that are members of either set
parent
union
scope
depth
11. To look through a data structure until a goal object is found
intractable
gedanken
queue
search
12. The top node of a tree - from which all other nodes can be reached
ontology
root
parent
simple data type
13. The area of program text over which a variable can be referenced
parent
object
constructive
scope
14. To combine two ordered linear structures into one
dereference
backtrack
merge
preorder
15. A condition of the input data where the data will be handled by call(s) to the same program
interior node
recursive case
circularly linked list
garbage
16. A list of pairs - where each pair has a key and a value associated with the key
tail recursive
class
association list
ancestors
17. In a tree - the union of a node's parent and the parent's ancestors
ancestors
class
depth-first search
link
18. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
stack frame
stack
root
side-effect
19. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
descendants
quadratic
complex data type
preorder
20. A runtime error that occurs when an operation such as method call is attempted on a null pointer
complex data type
grammar
null dereference
LIFO
21. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
destructive
grammar
immutable
abstract data type
22. In a tree - a node pointed to by a parent node
garbage collection
child
union
depth-first search
23. In a search tree - a program that changes a state into a child state e.g a move in a game
big o
descendants
simple ADT
operator
24. A problem that is so hard that it cannot be solved unless the problem is small
reference type
design pattern
intractable
goal
25. A section of the runtime stack holding the values of all variables for one invocation
stack frame
constructive
design pattern
complex ADT
26. A data structure that can be identified at runtime as being a member of a class
set difference
object
amortized Analysis
shadow
27. storage that is no longer pointed to by any variable and therefore can no longer be accessed
base case
intersection
garbage
simple ADT
28. Describes a though experiment or view of an entity
destructive
gedanken
recursion
binary tree
29. The process of collecting garbage for recycling
linked list
array
garbage collection
destructive
30. First in first out: describes ordering of a queue
fifo
immutable
branching factor
simple ADT
31. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
structure sharing
sort
abstract data type
cons
32. Values are in the most basic form and cannot be decomposed into smaller parts
descendants
simple data type
recursion
algorithm
33. 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?"
fifo
amortized Analysis
runtime stack
pointer
34. Container for storing a collection of data in unique key/value pairs
quadratic
association list
dictionary
doubly linked list
35. Depth first search
DFS
stack space
quadratic
child
36. A pattern that describes a set of similar programs
reference type
intersection
fifo
design pattern
37. Last in first out: describes the order of a stack
LIFO
preorder
operator
inorder
38. The amount of space on the runtime stack required for execution of a program
simple data type
descendants
binary tree
stack space
39. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
alias
intractable
cons
40. An item (or description of items) being sough in a search
grammar
array
goal
ontology
41. An order of processing a tree in which the parent node is processed before its children
link
cons
set difference
preorder
42. Constructed of multiple components (simple or complex types)
complex data type
ancestors
complex ADT
postorder
43. An order of processing a tree in which the parent node is processed after its children
postorder
data abstraction
quadratic
array
44. Describes a data structure or device in which all accesses have the same cost - O(1)
ontology
merge
random access
preorder
45. The next element in a linked list
recursion
root
successor
array
46. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
child
leaf
doubly linked list
47. A case where a program calls itself
goal
garbage
recursion
destructive
48. A linked list in which each elements has both forward and backward pointers
grammar
doubly linked list
sort
runtime stack
49. All nodes below a give node in a tree
depth-first search
intractable
algorithm
descendants
50. An elements of a linked list - tree - or graph - often represented by a data structure
descendants
child
design pattern
node