$2.$ What operation is performed more efficiently by doubly linked list than by singly linked list?

$3.$ Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the last node of the linked list

$4.$ Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the last node of the linked list

$5.$ Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the end node of the linked list

$6.$ Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the end node of the linked list

$7.$ Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ Insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the end node of the linked list

$8.$ Consider an implementation of unsorted circular doubly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O$(1)$ time?

i$)$ Insertion at the front of the linked list

ii$)$ insertion at the end of the linked list

iii$)$ Deletion of the front node of the linked list

iv$)$ Deletion of the end node of the linked list

$9.$ A variant of the linked list in which the last node of the list points to the first node of the list is$?$

$10.$ In doubly linked lists, which direction or directions can traversal be performed?

$11.$ A variant of the linked list in which none of the nodes contains a NULL pointer is$?$

$12.$ In a circular linked list, the insertion of a node requires the modification of$?$

$13.$ Which of the following statements about linked list data structure is$/$are TRUE?

a$)$ Addition and deletion of an item to$/$ from the linked list require modification of the existing pointers

b$)$ The linked list pointers do not provide an efficient way to search an item in the linked list

c$)$ Linked list pointers always maintain the list in ascending order

d$)$ The linked list data structure provides an efficient way to find kth element in the list