a) What are the applications of stack?
b) A complete binary tree contains 15 nodes. Calculate the depth of the tree.
c) Define ADT. What are its advantages?
d) What is the difference between linklist and array?
e) What is the difference between graph and tree?
f) What are the limitations of binary tree?
g) What is the complexity of an algorithm?
h) What is deque? List its different types?
i) What is Bubble sort technique?
j) Define :
(i) almost complete binary tree
(ii) strictly binary tree.
k) What are AVL trees? What are its advantages?
l) Write the complexities of
(i) Heap sort (ii) Quick sort (iii) Merge sort
m) Differentiate between depth first search and breadth first search.
n) Define :
(i) Minimum spanning tree
(ii) Forest
o) What are the applications of graph?
