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. A sequence of records - where each record contains a link to the next one
linked list
gedanken
node
union
2. Describes a function that makes a new data structure but does not modify its arguments
constructive
data type
simple data type
branching factor
3. In a tree - a node pointed to by a parent node
successor
child
ontology
stack
4. Composed of a collection of data values; implemented with a data structure
intersection
complex ADT
gedanken
random access
5. 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
dictionary
branching factor
association list
stack space
6. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents
binary search tree (bst)
linked list
LIFO
garbage collection
7. A simple case that can be solved easily - without recursion
base case
binary tree
amortized Analysis
preorder
8. The next element in a linked list
leaf
sort
successor
object
9. A problem whose solution requires a linear amount of time or space if the problem is size n
boxed number
immutable
linear O(n)
garbage collection
10. A description of the state of a process such as a board game
abstract data type
filter
state
stack
11. Given two sets - the intersection is the set of elements that are members of both sets
intersection
interior node
merge
alias
12. An order of processing a tree in which the parent node is processed in between its children
grammar
inorder
taxonomy
depth
13. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
preorder
set difference
queue
side-effect
14. A linked list in which the last element points back to the first element
circularly linked list
big o
set difference
design pattern
15. Composed of multiple sequential elements stored in contiguous bytes of memory
parent
immutable
array
tail recursive
16. A section of the runtime stack holding the values of all variables for one invocation
linked list
stack frame
immutable
object
17. In a tree - the union of a node's parent and the parent's ancestors
set difference
gedanken
type
ancestors
18. An order of processing a tree in which the parent node is processed after its children
postorder
divide and conquer
reference type
class
19. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
doubly linked list
general list
successor
queue
20. A description of operations on a data type that could have multiple possible implementations
divide and conquer
link
abstract data type
big o
21. 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?"
destructive
cons
divide and conquer
amortized Analysis
22. A case where a program calls itself
backtrack
recursion
cons
shadow
23. In a search tree - a program that changes a state into a child state e.g a move in a game
simple data type
divide and conquer
operator
array
24. Two variables that reference the same object
alias
reference type
garbage collection
procedural abstraction
25. A given collection of values along with a collection of operations for use on those values
side-effect
entinel
data type
random access
26. The amount of space on the runtime stack required for execution of a program
big o
stack frame
stack space
dereference
27. Use of a function or method without knowing how it's accomplished
procedural abstraction
reference type
garbage
parent
28. The top node of a tree - from which all other nodes can be reached
class
DFS
root
complex data type
29. First-child/next-sibling
link
branching factor
fair
random access
30. A stack containing a stack frame of variable value for each active invocation of procedure
merge
runtime stack
search
array
31. 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
boxed number
goal
big o
side-effect
32. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
root
data structure
immutable
postorder
33. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
dictionary
tail recursive
divide and conquer
search
34. A classification of objects into a tree structure that groups related objects
depth-first search
merge
taxonomy
data abstraction
35. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
leaf
sort
garbage collection
object
36. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
sort
queue
stack frame
37. An extra record at the start or end of a data structure such as a linked list - to simplify processing
stack
LIFO
entinel
binary search tree (bst)
38. A data structure that can be identified at runtime as being a member of a class
object
amortized Analysis
general list
immutable
39. The area of program text over which a variable can be referenced
scope
merge
child
constructive
40. To look through a data structure until a goal object is found
DFS
search
sort
data type
41. 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
association list
intersection
binary tree
42. A queue implemented within an array - where the first elements of the array logically follows the last elements
postorder
circular queue
parent
association list
43. A list of pairs - where each pair has a key and a value associated with the key
amortized Analysis
simple data type
association list
fair
44. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
design pattern
cons
base case
45. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
boxed number
object
branching factor
well-founded ordering xml
46. Last in first out: describes the order of a stack
LIFO
descendants
complex ADT
linear O(n)
47. Container for storing a collection of data in unique key/value pairs
shadow
inorder
dictionary
random access
48. A node of a tree that has children
interior node
leaf
goal
linked list
49. In a tree search - to move back from the node currently being examined to its parent
scope
descendants
circular queue
backtrack
50. Describes a data structure or device in which all accesses have the same cost - O(1)
data abstraction
random access
queue
set difference