Top MCQs on RadixSort Algorithm with Answers

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in:

If there are n integers to sort, each integer has d digits and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in :

The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):

Given an array where numbers are in range from 1 to n⁶, which sorting algorithm can be used to sort these number in linear time?

If we use Radix Sort to sort n integers in the range (n^k/2,n^k], for some k>0 which is independent of n, the time taken would be?