10/9/24, 7:21 PM Assignment 3: Linked List

Assignment 3: Linked List

The respondent's email (123manasvi4056@sjcem.edu.in) was recorded on submission of
this form.

Batch *

Name of the Student *

Manasvi Kadu

Roll No. (e.g 02, 42) *

23

Assignment 3

Module 3 Linked List

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 1/6
10/9/24, 7:21 PM Assignment 3: Linked List

In a circular linked list, the last node points to: *

B) The first node

A) NULL

C) The previous node

D) Itself

What is the minimum number of pointers required to reverse a singly linked *

list?

B) 2

A) 1

D) 4

C) 3

Correct answer

C) 3

Which of the following is not a valid operation on a linked list? *

A) Insert at the beginning

C) Insert at the end

B) Delete from the middle

D) Access element at index i in O(1) time

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 2/6
10/9/24, 7:21 PM Assignment 3: Linked List

If the next pointer of a node in a singly linked list is NULL, then: *

A) The list is circular.

B) The node is the head.

C) The node is the last node in the list.

D) The list has only one node.

In which of the following scenarios is a circular linked list more useful than a *
singly linked list?

C) When you need continuous cycling through the list.

A) When you need to traverse in both directions.

B) When memory is limited.

D) When you need fast access to the middle element.

Which of the following operations takes O(n) time on a singly linked list with *
n elements?

B) Deleting a node at the head

D) Inserting a node after the given node

A) Inserting a node at the head

C) Searching for a specific node

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 3/6
10/9/24, 7:21 PM Assignment 3: Linked List

In a singly linked list, each node contains: *

B) Only data

A) Data and a reference to the previous node

D) Data, a reference to the previous node, and a reference to the next node

C) Data and a reference to the next node

Which of the following is true about a circular linked list? *

D) The list must always have an even number of nodes.

C) The last node points to the first node.

A) The last node has a NULL reference.

B) The first node has no predecessor.

How can you differentiate between a singly linked list and a circular linked *
list by traversing the list?

A) The circular list will throw an error when it reaches the end.

B) The circular list will return to the first node after reaching the last node.

C) Both have no difference when traversing.

D) The singly linked list contains more nodes.

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 4/6
10/9/24, 7:21 PM Assignment 3: Linked List

Which of the following is true about a doubly linked list? *

C) It has a reference only to the next node.

A) It can only be traversed in one direction.

D) It cannot delete nodes from the middle.

B) It allows traversal in both directions.

This form was created inside Aldel Education Trust's. Report Abuse

Forms

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 5/6
10/9/24, 7:21 PM Assignment 3: Linked List

https://docs.google.com/forms/d/e/1FAIpQLSeEvB6oVZXt3zlQAdzmaVxyKfdLDq6FSVT-9pAhyPh3AFVYHw/viewscore?vc=0&c=0&w=1&flr=0&vi… 6/6