MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Choose the correct statement about bottom up merge sort from the following? |
| A. | bottom up merge sort has greater time complexity than standard merge sort |
| B. | bottom up merge sort has lesser time complexity than standard merge sort |
| C. | bottom up merge sort saves auxiliary space required on call stack |
| D. | bottom up merge sort uses recursion. |
| Answer» D. bottom up merge sort uses recursion. | |
| 2. |
Bottom up merge sort is a stable sort. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
Bottom up merge sort uses recursion. |
| A. | true |
| B. | false |
| Answer» C. | |
| 4. |
Merge sort uses which of the following method to implement sorting? |
| A. | merging |
| B. | partitioning |
| C. | selection |
| D. | exchanging |
| Answer» B. partitioning | |
| 5. |
What is the average time complexity of bottom up 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>) | |
| 6. |
What is the auxiliary space complexity of bottom up merge sort? |
| A. | O(1) |
| B. | O(n) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» C. O(log n) | |
| 7. |
What is the auxiliary space complexity of standard merge sort? |
| A. | O(1) |
| B. | O(log n) |
| C. | O(n) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 8. |
What is the average case time complexity of standard 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. |
Merge sort uses which of the following algorithm to implement sorting? |
| A. | backtracking |
| B. | greedy algorithm |
| C. | divide and conquer |
| D. | dynamic programming |
| Answer» D. dynamic programming | |