MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is not true about QuickSort? |
| A. | in-place algorithm |
| B. | pivot position can be changed |
| C. | adaptive sorting algorithm |
| D. | can be implemented as a stable sort |
| Answer» C. adaptive sorting algorithm | |
| 2. |
The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent partitioning? |
| A. | 1 and 6 |
| B. | 6 and 1 |
| C. | 2 and 6 |
| D. | 1 |
| Answer» E. | |
| 3. |
What is the average case complexity of QuickSort? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n<sup>2</sup>) |
| Answer» B. O(logn) | |
| 4. |
QuickSort can be categorized into which of the following? |
| A. | Brute Force technique |
| B. | Divide and conquer |
| C. | Greedy algorithm |
| D. | Dynamic programming |
| Answer» C. Greedy algorithm | |