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. Dynamic size

B. Random access

C. Ease of insertion and deletion

D. Memory overhead

A. A list where each node points to the next

B. A list where the last node points to the first node

C. A list where each node points to itself

D. A list where the nodes are in a circle

A. Each node has one pointer

B. Each node has two pointers

C. It is a type of tree

D. It can be traversed in one direction only

A. Using the length property

B. Using the size property

C. Iterating through the list

D. Using the count property

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. Data only

B. Data and a pointer to the next node

C. Data and two pointers

D. Only pointers

A. Better cache locality

B. Dynamic resizing

C. Constant time access

D. Reduced memory usage

A. Singly linked list

B. Doubly linked list

C. Circular linked list

D. Self-referential linked list

A. Segmentation fault

B. Null reference

C. Points to the head of the list

D. Accesses the first node