MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Stooge Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is not an adaptive sorting algorithm? |
| A. | insertion sort |
| B. | strand sort |
| C. | stooge sort |
| D. | bubble sort |
| Answer» D. bubble sort | |
| 2. |
Which of the following sorting algorithm is worst in terms of time complexity? |
| A. | bubble sort |
| B. | selection sort |
| C. | insertion sort |
| D. | stooge sort |
| Answer» E. | |
| 3. |
Which of the following sorting algorithm has the same time complexity in every case? |
| A. | stooge sort |
| B. | strand sort |
| C. | quick sort |
| D. | bubble sort |
| Answer» B. strand sort | |
| 4. |
How many recursive statements are used in the algorithm of stooge sort? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» E. | |
| 5. |
What is the average time complexity of stooge sort? |
| A. | O(n<sup>2</sup>) |
| B. | O(n<sup>3</sup>) |
| C. | O(n<sup>2.6</sup>) |
| D. | O(n<sup>2.7</sup>) |
| Answer» E. | |
| 6. |
Stooge sort is a stable sorting algorithm. |
| A. | true |
| B. | false |
| Answer» C. | |
| 7. |
Stooge sort is a comparison based sorting algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 8. |
What is the first step in the algorithm of stooge sort(after base case)? |
| A. | apply stooge sort on first 2/3 elements of array |
| B. | apply stooge sort on last 2/3 elements of array |
| C. | apply stooge sort on first 1/3 elements of array |
| D. | compare first and last element of the array |
| Answer» E. | |
| 9. |
What is the space complexity of stooge sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» B. O(1) | |
| 10. |
In which of the following case stooge sort is most efficient (in terms of time complexity)? |
| A. | when input array is already sorted |
| B. | when input array is reverse sorted |
| C. | when input array is large |
| D. | it has the same time complexity in any case |
| Answer» E. | |
| 11. |
What is the recurrence relation for stooge sort? |
| A. | T(n) = 2T(2/3n) + O(n) |
| B. | T(n) = 2T(2/3n) + O(1) |
| C. | T(n) = 3T(2/3n) + O(n) |
| D. | T(n) = 3T(2/3n) + O(1) |
| Answer» E. | |
| 12. |
Which one of the following sorting algorithm requires recursion? |
| A. | odd even sort |
| B. | stooge sort |
| C. | selection sort |
| D. | counting sort |
| Answer» C. selection sort | |