a) insertion sort.  b) selection sort.  c) heap sort.  d) quick sort.

a) Binary Search b) Linear Search  c) Tree Search  d) Hashing 

a) heap and selection sort  b) insertion sort & merge sort c) merge sort and heap sort  d) None of these

 a) Merkle tree b) T -tree c) Hash table d) Bx-tree

a) Dynamic Programming  b) Backtracking  c) Greedy method  d) Divide and Conquer

a) in digital currency b) in sorting of large data c) for indexing in databases d) in encryption of data

a) B+ – tree b) T tree c) Tiger tree hash d) Htree

 a) Heap b) Hash list c) BST d) B – tree

 a) Priority queue b) Stack c) A decreasing order array d) None of the mentioned

a) Leaf node b) First node of left sub tree c) root node d) First node of right sub tree

a) 24 b) 21 c) 25 d) 16

a) Must be connected b) Must be unweighted c) Must have no loops or multiple edges d) All of the mentioned

a) 15 b) 3 c) 1 d) 11

 a) (n*(n+1))/2 b) (n*(n-1))/2 c) N d) Information given is insufficient

a) ne  b) 2n c) 2e d) e^n

a) Stack.  b) Queue.  c) Linked List.  d) None of these.