MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Bead Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Bead sort is only applicable to positive integers. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
What is the worst case time complexity of bead sort (S= sum of input elements)? |
| A. | O(n) |
| B. | O(S) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» C. O(n<sup>2</sup>) | |
| 3. |
What is the best case time complexity of bead sort (S = sum of input elements)? |
| A. | O(n) |
| B. | O(S) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» B. O(S) | |
| 4. |
What is the average time complexity of bead sort (S = sum of input elements)? |
| A. | O(n) |
| B. | O(S) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» C. O(n<sup>2</sup>) | |
| 5. |
How many comparisons will be required to sort the array arr={5, 4, 7, 1, 9} using bead sort? |
| A. | 5 |
| B. | 4 |
| C. | 6 |
| D. | 0 |
| Answer» E. | |
| 6. |
Bead sort is a comparison based sorting algorithm. |
| A. | true |
| B. | false |
| Answer» C. | |
| 7. |
What is the auxiliary space complexity of bead sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(n<sup>2</sup>) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 8. |
Which of the following sorting algorithm is only applicable to positive integers? |
| A. | quick sort |
| B. | heap sort |
| C. | bead sort |
| D. | strand sort |
| Answer» D. strand sort | |
| 9. |
Which of the following sorting algorithm was inspired by the natural phenomenon of falling objects? |
| A. | bogo sort |
| B. | heap sort |
| C. | bead sort |
| D. | strand sort |
| Answer» D. strand sort | |
| 10. |
Bead sort is also known as _________ |
| A. | gravity sort |
| B. | strand sort |
| C. | abacus sort |
| D. | counting sort |
| Answer» B. strand sort | |