_______ is a method of algorithm design.
a)Â Divide and conquer b) Recur c) Decrease and conquer d) Conque
First implementation of merge sort was on the ENIAC in the year _______.
a)Â 1942 b) 1949 c) 1945 d) 1944
Radix and bucket sorts are ______.
a) Partially stable b) Unstable c) Equal d) Stable
Radix-sort perform the bucket sorts by ______.
a) Least significant digits b) Most significant digits c) Least common digits d) Most common digits
Radix sort is ____ of bucket sort.
a) Weighted graph b) Generalization c) Serialization d) Normalization
______ works as long as the Bucket sort stages are stable sorts.
a) Sorting b) Radix sort c) Bucket sort d) Bubble sort
Radix and ______ do not work well when keys are very long.
 a) Non-linear sort b) List c) Bucket sort d) Set
Sorting algorithm can be characterized as ______.
 a) Simple algorithm which require the order of n2 comparisons to sort n items. b) Sophisticated algorithm that require the O(n log 2n) comparisons to sort items c) Both of the above d) None of the above
______ is a specialization of lexicographic-sort that uses bucket-sort as the stable sorting algorithm.
a)Â Heap sort b) Bubble sort c) Linear sort d) Radix-sort
If we were sorting entries according to keys, then each bucket is a _______.
a)Â Heap b) Stack c) Queue d) Buffer area
The complexity of bubble sort algorithm is ______.
a)Â O(n) b) O(n2) c) O(n log n) d) O(log n)
Two main measures for the efficiency of an algorithm are _____.
a)Â Processor and memory b) Complexity and capacity c) Time and space d) Data and space
Quick sort uses?
a) Divide and conquer b) Partition c) Marking d) None
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
The following sorting algorithm is of divide and conquer type
a) Bubble sort b) Insertion sort c) Quick sort d) None of the above