Programming, Data Structures and Algorithms using Python · Quiz 1 · 15 Mar 2026 · January 2026 term

Question 9: Consider a singly linked list implemented using the above…

Question 9

+3 marksOne or more correct options

Consider a singly linked list implemented using the above class. Assume that: • variable points to the first node of the linked list, • variable points to the last node of the linked list, • the linked list contains nodes where , Which of the following operations cannot be guaranteed to run in constant time?

Select all that apply.

1. A

   Inserting a new node at the front of the linked list.

2. B

   Inserting a new node at the end of the linked list.

3. C

   Deleting the first node of the linked list.

4. D

   Deleting the last node of the linked list.

5. E

   Accessing the second last node of the linked list.

Show answerTap to reveal

Correct answers

• D

  Deleting the last node of the linked list.

• E

  Accessing the second last node of the linked list.

Question 9 of 17 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 15 Mar 2026, in the January 2026 term (Programming, Data Structures And Algorithms Using Python 15 Mar 26). It carries 3 marks.