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: Algorithms and Data Structures Explained.
- Breadth-First Search (BFS): Explores a graph level by level, utilizing a Queue (A - IV).
- Depth-First Search (DFS): Explores a graph by traversing deeply along a path before backtracking, employing a Stack (B - I).
- Heap Sort: Sorts by efficiently extracting the maximum or minimum element using a Priority Queue (C - III).
- Secondary Storage Organization: Efficiently searches and indexes data on devices like hard disks or SSDs using B Trees (D - II).

Step 2: Final Matching.
The accurate correspondence is (A) - (IV), (B) - (II), (C) - (III), (D) - (I).