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 contiguous block of memory containing elements of the same type - accessed by numeric index
tail recursive
array
well-founded ordering xml
state
2. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
link
queue
random access
fifo
3. A problem whose solution requires a linear amount of time or space if the problem is size n
array
shadow
stack frame
linear O(n)
4. First in first out: describes ordering of a queue
fifo
recursive case
recursion
array
5. A list of pairs - where each pair has a key and a value associated with the key
association list
garbage collection
null dereference
child
6. To look through a data structure until a goal object is found
side-effect
search
shadow
data structure
7. An item (or description of items) being sough in a search
set difference
circularly linked list
array
goal
8. In a tree - a node that points to a given node
state
link
linear O(n)
parent
9. The area of program text over which a variable can be referenced
shadow
operator
scope
immutable
10. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
linked list
simple ADT
constructive
data structure
11. A description of operations on a data type that could have multiple possible implementations
garbage
big o
goal
abstract data type
12. A queue implemented within an array - where the first elements of the array logically follows the last elements
null dereference
LIFO
data structure
circular queue
13. 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
quadratic
class
DFS
binary search tree (bst)
14. In a tree - a node pointed to by a parent node
child
depth
binary tree
destructive
15. A collection of objects that are inserted and removed according to the LIFO principle
structure sharing
stack
complex ADT
base case
16. Container for storing a collection of data in unique key/value pairs
array
immutable
association list
dictionary
17. A linked list in which the last element points back to the first element
branching factor
circularly linked list
goal
entinel
18. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
cons
destructive
reference
19. A case where a program calls itself
recursion
circularly linked list
runtime stack
preorder
20. A simple case that can be solved easily - without recursion
data abstraction
scope
base case
sort
21. storage that is no longer pointed to by any variable and therefore can no longer be accessed
link
root
runtime stack
garbage
22. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
binary tree
postorder
tail recursive
linear O(n)
23. An order of processing a tree in which the parent node is processed after its children
descendants
root
postorder
side-effect
24. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
boxed number
well-founded ordering xml
fifo
data abstraction
25. A condition of the input data where the data will be handled by call(s) to the same program
data structure
ontology
branching factor
recursive case
26. 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
null dereference
simple data type
parent
cons
27. A pattern that describes a set of similar programs
design pattern
circular queue
child
parent
28. A description of the state of a process such as a board game
data structure
garbage collection
state
destructive
29. 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
dereference
reference type
array
branching factor
30. The process of collecting garbage for recycling
structure sharing
data type
recursion
garbage collection
31. The top node of a tree - from which all other nodes can be reached
root
intractable
dereference
divide and conquer
32. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
gedanken
quadratic
complex ADT
binary search tree (bst)
33. A pointer to data
reference
linked list
gedanken
goal
34. In object oriented programming - a description of a set of similar objects
scope
class
linear O(n)
intractable
35. A process that removes unwanted elements from a collection
tail recursive
recursive case
state
filter
36. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
branching factor
base case
node
37. All nodes below a give node in a tree
linked list
scope
circular queue
descendants
38. A problem that is so hard that it cannot be solved unless the problem is small
cons
intractable
doubly linked list
root
39. A section of the runtime stack holding the values of all variables for one invocation
operator
data abstraction
tail recursive
stack frame
40. 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?"
garbage
amortized Analysis
depth
procedural abstraction
41. In a tree search - to move back from the node currently being examined to its parent
procedural abstraction
backtrack
linear O(n)
union
42. Describes a function that modifies its arguments
postorder
linked list
doubly linked list
destructive
43. The number of links between the root of a tree and the leaves
garbage
object
cons
depth
44. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
preorder
entinel
divide and conquer
45. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
descendants
taxonomy
link
46. 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
ancestors
postorder
object
binary tree
47. A classification of objects into a tree structure that groups related objects
pointer
entinel
taxonomy
circularly linked list
48. Constructed of multiple components (simple or complex types)
reference type
complex data type
sort
data structure
49. A linked list in which each elements has both forward and backward pointers
recursive case
reference
doubly linked list
simple data type
50. Depth first search
reference type
boxed number
DFS
data abstraction