Data Structures MCQs

Singly Linked List is a sequence of nodes where each node points to the next node.
This description distinguishes it from the other choices.

Singly Linked List is commonly used for frequent insertions at the head.
Its design supports this task efficiently or naturally.

The defining property is that forward traversal is supported but direct backward traversal is not.
The other statements describe different structures or concepts.

Singly Linked List fits because it supports frequent insertions at the head and forward traversal is supported but direct backward traversal is not.
Both clues point to this choice.

Doubly Linked List is a sequence of nodes with links to both the next and previous nodes.
This description distinguishes it from the other choices.

Doubly Linked List is commonly used for efficient insertion or deletion when a node reference is available.
Its design supports this task efficiently or naturally.

Array is a contiguous collection of elements accessed by index.
This description distinguishes it from the other choices.

Array is commonly used for fast random access when the index is known.
Its design supports this task efficiently or naturally.

The defining property is that elements are typically stored in adjacent memory locations.
The other statements describe different structures or concepts.

Array fits because it supports fast random access when the index is known and elements are typically stored in adjacent memory locations.
Both clues point to this choice.

Dynamic Array is a resizable array that grows when its capacity is exceeded.
This description distinguishes it from the other choices.

Dynamic Array is commonly used for maintaining an indexed sequence whose size changes.
Its design supports this task efficiently or naturally.