MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Bucket Sort (Uniform Keys) Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the worst space complexity of bucket sort (k = number of buckets)? |
| A. | O(n + k) |
| B. | O(n.k) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» C. O(n<sup>2</sup>) | |
| 2. |
Bucket sort is an in place sorting algorithm. |
| A. | True |
| B. | False |
| Answer» C. | |
| 3. |
Which of the following is not necessarily a stable sorting algorithm? |
| A. | bucket sort |
| B. | counting sort |
| C. | merge sort |
| D. | pigeonhole sort |
| Answer» B. counting sort | |
| 4. |
What is the best time complexity of bucket sort (k= number of buckets)? |
| A. | O(n + k) |
| B. | O(n.k) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» B. O(n.k) | |
| 5. |
What is the worst case time complexity of bucket sort (k = number of buckets)? |
| A. | O(n + k) |
| B. | O(n.k) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 6. |
Bucket sort is a generalization of which of the following sort? |
| A. | LSD radix sort |
| B. | Pigeonhole sort |
| C. | Counting sort |
| D. | MSD radix sort |
| Answer» C. Counting sort | |
| 7. |
Bucket sort is most efficient in the case when __________ |
| A. | the input is non uniformly distributed |
| B. | the input is uniformly distributed |
| C. | the input is randomly distributed |
| D. | the input range is large |
| Answer» C. the input is randomly distributed | |
| 8. |
Which of the following don t affect the time complexity of bucket sort? |
| A. | algorithm implemented for sorting individual buckets |
| B. | number of buckets used |
| C. | distribution of input |
| D. | input values |
| Answer» E. | |
| 9. |
Which of the following is not true about bucket sort? |
| A. | It is a non comparison based integer sort |
| B. | It is a distribution sort |
| C. | It can also be considered as comparison based sort |
| D. | It is in place sorting algorithm |
| Answer» E. | |
| 10. |
Which of the following non-comparison sort can also be considered as a comparison based sort? |
| A. | counting sort |
| B. | MSD radix sot |
| C. | bucket sort |
| D. | pigeonhole sort |
| Answer» D. pigeonhole sort | |
| 11. |
What is the alternate name of bucket sort? |
| A. | group sort |
| B. | radix sort |
| C. | bin sort |
| D. | uniform sort |
| Answer» D. uniform sort | |
| 12. |
How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using bucket sort? |
| A. | 5 |
| B. | 7 |
| C. | 9 |
| D. | 0 |
| Answer» E. | |