The in-order traversal of tree will yield a sorted listing of elements of tree in ________________.
a) binary trees b) binary search trees c) heaps d) binary heaps
Data Structures
The following sorting algorithm is of divide and conquer type
a) Bubble sort b) Insertion sort c) Quick sort d) None of the above
All the above Which of the following is not the required condition for binary search algorithm
a) There must be mechanism to delete and/or insert elements in list b) the list must be sorted c) there should be the direct access to the middle element in any sublist d) none of the aboveÂ
The Worst case occur in linear search algorithm when
a) Item is somewhere in the middle of the array b) Item is not in the array at all c) Item is the last element in the array d) Item is the last element in the array or is not there …
Read more →
The worst-case time for binary search to find out a single item in an array is in _________________ ?
a) Quadratic time b) Constant time c) Logarithmic time d) Linear time
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in
 a) pre-order. b) in-order. c) post order. d) not possible.
A characteristic of the data that binary search uses but the linear search ignores is the___________.
a) Order of the elements of the list. b) Length of the list. c) Maximum value in list. d) Type of elements of the list.
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