grounded header list
circular header list
linked list with header and trailer nodes
none of above
D. none of above
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
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.
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
Arrays
Records
Pointers
Stacks
underflow
overflow
housefull
saturated
AVL tree
Red-black tree
Lemma tree
None of the above
Graphs
Binary tree
Stacks
Queues
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
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
Stack
Queue
List
Link list
Data
Operations
Both of the above
None of the above
O(n)
O(log n)
O(n2)
O(n log n)
List
Stacks
Trees
Strings
underflow
overflow
housefull
saturated
Processor and memory
Complexity and capacity
Time and space
Data and space
Graph
Binary tree
Trees
Stack
Operations
Algorithms
Storage Structures
None of above
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
O(n)
O(log )
O(n2)
O(n log n)
Application level
Abstract level
Implementation level
All of the above
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Arrays
Records
Pointers
None
Arrays
Records
Pointers
None
Trees
Graphs
Arrays
None of above
16
12
6
10
Abstract level
Implementation level
Application level
All of the above
FIFO lists
LIFO list
Piles
Push-down lists
True, False
False, True
True, True
False, False