Programming, Data Structures and Algorithms using Python Quiz 1: 23 February 2025 (January 2025 term)

1. A

2. B

3. C

4. D

1. A

2. B

3. C

4. D

1. A

2. B

3. C

4. D

1. A

   The number of comparisons is the minimum when the input list is in ascending order.

2. B

   The number of comparisons is the maximum when the input list is in descending order.

3. C

   The number of comparisons is the same irrespective of the order of the elements in the input list.

4. D

   The number of comparisons depends on the number of swaps made during the process.

1. A

   The number of shifts is always equal to the number of comparisons.

2. B

   The number of shifts is minimum when the input list is in ascending order.

3. C

   The number of shifts is minimum when the input list is in descending order.

4. D

   The number of shifts is independent of the order of the elements in the input list.

1. A

2. B

3. C

4. D

1. A

2. B

3. C

4. D

1. A

   Statement 1 and Statement 3 are true

2. B

   Statement 2 and Statement 3 are true

3. C

   Statement 1 and Statement 2 are true

4. D

   All statements are true

1. A

2. B

3. C

4. D

1. A

   E A

2. B

   C B

3. C

   C A

4. D

   E B

Select all that apply.

1. A

   Insertion of the new node at the front of the linked list.

2. B

   Insertion of the new node at the end of the linked list.

3. C

   Deletion of the first node of the linked list.

4. D

   Deletion of the last node of the linked list.

5. E

   Search for any element in the linked list

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