MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version? |
| A. | 4 |
| B. | 2 |
| C. | 1 |
| D. | 0 |
| Answer» C. 1 | |
| 2. |
What is the best case efficiency of bubble sort in the improvised version? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n2) |
| Answer» D. O(n2) | |
| 3. |
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array? |
| A. | 4 |
| B. | 2 |
| C. | 1 |
| D. | 0 |
| Answer» B. 2 | |
| 4. |
Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements? |
| A. | It is faster |
| B. | Consumes less memory |
| C. | Detects whether the input is already sorted |
| D. | Consumes less time |
| Answer» D. Consumes less time | |
| 5. |
What is the average case complexity of bubble sort? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n2) |
| Answer» E. | |
| 6. |
WHAT_IS_THE_ADVANTAGE_OF_BUBBLE_SORT_OVER_OTHER_SORTING_TECHNIQUES??$ |
| A. | It is faster |
| B. | Consumes less memory |
| C. | Detects whether the input is already sorted |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 7. |
The_given_array_is_arr_=_{1,2,4,3}._Bubble_sort_is_used_to_sort_the_array_elements._How_many_iterations_will_be_done_to_sort_the_array?$ |
| A. | 4 |
| B. | 2 |
| C. | 1 |
| D. | 0 |
| Answer» C. 1 | |
| 8. |
What is the worst case complexity of bubble sort? |
| A. | O(nlogn) |
| B. | O(logn) |
| C. | O(n) |
| D. | O(n<sup>2</sup>) |
| Answer» E. | |
| 9. |
What is an internal sorting algorithm? |
| A. | Algorithm that uses tape or disk during the sort |
| B. | Algorithm that uses main memory during the sort |
| C. | Algorithm that involves swapping |
| D. | Algorithm that are considered ‘in place’ |
| Answer» C. Algorithm that involves swapping | |
| 10. |
What is an external sorting algorithm? |
| A. | Algorithm that uses tape or disk during the sort |
| B. | Algorithm that uses main memory during the sort |
| C. | Algorithm that involves swapping |
| D. | Algorithm that are considered ‘in place’ |
| Answer» B. Algorithm that uses main memory during the sort | |