Linked Lists in Data Structures MCQ question and answer with solution

A. Update the head pointer

B. Update the tail pointer

C. Traverse to the last node and update its next pointer

D. Directly insert at the last index

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Insertion at the beginning

B. Accessing an element by index

C. Finding the maximum element

D. Sorting

A. Update the previous node's next pointer and the next node's previous pointer

B. Update the head pointer

C. Update the tail pointer

D. Directly remove the node

A. A node that marks the beginning of the list

B. A node that marks the end of the list

C. A special node that simplifies edge cases

D. A node that points to itself

A. O(1)

B. O(n)

C. O(log n)

D. O(n²)

A. Implementing stacks

B. Implementing queues

C. Both A and B

D. None of the above

A. Using a stack

B. Using two pointers (Floyd's Cycle-Finding Algorithm)

C. Using recursion

D. Using a hash table

A. A circular linked list

B. A doubly linked list

C. A linked list with nodes in reverse order

D. An error

A. Its next pointer is null

B. Its previous pointer is null

C. It points to the first node

D. It has no pointers