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. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
general list
structure sharing
dictionary
2. An item (or description of items) being sough in a search
stack space
goal
data abstraction
garbage collection
3. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
queue
grammar
sort
reference
4. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java
queue
boxed number
quadratic
shadow
5. The amount of space on the runtime stack required for execution of a program
stack space
null dereference
reference
parent
6. A condition of the input data where the data will be handled by call(s) to the same program
sort
depth-first search
destructive
recursive case
7. An order of processing a tree in which the parent node is processed in between its children
dereference
queue
DFS
inorder
8. 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
root
fifo
depth-first search
binary tree
9. Separation of the properties of a data type from its implementation
data abstraction
operator
binary tree
inorder
10. A pattern that describes a set of similar programs
circularly linked list
binary tree
design pattern
operator
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?"
pointer
procedural abstraction
amortized Analysis
intersection
12. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
complex ADT
binary search tree (bst)
fair
13. An extra record at the start or end of a data structure such as a linked list - to simplify processing
queue
well-founded ordering xml
structure sharing
entinel
14. A collection of objects that are inserted and removed according to the LIFO principle
depth-first search
node
stack
general list
15. Any container with linear ordering
general list
queue
union
garbage collection
16. First-child/next-sibling
fair
complex ADT
LIFO
branching factor
17. The process of collecting garbage for recycling
binary search tree (bst)
complex data type
garbage collection
shadow
18. A search in which children of a node are considered before siblings are considered
well-founded ordering xml
postorder
depth-first search
quadratic
19. 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
big o
abstract data type
structure sharing
binary tree
20. A problem that is so hard that it cannot be solved unless the problem is small
union
shadow
intractable
tail recursive
21. A pointer to data
complex ADT
reference
doubly linked list
stack space
22. Describes a though experiment or view of an entity
successor
gedanken
child
well-founded ordering xml
23. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
LIFO
garbage
cons
24. A process that removes unwanted elements from a collection
simple data type
stack space
interior node
filter
25. 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
simple data type
garbage
cons
complex ADT
26. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
linear O(n)
dictionary
array
ontology
27. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
gedanken
data abstraction
algorithm
simple data type
28. Given two sets - the intersection is the set of elements that are members of both sets
intersection
garbage
DFS
reference
29. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
entinel
queue
link
filter
30. Values are in the most basic form and cannot be decomposed into smaller parts
data abstraction
simple data type
complex ADT
object
31. A case where a program calls itself
stack frame
pointer
well-founded ordering xml
recursion
32. Given two sets -the union is the set of elements that are members of either set
union
goal
parent
association list
33. A stack containing a stack frame of variable value for each active invocation of procedure
fair
runtime stack
data abstraction
successor
34. First in first out: describes ordering of a queue
fifo
descendants
fair
filter
35. The top node of a tree - from which all other nodes can be reached
association list
procedural abstraction
goal
root
36. In object oriented programming - a description of a set of similar objects
search
depth
fifo
class
37. In a tree - the union of a node's parent and the parent's ancestors
garbage collection
ancestors
link
binary search tree (bst)
38. 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
node
backtrack
goal
branching factor
39. A sequence of records - where each record contains a link to the next one
intersection
linked list
amortized Analysis
operator
40. A pointer to the next element in a linked list
simple ADT
doubly linked list
tail recursive
link
41. A section of the runtime stack holding the values of all variables for one invocation
goal
array
stack frame
null dereference
42. Constructed of multiple components (simple or complex types)
recursion
tail recursive
complex data type
descendants
43. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
circularly linked list
reference type
well-founded ordering xml
boxed number
44. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
stack frame
reference
side-effect
fair
45. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
runtime stack
set difference
reference
branching factor
46. An order of processing a tree in which the parent node is processed before its children
class
LIFO
search
preorder
47. Depth first search
base case
depth
DFS
reference
48. A description of operations on a data type that could have multiple possible implementations
set difference
abstract data type
binary tree
immutable
49. An elements of a linked list - tree - or graph - often represented by a data structure
gedanken
node
data abstraction
ancestors
50. A description of the state of a process such as a board game
ancestors
stack frame
recursion
state