Worst case is ________.
a) 2logn b) O(n2) c) n log n d) n
Data Structures
Best case is _____ same as merge sort.
a) 2logn b) O(n logn) c) n logn d) log n
The main idea is to find the _____ position for the pivot element P.
a) Left b) Right c) Above d) Below
If the input is random, then we can choose the key in position _______ as pivot.
a) A[left] b) A[right] c) Left d) Right
An optimal quick sort is ________ ?
a) 2 logn b) O logn c) (O(N log N)) d) 2n
A tree is also known as _______ sort.
a) Quick b) Shell c) Heap d) Selection
The advantages of insertion sorting are ________.
a) Simple implementation b) Adaptive c) All the above
The disadvantage of insertion sort is _________.
a) Inefficient to operate with a large list b) Inefficient to operate with a small list c) Both a and b d) None of these
________ is a good choice for sorting lists of a few thousand items or less.
a) Selection sort b) Insertion sort c) Quick sort d) None of these
________ sorting is much less efficient on large lists.
a) Insertion b) Selection c) Quick d) None of these
For an algorithm the complexity of the average case is
a) Much more complicated to analyze than that of worst case b) Much more simpler to analyze than that of worst case c) Sometimes more complicated and some other times simpler than that of worst case d) None of these
Which of these is the time complexity involved in building a heap of n elements and cannot be expressed in lower order terms?
a) O(n) b) O(n log n) c) O(n2) d) O(n3)
The main characteristics of a good algorithm are ________
a) Time b) Space c) Both a and b d) None of these
This Algorithm scans the lists by swapping the entries whenever pair of adjacent keys are out of desired order.
a) Insertion sort b) Quick sort c) Shell sort d) Bubble sort
The worst case time complexity of insertion sort is
a) O(n2) b) O(n) c) O(1) d) O(n log n)
A tree in which the value in every node is more than node-values in its left subtree and less than node-values in its right subtree.
a) Binaray sorted tree b) B- tree c) B + tree d) AVL tree