How many queues would it take to use radix sort to sort names stored as all lowercase?

27 Queues.

Explanation:

Radix sort is an unique sorting algorithm which does not uses comparison. It does so by creating and distributing the elements into a container according to their radix.

In above mentioned question we'll be needing 26 queue for the letters and one queue to store the whole list during, after and before sorting.