sorting mcq, mcq on sorting,2nd puc computer science sorting mcq with answers,class 12 computer science sorting mcq with answers,mcq on sorting data structure,mcq on sorting algorithms,mcq on sorting algorithms in data structure,mcq on sorting techniques,mcq on sorting algorithms with answers,mcq on sorting algorithms python,mcq on sorting algorithms python with answers,insertion sort mcq,bubble sort mcq,mcq on sorting algorithms pdf,mcq on sorting algorithms python pdf,2nd puc computer science sorting mcq with answers pdf,2nd puc computer science sorting mcq pdf,2nd puc computer science sorting mcq pdf download,class 12 computer science sorting mcq pdf
1. Which of the following sorting techniques is based on repeatedly comparing adjacent elements and swapping them if they are in the wrong order?
2. What is the time complexity of Bubble Sort in the worst-case scenario?
3. Which of the following best describes the logic of the Bubble Sort algorithm?
4. How many passes are required to sort a list of 6 elements using Bubble Sort?
5. Which sorting technique finds the smallest element in the list and places it in its correct position?
6. In Selection Sort, after the first pass, the first element of the list is:
7. What is the time complexity of Selection Sort in the best case?
8. Which sorting technique is best described as “a sorted list is built one element at a time”?
9. In Insertion Sort, which of the following is TRUE about the sorted portion of the list?
10. What is the best-case time complexity of Insertion Sort?
11. Which sorting algorithm is generally better for nearly sorted data?
12. In Bubble Sort, which element reaches its correct position after the first pass?
13. Which sorting algorithm swaps elements only when necessary and avoids unnecessary movements?
14. Which of the following algorithms uses a temporary variable during swapping?
15. Which sort algorithm is not** efficient for large datasets?**
16. In the Insertion Sort algorithm, when is shifting required?
17. The number of comparisons in the worst case for Bubble Sort is:
18. Which sorting algorithm is described using the following pseudocode? for i = 0 to n-2: for j = 0 to n-2-i: if arr[j] > arr[j+1]: swap arr[j] and arr[j+1]
19. Which sorting method has the same time complexity in best, average, and worst cases?
20. In Selection Sort, if the minimum element is already at its correct position, what happens?
21. Assertion (A): Bubble Sort repeatedly swaps adjacent elements if they are in the wrong order. Reason (R): Bubble Sort pushes the smallest element to the end in each pass.
22. Assertion (A): In Selection Sort, the smallest element is selected in each pass and placed in its correct position. Reason (R): Selection Sort uses repeated shifting of elements to sort the list.
23. Assertion (A): Insertion Sort is efficient for nearly sorted lists. Reason (R): In the best case, the time complexity of Insertion Sort is O(n).
24. Assertion (A): Selection Sort is a stable sorting algorithm. Reason (R): Selection Sort preserves the order of identical elements.
25. Assertion (A): Insertion Sort builds the final sorted list one item at a time. Reason (R): It inserts each new element at the beginning of the list.
26. Assertion (A): Bubble Sort can be optimized to stop early if no swaps are made during a pass. Reason (R): This optimization improves its best-case time complexity to O(n).
27. Assertion (A): In Bubble Sort, every pair of adjacent elements is compared in each pass. Reason (R): The number of comparisons increases with each pass.
28. Assertion (A): In Selection Sort, the number of comparisons is always the same regardless of the input order. Reason (R): Selection Sort has a time complexity of O(n²) for all cases.
29. Assertion (A): In Insertion Sort, shifting elements is necessary to maintain the sorted portion of the list. Reason (R): Elements are shifted right to make space for the current element.
30. Assertion (A): All three sorting techniques (Bubble, Selection, Insertion) have a worst-case time complexity of O(n²). Reason (R): They all use nested loops with two iterations each.
Reviewed by Vision Academy
on
July 13, 2025
Rating:
No comments: