Tree
Stack
Linked-list
Array
Single linked list
Linear doubly linked list
Circular linked list
None of these
S [Top-n]
S [Top+n]
S [Top-n-1]
None of the above
2
1
0
3
0
5
10
15
2
5
3
0
O(n logn)
O(2n)
O(n2)
None of above
First record of the actual data
Last record of the actual data
Pointer to the last record of the actual data
None of above
2 deletion and 3 additions
3 deletions and 2 additions
3 deletions and 3 additions
3 deletions and 4 additions
16
12
6
10
11
12
13
14
4
5
6
3
2,2,1,2,2
2,2,1,1,2
2,1,2,2,1
2,1,2,2,2
Has 19 nodes
Has 16 nodes
Has 15 nodes
None of the above
Log (n +1) - 1
Log (n)
Log (n -1)n -1
Log (n) + 1
Post order traversal
Inorder traversal
Preorder traversal
None of above
2.6
2.7
2.8
2.9
3
4
5
6
N/2
(n-1)/2
(n+1)/2
Log (n) + 1
Max(f(n),g(n))
Min(f(n),g(n))
F(n)+g(n)
F(n)*g(n)
It decides the best algorithm to solve a problem
It determines maximum size of a problem, that can be solved in given system in given time
It is the lower bound of growth rate of algorithm
None of the above
N2
N
N3
Nn
A1
A2
A3
A4
Bubble sort
Selection sort
Insertion sort
Merge sort
-------Top--| 4 | 6 |------------
------Top--| 5 | 4 | 6 |------------
-------Top--| 9 | 6 |------------
------Top--| 9 | 3 | 2 |------------
Bubble sort
Quick sort
Merge sort
Heap sort
Symbol table
Dope vector
Register vector
Activation table
5 x 6 matrix with 9 non-zero entries
5 x 6 matrix with 8 non-zero entries
6 x 5 matrix with 8 non-zero entries
6 x 5 matrix with 9 non-zero entries
FILO
FIFO
LIFO
Both a and c above
N
N2
N log n
Log n
Item is somewhere in the middle of the array
Item is not in the array at all
Item is the last element in the array
Item is the last element in the array or is not there at all
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
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
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
Front=-1
Front=(rear+1)%maxsize
Front=(front+1)%maxsize
Rear=(rear+1)%maxsize
Reversal of string
Evaluation of arithimatic operation
Real operating system
Recursion
1
2
0
3
Malloc
Calloc
Free
Realloc
0
1
2
4
Link list
Circular queue
Stack
Double ended queue
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.