MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Heapsort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Introsort algorithm is combination of _____________ |
| A. | Quick sort and Heap sort |
| B. | Quick sort and Shell sort |
| C. | Heap sort and Merge sort |
| D. | Heap sort and insertion sort |
| Answer» B. Quick sort and Shell sort | |
| 2. |
Which one of the following is a variation of Heap sort? |
| A. | Comb sort |
| B. | Smooth sort |
| C. | Binary tree sort |
| D. | Shell sort |
| Answer» C. Binary tree sort | |
| 3. |
In average case Heap sort is as efficient as the Quick sort. |
| A. | True |
| B. | False |
| Answer» C. | |
| 4. |
What is its wort case time complexity of Heap sort? |
| A. | O(nlogn) |
| B. | O(n<sup>2</sup>logn) |
| C. | O(n<sup>2</sup>) |
| D. | O(n<sup>3</sup>) |
| Answer» B. O(n<sup>2</sup>logn) | |
| 5. |
The descending heap property is ___________ |
| A. | A[Parent(i)] = A[i] |
| B. | A[Parent(i)] <= A[i] |
| C. | A[Parent(i)] >= A[i] |
| D. | A[Parent(i)] > 2 * A[i] |
| Answer» D. A[Parent(i)] > 2 * A[i] | |
| 6. |
Heap sort is an implementation of ____________ using a descending priority queue. |
| A. | insertion sort |
| B. | selection sort |
| C. | bubble sort |
| D. | merge sort |
| Answer» C. bubble sort | |