Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
 a) Bubble Sort b) Insertion Sort c) Selection Sort d) Quick SortÂ
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using
 a) 6 b) 7 c) 5 d) 8
If several elements competing for the same bucket in the hash table,what is it called?
a) Diffusion b) Replication c) Collision d) None of these
A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
a) insertion sort. b) selection sort. c) heap sort. d) quick sort.
A technique for direct search is
a) Binary Search b) Linear Search c) Tree Search d) HashingÂ
What sorting algorithms have their best and worst case times equal?
a) heap and selection sort b) insertion sort & merge sort c) merge sort and heap sort d) None of these
Hash tree is also known as _____
 a) Merkle tree b) T -tree c) Hash table d) Bx-tree
Which of the following algorithmic paradigm is used in the merge sort?
a) Dynamic Programming b) Backtracking c) Greedy method d) Divide and Conquer
Where is the hash tree used?
a) in digital currency b) in sorting of large data c) for indexing in databases d) in encryption of data
Which of the following is a widely used form of the hash tree?
a) B+ – tree b) T tree c) Tiger tree hash d) Htree
Hash tree is generalization of ______
 a) Heap b) Hash list c) BST d) B – tree
Heap can be used as ________________
 a) Priority queue b) Stack c) A decreasing order array d) None of the mentioned
In a max-heap, element with the greatest key is always in which node?
a) Leaf node b) First node of left sub tree c) root node d) First node of right sub tree
What is the maximum number of edges in a bipartite graph having 10 vertices?
a) 24 b) 21 c) 25 d) 16
Which of the following properties does a simple graph not hold?
a) Must be connected b) Must be unweighted c) Must have no loops or multiple edges d) All of the mentioned