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 top node of a tree - from which all other nodes can be reached
DFS
recursion
root
stack
2. Describes a function that makes a new data structure but does not modify its arguments
constructive
abstract data type
reference
linked list
3. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
root
reference
well-founded ordering xml
algorithm
4. A sequence of records - where each record contains a link to the next one
depth-first search
linked list
cons
array
5. Last in first out: describes the order of a stack
ancestors
shadow
LIFO
immutable
6. Given two sets - the intersection is the set of elements that are members of both sets
general list
intersection
backtrack
quadratic
7. The area of program text over which a variable can be referenced
random access
branching factor
amortized Analysis
scope
8. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
grammar
dictionary
depth-first search
9. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
procedural abstraction
reference type
sort
linear O(n)
10. Constructed of multiple components (simple or complex types)
preorder
complex data type
queue
circularly linked list
11. The amount of space on the runtime stack required for execution of a program
stack space
branching factor
linear O(n)
filter
12. A condition of the input data where the data will be handled by call(s) to the same program
intractable
recursive case
boxed number
destructive
13. The process of collecting garbage for recycling
complex ADT
constructive
procedural abstraction
garbage collection
14. Values are in the most basic form and cannot be decomposed into smaller parts
simple ADT
complex ADT
simple data type
successor
15. The next element in a linked list
union
garbage
simple data type
successor
16. A classification of objects into a tree structure that groups related objects
taxonomy
DFS
simple data type
postorder
17. A pointer to the next element in a linked list
immutable
backtrack
scope
link
18. In a tree - the union of a node's parent and the parent's ancestors
state
union
base case
ancestors
19. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
link
well-founded ordering xml
stack space
structure sharing
20. 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
branching factor
fair
quadratic
intersection
21. All nodes below a give node in a tree
merge
stack space
descendants
amortized Analysis
22. In a search tree - a program that changes a state into a child state e.g a move in a game
boxed number
dictionary
gedanken
operator
23. A pointer to data
reference
data type
dictionary
root
24. In a tree search - to move back from the node currently being examined to its parent
queue
entinel
backtrack
stack space
25. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
state
simple ADT
quadratic
binary tree
26. 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
fair
state
big o
recursion
27. A stack containing a stack frame of variable value for each active invocation of procedure
circularly linked list
search
binary search tree (bst)
runtime stack
28. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
set difference
recursion
structure sharing
ontology
29. Use of a function or method without knowing how it's accomplished
procedural abstraction
fair
binary tree
leaf
30. 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
reference type
data type
complex data type
DFS
31. A pattern that describes a set of similar programs
dereference
design pattern
scope
state
32. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
circular queue
set difference
child
33. Given two sets -the union is the set of elements that are members of either set
DFS
ancestors
binary search tree (bst)
union
34. 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?"
general list
intractable
destructive
amortized Analysis
35. To hide similar items with the same name
complex ADT
simple ADT
shadow
successor
36. A data structure that can be identified at runtime as being a member of a class
destructive
abstract data type
stack
object
37. In object oriented programming - a description of a set of similar objects
type
class
leaf
fair
38. A problem that is so hard that it cannot be solved unless the problem is small
intractable
cons
data type
reference type
39. storage that is no longer pointed to by any variable and therefore can no longer be accessed
null dereference
runtime stack
boxed number
garbage
40. First in first out: describes ordering of a queue
sort
fifo
quadratic
complex ADT
41. In a tree - a node that points to a given node
stack space
parent
preorder
constructive
42. A description of operations on a data type that could have multiple possible implementations
set difference
side-effect
abstract data type
array
43. A description of the state of a process such as a board game
state
dictionary
data abstraction
random access
44. Container for storing a collection of data in unique key/value pairs
dictionary
array
branching factor
garbage
45. Composed of multiple sequential elements stored in contiguous bytes of memory
array
side-effect
pointer
garbage collection
46. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
link
side-effect
dereference
doubly linked list
47. The number of links between the root of a tree and the leaves
linked list
algorithm
depth
well-founded ordering xml
48. To combine two ordered linear structures into one
complex ADT
merge
array
queue
49. In a tree - a node pointed to by a parent node
binary tree
leaf
data type
child
50. Depth first search
runtime stack
DFS
dereference
depth-first search