LSD Radix Sort Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
LSD radix sort is faster than comparison sorts.
Question 6 Explanation:
LSD radix sort is faster than comparison sorts when the word size is less than logn. But LSD radix sort runs slowly for elements with larger word size and smaller radix.
Which of the following should be used to sort a huge database on a fixed-length key field?
LSD radix sort
Question 7 Explanation:
LSD radix requires only w passes to sort a fixed-length string, where w is a length of the strings. So, LSD radix sort is best suited to sort a huge database on a fixed-length key field.
Which of the following is a combination of LSD and MSD radix sorts?
Forward radix sort
3-way radix quick sort
Trie base radix sort
Question 8 Explanation:
Forward radix sort combines the advantages of LSD and MSD radix sort. Forward radix sort inspects a complete horizontal strip at a time just like LSD radix sort.
Which of the following is true for the LSD radix sort?
works best for variable length strings
accesses memory randomly
inner loop has less instructions
sorts the keys in left-to-right order
Question 9 Explanation:
LSD radix sort sorts the keys in right-to-left order, working with Least Significant Digit first. The inner loop has a lot of instructions and LSD radix sort is used to sort fixed-length strings.
LSD radix sort is in-place sorting algorithm.
Question 10 Explanation:
LSD radix is not an in-place sorting algorithm. It needs extra memory to store the elements in bucket and its worst case space complexity is O(w + R).
There are 10 questions to complete.