MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your MSD Radix Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What will be the order of elements of the array arr = {23, 67, 143, 654, 43} after first iteration of MSD sort is complete? |
| A. | 23, 43, 67, 143, 654 |
| B. | 23, 67, 43, 143, 654 |
| C. | 23, 67, 143, 654, 43 |
| D. | 23, 143, 43, 654, 67 |
| Answer» C. 23, 67, 143, 654, 43 | |
| 2. |
What is the advantage of radix sort over quick sort? |
| A. | radix sort performs better than quick sort when we have log n bits for every digit |
| B. | radix sort has lesser space complexity |
| C. | radix sort is not a comparison based sorting technique |
| D. | radix sort has better cache performance than quick sort |
| Answer» B. radix sort has lesser space complexity | |
| 3. |
Which of the following is not true about radix sort? |
| A. | Radix sort performs better than quick sort when we have log n bits for every digit |
| B. | Radix sort has better cache performance than quick sort |
| C. | Radix sort has higher values of constant factor in asymptotic notation |
| D. | Radix sort takes more space than quick sort |
| Answer» C. Radix sort has higher values of constant factor in asymptotic notation | |
| 4. |
Which of the following statement is not a stable sorting algorithm? |
| A. | LSD radix sort |
| B. | MSD radix sort |
| C. | Counting sort |
| D. | Pigeonhole sort |
| Answer» C. Counting sort | |
| 5. |
MSD radix sort is an in place sorting algorithm. |
| A. | True |
| B. | False |
| Answer» C. | |
| 6. |
What is the average time complexity of MSD radix sort (w= bits required to store each key)? |
| A. | O(n + w) |
| B. | O(n.w) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» C. O(n<sup>2</sup>) | |
| 7. |
MSD radix sort should be preferred over LSD radix sort when we have to maintain the original relative order. |
| A. | True |
| B. | False |
| Answer» C. | |
| 8. |
Which of the following is not true about MSD radix sort? |
| A. | its processing starts from the most significant digit |
| B. | it is not a stable sort |
| C. | it is an in place sorting algorithm |
| D. | it is non comparison based sort |
| Answer» D. it is non comparison based sort | |
| 9. |
Which of the following is an alternate name of MSD radix sort? |
| A. | bottom up radix sort |
| B. | top down radix sort |
| C. | forward radix sort |
| D. | backward radix sort |
| Answer» C. forward radix sort | |
| 10. |
Which of the following is the most suitable definition of radix sort? |
| A. | It is a non comparison based integer sort |
| B. | It is a comparison based integer sort |
| C. | It is a non comparison based non integer sort |
| D. | It is a comparison based non integer sort |
| Answer» B. It is a comparison based integer sort | |
| 11. |
Which of the following combines qualities of MSD radix sort and LSD radix sort? |
| A. | in-place MSD radix sort |
| B. | stable MSD radix sot |
| C. | 3 way radix quick sort |
| D. | forward radix sort |
| Answer» E. | |
| 12. |
What is the full form of MSD in MSD radix sort? |
| A. | most significant digit |
| B. | many significant digit |
| C. | more significant digit |
| D. | must significant digit |
| Answer» B. many significant digit | |
| 13. |
How many comparisons will be made to sort the array arr = {1, 5, 3, 8, 2} using MSD radix sort? |
| A. | 5 |
| B. | 7 |
| C. | 9 |
| D. | 0 |
| Answer» E. | |