MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Library Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is not true about library sort? |
| A. | it uses binary search and insertion sort in its implementation |
| B. | gaps are created between successive elements in order to ensure faster insertion |
| C. | array needs to be re balanced after every insertion |
| D. | it is an in place sorting algorithm |
| Answer» E. | |
| 2. |
What is the auxiliary space complexity of library sort? |
| A. | O(n) |
| B. | O(1) |
| C. | O(n log n) |
| D. | O(n<sup>2</sup>) |
| Answer» B. O(1) | |
| 3. |
What is the advantage of library sort over insertion sort? |
| A. | Library sort has a better average time complexity |
| B. | Library sort has a better space complexity |
| C. | Library sort has better best case time complexity |
| D. | Library has better worst case time complexity |
| Answer» B. Library sort has a better space complexity | |
| 4. |
Which of the following is an alternate name of library sort? |
| A. | gapped insertion sort |
| B. | binary insertion sort |
| C. | recursive insertion sort |
| D. | binary gap sort |
| Answer» B. binary insertion sort | |
| 5. |
What is the worst case time complexity of library sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» D. O(log n) | |
| 6. |
What is the best case time complexity of library sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» B. O(n log n) | |
| 7. |
What is the average case time complexity of library sort? |
| A. | O(n) |
| B. | O(n log n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» C. O(n<sup>2</sup>) | |
| 8. |
Library sort is a comparison based sort. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 9. |
Which of the following sorting algorithm requires the use of binary search in their implementation? |
| A. | radix sort |
| B. | library sort |
| C. | odd-even sort |
| D. | bead sort |
| Answer» C. odd-even sort | |
| 10. |
Library sort is a modified version of which of the following sorting algorithm? |
| A. | Bubble sort |
| B. | selection sort |
| C. | insertion sort |
| D. | quick sort |
| Answer» D. quick sort | |
| 11. |
Library sort is an online sorting algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 12. |
Which of the following is a disadvantage of library sort when compared to insertion sort? |
| A. | library sort has greater time complexity |
| B. | library sort has greater space complexity |
| C. | library sort makes more comparisons |
| D. | it has no significant disadvantage |
| Answer» C. library sort makes more comparisons | |