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 amount of space on the runtime stack required for execution of a program
stack space
sort
binary tree
root
2. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
LIFO
parent
shadow
grammar
3. A linked list in which each elements has both forward and backward pointers
scope
array
doubly linked list
dictionary
4. A variable containing the address of other data
queue
dereference
pointer
goal
5. An extra record at the start or end of a data structure such as a linked list - to simplify processing
circularly linked list
backtrack
entinel
operator
6. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
immutable
side-effect
data structure
simple data type
7. storage that is no longer pointed to by any variable and therefore can no longer be accessed
base case
garbage
complex ADT
boxed number
8. A pointer to data
depth-first search
reference
constructive
taxonomy
9. In a tree - a node pointed to by a parent node
branching factor
child
sort
type
10. A pattern that describes a set of similar programs
base case
depth
immutable
design pattern
11. A description of operations on a data type that could have multiple possible implementations
simple ADT
abstract data type
general list
data structure
12. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
garbage collection
LIFO
intractable
immutable
13. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
data type
successor
scope
14. To look through a data structure until a goal object is found
inorder
search
filter
depth-first search
15. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
root
destructive
ontology
recursive case
16. A linked list in which the last element points back to the first element
set difference
gedanken
circularly linked list
branching factor
17. First in first out: describes ordering of a queue
tail recursive
DFS
recursion
fifo
18. Any container with linear ordering
procedural abstraction
general list
reference type
dereference
19. An order of processing a tree in which the parent node is processed before its children
binary search tree (bst)
preorder
doubly linked list
leaf
20. Given two sets -the union is the set of elements that are members of either set
immutable
data type
node
union
21. Composed of individually named data fields
quadratic
simple ADT
recursive case
fair
22. In a tree - the union of a node's parent and the parent's ancestors
well-founded ordering xml
intractable
backtrack
ancestors
23. A queue implemented within an array - where the first elements of the array logically follows the last elements
algorithm
amortized Analysis
root
circular queue
24. A collection of objects that are inserted and removed according to the LIFO principle
taxonomy
type
interior node
stack
25. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
runtime stack
entinel
LIFO
well-founded ordering xml
26. A condition of the input data where the data will be handled by call(s) to the same program
garbage
design pattern
operator
recursive case
27. A collection of values
object
type
tail recursive
binary search tree (bst)
28. All nodes below a give node in a tree
filter
depth-first search
descendants
operator
29. In a tree - a node that points to a given node
set difference
stack
parent
well-founded ordering xml
30. A section of the runtime stack holding the values of all variables for one invocation
stack frame
entinel
recursion
doubly linked list
31. Depth first search
complex data type
random access
recursive case
DFS
32. A stack containing a stack frame of variable value for each active invocation of procedure
queue
search
runtime stack
big o
33. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
taxonomy
intersection
garbage
data structure
34. 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
leaf
divide and conquer
big o
binary tree
35. Values are in the most basic form and cannot be decomposed into smaller parts
branching factor
successor
inorder
simple data type
36. A case where a program calls itself
recursion
grammar
class
garbage collection
37. To hide similar items with the same name
garbage collection
garbage
type
shadow
38. Composed of multiple sequential elements stored in contiguous bytes of memory
array
inorder
null dereference
root
39. In a tree search - to move back from the node currently being examined to its parent
inorder
DFS
type
backtrack
40. An elements of a linked list - tree - or graph - often represented by a data structure
recursive case
LIFO
node
parent
41. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
gedanken
class
null dereference
sort
42. A simple case that can be solved easily - without recursion
recursive case
amortized Analysis
depth
base case
43. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
node
algorithm
structure sharing
stack frame
44. A given collection of values along with a collection of operations for use on those values
amortized Analysis
dereference
abstract data type
data type
45. Describes a function that makes a new data structure but does not modify its arguments
constructive
well-founded ordering xml
simple ADT
linear O(n)
46. A list of pairs - where each pair has a key and a value associated with the key
data abstraction
association list
gedanken
quadratic
47. Two variables that reference the same object
linked list
alias
quadratic
cons
48. To combine two ordered linear structures into one
data abstraction
depth-first search
alias
merge
49. An order of processing a tree in which the parent node is processed after its children
algorithm
postorder
fair
data structure
50. A search in which children of a node are considered before siblings are considered
stack space
base case
array
depth-first search