Question

Match List-I with List-II.

List-I	List-II
A. Breadth First Search	I. Shortest paths
B. Sparse Graph	II. Adjacency list representation
C. Collision Resolution	III. Open addressing
D. Linked list	IV. Self referential structures

Choose the correct answer from the options given below:

• A. A-I, B-II, C-III, D-IV
• B. A-I, B-III, C-IV, D-II
• C. A-II, B-I, C-III, D-IV
• D. A-IV, B-II, C-I, D-III

Hint:

BFS → shortest path, Sparse → adjacency list, Hashing → open addressing, Linked list → self-referential.

Answer 1

The Correct Option is A

Concept: Each structure or algorithm has a characteristic application or property.

Step 1: Match A (Breadth First Search).
• BFS is used to find shortest path in unweighted graphs \[ A \rightarrow I \]

Step 2: Match B (Sparse Graph).
• Sparse graph has fewer edges
• Efficient representation → adjacency list \[ B \rightarrow II \]

Step 3: Match C (Collision Resolution).
• Used in hashing
• Open addressing is a technique to resolve collisions \[ C \rightarrow III \]

Step 4: Match D (Linked List).
• Nodes contain reference to next node
• Hence self-referential structure \[ D \rightarrow IV \]

Step 5: Final mapping. \[ A-I,\ B-II,\ C-III,\ D-IV \] \[ \boxed{(1)} \]