Linked Lists in Data Structures MCQ question and answer with solution

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Singly linked list

B. Doubly linked list

C. Circular linked list

D. Indexed linked list

A. Swap the pointers in each node

B. Traverse the list and update next pointers only

C. Use a stack to reverse

D. Reverse the list in place

A. Implementing a queue

B. Implementing a stack

C. When you need a dynamic array

D. When you need an ordered list

A. To simplify boundary conditions

B. To increase the list size

C. To decrease memory usage

D. To make the list circular

A. Traverse the list and check order

B. Use a binary search

C. Use a hash table to store elements

D. Check the head pointer

A. A merged unsorted linked list

B. A sorted linked list

C. An error occurs

D. A circular linked list

A. Accessing an element by index

B. Deleting a node at the end

C. Inserting a node at the beginning

D. Traversing the list

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. Through a null pointer

B. Through the head pointer

C. Through the next pointer of the first node

D. Through the previous pointer of the first node