MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Merge Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following sorting algorithm does not use recursion? |
| A. | quick sort |
| B. | merge sort |
| C. | heap sort |
| D. | bottom up merge sort |
| Answer» E. | |
| 2. |
Which of the following sorting algorithm makes use of merge sort? |
| A. | tim sort |
| B. | intro sort |
| C. | bogo sort |
| D. | quick sort |
| Answer» B. intro sort | |
| 3. |
Merge sort is preferred for arrays over linked lists. |
| A. | true |
| B. | false |
| Answer» C. | |
| 4. |
Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array? |
| A. | Quick sort |
| B. | Insertion sort |
| C. | Selection sort |
| D. | Merge sort |
| Answer» E. | |
| 5. |
Which of the following is not a stable sorting algorithm? |
| A. | Quick sort |
| B. | Cocktail sort |
| C. | Bubble sort |
| D. | Merge sort |
| Answer» B. Cocktail sort | |
| 6. |
Which of the following is not in place sorting algorithm by default? |
| A. | merge sort |
| B. | quick sort |
| C. | heap sort |
| D. | insertion sort |
| Answer» B. quick sort | |
| 7. |
Which of the following is not a variant of merge sort? |
| A. | in-place merge sort |
| B. | bottom up merge sort |
| C. | top down merge sort |
| D. | linear merge sort |
| Answer» E. | |
| 8. |
What will be the best case time complexity of merge sort? |
| A. | O(n log n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>2</sup> log n) |
| D. | O(n log n<sup>2</sup>) |
| Answer» B. O(n<sup>2</sup>) | |
| 9. |
Which of the following method is used for sorting in merge sort? |
| A. | merging |
| B. | partitioning |
| C. | selection |
| D. | exchanging |
| Answer» B. partitioning | |
| 10. |
What is the worst case time complexity of merge sort? |
| A. | O(n log n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>2</sup> log n) |
| D. | O(n log n<sup>2</sup>) |
| Answer» B. O(n<sup>2</sup>) | |
| 11. |
Merge sort can be implemented using O(1) auxiliary space. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 12. |
What is the auxiliary space complexity of merge sort? |
| A. | O(1) |
| B. | O(log n) |
| C. | O(n) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 13. |
What is the average case time complexity of merge sort? |
| A. | O(n log n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>2</sup> log n) |
| D. | O(n log n<sup>2</sup>) |
| Answer» B. O(n<sup>2</sup>) | |
| 14. |
Merge sort uses which of the following technique to implement sorting? |
| A. | backtracking |
| B. | greedy algorithm |
| C. | divide and conquer |
| D. | dynamic programming |
| Answer» D. dynamic programming | |