engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
The appropriate matching for the following pairs
X: Depth First Search 1: heap
Y: Breadth-First Search 2. queue
Z: sorting 3. stack
1
X - 1, Y - 2, Z - 3
2
X - 3, Y - 1, Z - 2
3
X - 3, Y - 2, Z - 1
4
X - 2, Y - 3, Z - 1