Bubble Sort

1. Which of the following statements is true for Bubble Sort in ascending order?

a: After T iterations, at least T of the smallest elements will be in their correct positions. Explanation

Explanation

b: After T iterations, at least T random elements will be in their correct positions. Explanation

Explanation

c: After T iterations, a random number of elements will be in their correct positions. Explanation

Explanation

d: After T iterations, at least T of the largest elements will be in their correct positions. Explanation

Explanation

2. To sort an array in descending order using Bubble Sort, when should two adjacent elements be swapped?

a: When the ith element is less than the (i + 1)th element. Explanation

Explanation

b: When the ith element is equal to the (i + 1)th element. Explanation

Explanation

c: When the ith element is greater than the (i + 1)th element. Explanation

Explanation

d: None of the above. Explanation

Explanation

3. Consider the following array:
A = [9, -1, -10, 9*, 2]
Here, '*' distinguishes the two 9s so that their relative order can be tracked while sorting. Which of the following represents the sequence of arrays after successive complete passes of Bubble Sort in ascending order?

a: [9, -1, -10, 9*, 2] → [-1, -10, 9, 2, 9*] → [-10, -1, 2, 9, 9*] → [-10, -1, 2, 9, 9*] → [-10, -1, 2, 9, 9*] Explanation

Explanation

b: [9, -1, -10, 9*, 2] → [-1, -10, 9*, 2, 9] → [-10, -1, 2, 9, 9*] → [-10, -1, 2, 9*, 9] → [-10, -1, 2, 9, 9*] Explanation

Explanation

c: [9, -1, -10, 9*, 2] → [-1, -10, 2, 9, 9*] → [-10, -1, 2, 9, 9*] → [-10, -1, 2, 9, 9*] → [-10, -1, 2, 9, 9*] Explanation

Explanation

d: [9, -1, -10, 9*, 2] → [9, -1, -10, 2, 9*] → [-1, -10, 9, 2, 9*] → [-1, -10, 2, 9, 9*] → [-10, -1, 2, 9, 9*] Explanation

Explanation

4. What is the primary purpose of comparing adjacent elements in Bubble Sort?

a: To remove duplicate elements. Explanation

Explanation

b: To identify whether the entire array is homogeneous. Explanation

Explanation

c: To determine whether the adjacent elements need to be swapped to move them toward the required order. Explanation

Explanation

d: To calculate the average of the adjacent elements. Explanation

Explanation

5. What is the result of the first complete ascending Bubble Sort pass on A = [4, 1, 3, 2]?

a: [1, 3, 2, 4] Explanation

Explanation

b: [1, 2, 3, 4] Explanation

Explanation

c: [4, 1, 2, 3] Explanation

Explanation

d: [3, 1, 2, 4] Explanation

Explanation

6. If no swaps occur during a complete pass of Bubble Sort, what does this indicate?

a: The array contains no elements. Explanation

Explanation

b: The array is already sorted in the required order. Explanation

Explanation

c: The largest element has been deleted. Explanation

Explanation

d: Every element has been swapped. Explanation

Explanation

7. Which statement correctly describes the role of the outer loop in Bubble Sort?

a: It repeatedly performs passes over the unsorted portion of the array. Explanation

Explanation

b: It stores the array elements in a separate array. Explanation

Explanation

c: It searches for a specific value using binary search. Explanation

Explanation

d: It removes the largest element after each comparison. Explanation

Explanation

8. In ascending Bubble Sort, after the first complete pass, which element is guaranteed to be in its final position?

a: The smallest element Explanation

Explanation

b: The second-smallest element Explanation

Explanation

c: The largest element Explanation

Explanation

d: The middle element Explanation

Explanation

9. Which statement about Bubble Sort is correct?

a: It always uses O(N) extra memory. Explanation

Explanation

b: It can be implemented in place using a constant amount of auxiliary space. Explanation

Explanation

c: It requires a sorted input array before it can run. Explanation

Explanation

d: It can sort an array only when all elements are distinct. Explanation

Explanation