MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Cubesort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Cube sort is a comparison based sort. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
Which of the following is a disadvantage of cube sort? |
| A. | high memory overhead for small data |
| B. | high memory overhead for any data |
| C. | balancing is slow |
| D. | Iteration is slow |
| Answer» B. high memory overhead for any data | |
| 3. |
Cube sort is an in place sorting algorithm. |
| A. | true |
| B. | false |
| Answer» C. | |
| 4. |
Which of the following algorithm is stable? |
| A. | heap sort |
| B. | cube sort |
| C. | quick sort |
| D. | bogosort |
| Answer» E. | |
| 5. |
What is the average case time complexity of cube sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n log n) |
| C. | O(log n) |
| D. | O(n) |
| Answer» C. O(log n) | |
| 6. |
What is the best case time complexity of cube sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n) |
| C. | O(n log n) |
| D. | O(1) |
| Answer» C. O(n log n) | |
| 7. |
What is the auxiliary space requirement of cube sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» B. O(1) | |
| 8. |
What is the worst case time complexity of cube sort? |
| A. | O(n) |
| B. | O(log n) |
| C. | O(n log n) |
| D. | O(n2) |
| Answer» D. O(n2) | |
| 9. |
Which of the following is an example of parallel sorting technique? |
| A. | bogo sort |
| B. | sleep sort |
| C. | cube sort |
| D. | merge sort |
| Answer» D. merge sort | |