Programming, Data Structures and Algorithms using Python Quiz 1: 13 July 2025 (May 2025 term)

1. A

2. B

3. C

4. D

1. A

2. B

3. C

4. D

1. A

   It doubles

2. B

   It remains the same

3. C

   It becomes half

4. D

   It increases by 1

1. A

   When the input array is already sorted; the algorithm still performs redundant checks.

2. B

   When the input array is sorted in reverse (descending) order; each element needs to be compared against and shifted past all previously sorted elements.

3. C

   When the input array contains many duplicate elements; handling duplicates requires extra comparisons.

4. D

   When the input array elements are randomly distributed; the lack of order maximizes the average number of shifts required.

1. A

2. B

3. C

4. D

1. A

   Choosing a median value as the pivot for each recursive call.

2. B

   Choosing either the smallest or the largest element as the pivot at each recursive call.

3. C

   Choosing either the first or the last position element as the pivot at each recursive call.

4. D

   Partitioning the array into two roughly equal halves at each recursive call.

1. A

2. B

3. C

4. D

1. A

2. B

3. C

4. D

1. A

   3

2. B

   4

3. C

   6

4. D

   7

Select all that apply.

1. A

2. B

3. C

4. D

Select all that apply.

1. A

2. B

3. C

4. D

5. E

Select all that apply.

1. A

   (1,4)

2. B

   (2,4)

3. C

   (3,4)

4. D

   (3,5)

5. E

   (4,5)

6. F

   (1, 5)