Question

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{BFS} & (IV)\ \text{Queue} \\ \hline (B)\ \text{DFS} & (I)\ \text{Stack} \\ \hline (C)\ \text{Heap Sort} & (III)\ \text{Priority Queue} \\ \hline (D)\ \text{Storage on secondary storage devices} & (II)\ \text{B Trees} \\ \hline \end{array}\] Choose the correct answer from the options given below:

• (A) - (IV), (B) - (II), (C) - (III), (D) - (I)
• (A) - (III), (B) - (I), (C) - (IV), (D) - (II)
• (A) - (I), (B) - (III), (C) - (IV), (D) - (II)
• (A) - (III), (B) - (IV), (C) - (II), (D) - (I)

Hint:

BFS uses a queue for level-wise traversal, DFS uses a stack for depth-wise traversal, Heap Sort uses a priority queue, and secondary storage often uses B trees.

Answer 1

The Correct Option is A

Step 1: Explanation of algorithms and data structures.
- **BFS (Breadth-First Search)**: BFS uses a **Queue** data structure to explore the graph level by level (A - IV).
- **DFS (Depth-First Search)**: DFS uses a **Stack** to explore the graph deeply by visiting nodes along a path before backtracking (B - I).
- **Heap Sort**: Heap Sort uses a **Priority Queue** to efficiently retrieve the maximum or minimum element (C - III).
- **Storage on Secondary Storage Devices**: Secondary storage devices like hard disks or SSDs often use **B Trees** for efficient searching and indexing (D - II).

Step 2: Conclusion.
The correct matching is **(A) - (IV), (B) - (II), (C) - (III), (D) - (I)**.