AVL tree
Red-black tree
Lemma tree
None of the above
A. AVL tree
Graph
Binary tree
Trees
Stack
Arrays
Records
Pointers
Stacks
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
O(n)
O(log n)
O(n2)
O(n log n)
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
floor address
foundation address
first address
base address
Best case
Null case
Worst case
Average case
Operations
Algorithms
Storage Structures
None of above
O(n)
O(log n)
O(n2)
O(n log n)
Traversal
Search
Sort
None of above
16
12
6
10
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
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
Stack
Queue
List
Link list
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
11
12
13
14
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
underflow
overflow
housefull
saturated
array
lists
stacks
all of above
Linked lists
Stacks
Queues
Deque
Array
Stack
Tree
queue
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
elementary items
atoms
scalars
all of above
Arrays
Records
Pointers
None
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
Tree
Graph
Priority
Dequeue