Application level
Abstract level
Implementation level
All of the above
D. All of the above
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
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
True, False
False, True
True, True
False, False
Abstract level
Implementation level
Application level
All of the above
elementary items
atoms
scalars
all of above
Last in first out
First in last out
Last in last out
First in first out
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
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
underflow
overflow
housefull
saturated
Graph
Binary tree
Trees
Stack
mn
max(m,n)
min(m,n)
m+n-1
linear arrays
linked lists
both of above
none of above
FIFO lists
LIFO list
Piles
Push-down lists
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Arrays
Records
Pointers
None
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
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.
Processor and memory
Complexity and capacity
Time and space
Data and space
tables arrays
matrix arrays
both of above
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
Application level
Abstract level
Implementation level
All of the 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
List
Stacks
Trees
Strings
array
lists
stacks
all of 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
sorted linked list
sorted binary trees
sorted linear array
pointer array
Tree
Graph
Priority
Dequeue
AVL tree
Red-black tree
Lemma tree
None of the above
Linked lists
Stacks
Queues
Deque
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue