Arrays
Records
Pointers
Stacks
A. Arrays
Last in first out
First in last out
Last in last out
First in first out
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
Arrays
Records
Pointers
None
array
lists
stacks
all of above
underflow
overflow
housefull
saturated
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
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
Queue
Stack
List
None of the above
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
Data
Operations
Both of the above
None 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
Stacks
Dequeues
Queues
Binary search tree
Operations
Algorithms
Storage Structures
None of above
underflow
overflow
housefull
saturated
O(n)
O(log )
O(n2)
O(n log n)
internal change
inter-module change
side effect
side-module update
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Traversal
Search
Sort
None of above
O(n)
O(log n)
O(n2)
O(n log n)
11
12
13
14
AVL tree
Red-black tree
Lemma tree
None of the above
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
Application level
Abstract level
Implementation level
All of the above
Abstract level
Implementation level
Application level
All of the above
linear arrays
linked lists
both of above
none of above
Binary search
Insertion sort
Radix sort
Polynomial manipulation
tables arrays
matrix arrays
both of above
none of above
Sorting
Merging
Inserting
Traversal
Linked lists
Stacks
Queues
Deque