Question 1
Which of the following is the distribution sort?
 A Heap sort B Smooth sort C Quick sort D LSD radix sort
Question 1 Explanation:
In Distribution sort the inputted values are distributed to multiple intermediate structures which are then combined and placed on the output. And LSD radix sort distributes values into buckets based on the digits within values, so it is a distribution sort.

 Question 2
What is the worst case time complexity of LSD radix sort?
 A O(nlogn) B O(wn) C O(n) D O(n + w)
Question 2 Explanation:
Time complexity of LSD radix sort depends upon the word size and the number on items. It runs in O(wn) time in worst case, where n is the number of inputted elements and w is the number of digits in the largest number.

 Question 3
LSD radix sort requires ..... passes to sort N elements.
 A (w/logR) B N(w/logR) C (w/log(RN)) D (wN/log(N))
Question 3 Explanation:
LSD radix sort sorts the N elements in (w/logR) passes where w is the number of digits in largest number and R(radix) is extra space required for performing the sorting operation.

 Question 4
Which of the following is false?
 A LSD radix sort is an integer sorting algorithm B LSD radix sort is a comparison sorting algorithm C LSD radix sort is a distribution sort D LSD radix sort uses bucket sort