Virtual Labs

1. Which of the following statements is true (assume ascending sort order)?

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

Explanation

b: After T iterations, atleast 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, atleast T of the largest elements will be in their correct positions. Explanation

Explanation

2. To sort an array in descending order, when will we swap two adjacent elements under consideration?

a: When the ith element is lesser 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]
Note that the ‘*’ is used to mark a distinction between the two 9’s in order to keep track of their order while sorting. Which of the following represents the steps in sorting the above array (assume 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, 9*, 2, -10] → [9, 9*, 2, -1, -10] → [9, 9*, 2, -1, -10] → [9, 9*, 2, -1, -10] Explanation

Explanation

Bubble Sort