Question

Match List-I with List-II.

List-I	List-II
A. Minimum Spanning Tree	I. Height balanced
B. Topological Sort	II. Stack
C. Recursion	III. Kruskal’s Algorithm
D. AVL Trees	IV. DFS

Choose the correct answer from the options given below:

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

Hint:

AVL = Height balanced, Recursion = Stack, MST = Kruskal/Prim, Topological = DFS.

Answer 1

The Correct Option is D

Concept: Match each concept with its associated property or algorithm.

Step 1: Match A (Minimum Spanning Tree).
• MST is constructed using algorithms like Kruskal’s or Prim’s \[ A \rightarrow III \]

Step 2: Match B (Topological Sort).
• Topological sorting uses DFS traversal \[ B \rightarrow IV \]

Step 3: Match C (Recursion).
• Recursion uses implicit stack \[ C \rightarrow II \]

Step 4: Match D (AVL Trees).
• AVL trees are height-balanced binary trees \[ D \rightarrow I \]

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