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. An item (or description of items) being sough in a search
grammar
goal
merge
garbage
2. A problem whose solution requires a linear amount of time or space if the problem is size n
stack
linear O(n)
taxonomy
search
3. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
simple ADT
fifo
child
4. A case where tow data structures share some elements
preorder
entinel
merge
structure sharing
5. Composed of multiple sequential elements stored in contiguous bytes of memory
doubly linked list
data type
array
reference
6. In a tree - the union of a node's parent and the parent's ancestors
procedural abstraction
merge
ancestors
boxed number
7. All nodes below a give node in a tree
descendants
algorithm
constructive
depth
8. storage that is no longer pointed to by any variable and therefore can no longer be accessed
dereference
complex ADT
garbage
amortized Analysis
9. The process of collecting garbage for recycling
node
garbage collection
set difference
pointer
10. An order of processing a tree in which the parent node is processed before its children
successor
inorder
object
preorder
11. A problem that is so hard that it cannot be solved unless the problem is small
recursive case
LIFO
intractable
taxonomy
12. First in first out: describes ordering of a queue
abstract data type
fifo
destructive
LIFO
13. In a search tree - a program that changes a state into a child state e.g a move in a game
entinel
complex ADT
alias
operator
14. The top node of a tree - from which all other nodes can be reached
root
postorder
preorder
pointer
15. A sequence of records - where each record contains a link to the next one
interior node
intractable
linked list
type
16. An extra record at the start or end of a data structure such as a linked list - to simplify processing
cons
depth-first search
entinel
postorder
17. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
queue
null dereference
divide and conquer
set difference
18. Given two sets - the intersection is the set of elements that are members of both sets
algorithm
preorder
reference
intersection
19. A description of the state of a process such as a board game
state
big o
pointer
set difference
20. Two variables that reference the same object
alias
well-founded ordering xml
gedanken
tail recursive
21. The area of program text over which a variable can be referenced
data structure
data type
algorithm
scope
22. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
garbage
sort
fifo
23. In a tree - a node that points to a given node
root
depth
data abstraction
parent
24. A variable containing the address of other data
pointer
gedanken
circular queue
reference
25. The next element in a linked list
goal
successor
base case
array
26. A section of the runtime stack holding the values of all variables for one invocation
design pattern
stack frame
entinel
simple data type
27. 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
tail recursive
postorder
state
big o
28. Values are in the most basic form and cannot be decomposed into smaller parts
big o
simple data type
abstract data type
shadow
29. A case where a program calls itself
recursion
random access
merge
divide and conquer
30. Last in first out: describes the order of a stack
alias
LIFO
scope
circular queue
31. A classification of objects into a tree structure that groups related objects
association list
parent
design pattern
taxonomy
32. Describes a though experiment or view of an entity
gedanken
filter
side-effect
set difference
33. A node of a tree that has children
shadow
boxed number
alias
interior node
34. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
garbage collection
parent
tail recursive
immutable
35. A pointer to data
state
dereference
taxonomy
reference
36. A queue implemented within an array - where the first elements of the array logically follows the last elements
stack space
structure sharing
alias
circular queue
37. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
cons
random access
base case
algorithm
38. 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
design pattern
reference type
link
parent
39. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
recursive case
cons
association list
ontology
40. Separation of the properties of a data type from its implementation
circularly linked list
data abstraction
simple ADT
operator
41. An order of processing a tree in which the parent node is processed after its children
linear O(n)
base case
merge
postorder
42. 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
well-founded ordering xml
operator
inorder
43. Constructed of multiple components (simple or complex types)
leaf
complex data type
null dereference
root
44. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
recursion
dereference
sort
stack
45. Describes a function that modifies its arguments
simple ADT
destructive
entinel
grammar
46. A contiguous block of memory containing elements of the same type - accessed by numeric index
taxonomy
child
array
abstract data type
47. The amount of space on the runtime stack required for execution of a program
depth
parent
stack space
set difference
48. In a tree search - to move back from the node currently being examined to its parent
backtrack
constructive
binary tree
object
49. A pattern that describes a set of similar programs
design pattern
queue
reference
complex data type
50. Describes a function that makes a new data structure but does not modify its arguments
inorder
constructive
DFS
structure sharing