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. Describes a function that makes a new data structure but does not modify its arguments
child
constructive
circular queue
cons
2. In a tree search - to move back from the node currently being examined to its parent
binary tree
backtrack
dereference
divide and conquer
3. The area of program text over which a variable can be referenced
binary tree
algorithm
pointer
scope
4. A description of operations on a data type that could have multiple possible implementations
LIFO
abstract data type
divide and conquer
destructive
5. A variable containing the address of other data
pointer
algorithm
linear O(n)
stack space
6. A search in which children of a node are considered before siblings are considered
stack frame
merge
depth-first search
fair
7. A simple case that can be solved easily - without recursion
design pattern
base case
side-effect
simple ADT
8. The number of links between the root of a tree and the leaves
pointer
link
depth
postorder
9. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
LIFO
tail recursive
recursive case
array
10. A tree node containing a contents value but with no children
null dereference
dictionary
leaf
parent
11. To convert from a pointer to the data that is pointed to
pointer
type
immutable
dereference
12. Describes a data structure or device in which all accesses have the same cost - O(1)
boxed number
random access
complex ADT
data type
13. A problem that is so hard that it cannot be solved unless the problem is small
object
structure sharing
intractable
circular queue
14. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
cons
sort
gedanken
simple data type
15. An order of processing a tree in which the parent node is processed before its children
recursive case
class
preorder
reference
16. To hide similar items with the same name
stack
shadow
DFS
intersection
17. A classification of objects into a tree structure that groups related objects
taxonomy
fair
descendants
inorder
18. First in first out: describes ordering of a queue
grammar
fifo
preorder
scope
19. An order of processing a tree in which the parent node is processed after its children
postorder
scope
cons
divide and conquer
20. Composed of multiple sequential elements stored in contiguous bytes of memory
data type
data abstraction
linked list
array
21. A pointer to data
linked list
depth-first search
reference
pointer
22. Given two sets - the intersection is the set of elements that are members of both sets
DFS
intersection
binary search tree (bst)
big o
23. Use of a function or method without knowing how it's accomplished
procedural abstraction
amortized Analysis
well-founded ordering xml
cons
24. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
DFS
queue
complex ADT
25. Last in first out: describes the order of a stack
backtrack
inorder
side-effect
LIFO
26. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
structure sharing
cons
tail recursive
set difference
27. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
gedanken
fifo
operator
28. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
boxed number
tail recursive
data structure
runtime stack
29. 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
fifo
backtrack
state
boxed number
30. A contiguous block of memory containing elements of the same type - accessed by numeric index
design pattern
array
well-founded ordering xml
ontology
31. A given collection of values along with a collection of operations for use on those values
divide and conquer
stack
data type
array
32. A process that removes unwanted elements from a collection
node
pointer
grammar
filter
33. A linked list in which the last element points back to the first element
quadratic
circularly linked list
complex ADT
stack space
34. Constructed of multiple components (simple or complex types)
backtrack
complex data type
set difference
DFS
35. To combine two ordered linear structures into one
dereference
simple ADT
stack space
merge
36. 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
binary tree
quadratic
complex ADT
fifo
37. All nodes below a give node in a tree
association list
object
descendants
linked list
38. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
depth-first search
dictionary
node
39. In object oriented programming - a description of a set of similar objects
class
garbage
entinel
recursion
40. First-child/next-sibling
inorder
fair
structure sharing
algorithm
41. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
reference
stack
circularly linked list
42. The amount of space on the runtime stack required for execution of a program
backtrack
pointer
fifo
stack space
43. A case where a program calls itself
scope
root
data type
recursion
44. 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?"
amortized Analysis
search
stack frame
recursive case
45. Depth first search
destructive
DFS
successor
intersection
46. Given two sets -the union is the set of elements that are members of either set
union
binary search tree (bst)
ontology
association list
47. A data structure that can be identified at runtime as being a member of a class
abstract data type
queue
object
circularly linked list
48. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
array
quadratic
data type
state
49. In a tree - a node that points to a given node
state
design pattern
parent
postorder
50. The top node of a tree - from which all other nodes can be reached
root
recursion
constructive
ontology