Linked Lists in Data Structures MCQ question and answer with solution

A. O(1)

B. O(n)

C. O(n log n)

D. O(n²)

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Using a singly linked list

B. Using a doubly linked list

C. Using a circular linked list

D. Using a self-referential linked list

A. They use less memory

B. They are easier to traverse

C. They require more memory

D. They allow for two-way traversal

A. Update the head pointer

B. Update the tail pointer

C. Copy the data from the next node to the current node and delete the next node

D. You cannot delete the node

A. When you need constant time access

B. When you need dynamic resizing

C. When you need better cache locality

D. When you need a fixed size

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Using a singly linked list

B. Using a doubly linked list

C. Using a circular linked list

D. Using any of the above

A. The list becomes empty

B. The previous node's next pointer is set to null

C. An error occurs

D. The head pointer is updated

A. It always points to the last node

B. It is null if the list is empty

C. It always points to the middle node

D. It always points to the second node