Stacks linked list
Queue linked list
Both of them
Neither of them
B. Queue linked list
Arrays
Records
Pointers
None
16
12
6
10
O(n)
O(log n)
O(n2)
O(n log n)
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
underflow
overflow
housefull
saturated
Stacks
Dequeues
Queues
Binary search tree
Application level
Abstract level
Implementation level
All of the above
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
Binary search
Insertion sort
Radix sort
Polynomial manipulation
elementary items
atoms
scalars
all of above
O(n)
O(log n)
O(n2)
O(n log n)
Operations
Algorithms
Storage Structures
None of above
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Trees
Graphs
Arrays
None of above
Linked lists
Stacks
Queues
Deque
sorted linked list
sorted binary trees
sorted linear array
pointer array
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Arrays
Records
Pointers
None
array
lists
stacks
all of above
Tree
Graph
Priority
Dequeue
Graph
Binary tree
Trees
Stack
floor address
foundation address
first address
base address
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
Stack
Queue
List
Link list
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
grounded header list
circular header list
linked list with header and trailer nodes
none of above
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
tables arrays
matrix arrays
both of above
none of above
Queue
Stack
List
None of the above