Trees
Graphs
Arrays
None of above
C. Arrays
Dynamic programming
Greedy method
Divide and conquer
Backtracking
AVL tree
Red-black tree
Lemma tree
None of the above
elementary items
atoms
scalars
all of above
underflow
overflow
housefull
saturated
mn
max(m,n)
min(m,n)
m+n-1
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
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
Tree
Graph
Priority
Dequeue
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
Graph
Binary tree
Trees
Stack
Array
Stack
Tree
queue
Stacks linked list
Queue linked list
Both of them
Neither of them
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Traversal
Search
Sort
None of above
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
Application level
Abstract level
Implementation level
All of the above
Trees
Graphs
Arrays
None of above
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
push, pop
insert, delete
pop, push
delete, insert
Queue
Stack
List
None of the above
FIFO lists
LIFO list
Piles
Push-down lists
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
Processor and memory
Complexity and capacity
Time and space
Data and space
Arrays
Records
Pointers
Stacks
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
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
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
O(n)
O(log n)
O(n2)
O(n log n)