Home »
MCQs »
Algorithms MCQs
Which of the following is NOT an application of Breadth-First Search (BFS)?
20. Which of the following is NOT an application of Breadth-First Search (BFS)?
- Shortest path finding in an unweighted graph
- Topological sorting in a directed acyclic graph
- Level order traversal of a binary tree
- Finding the minimum spanning tree
Answer
The correct answer is: D) Finding the minimum spanning tree
Explanation
BFS is not used to find the minimum spanning tree. Algorithms like Kruskal's and Prim's are used for finding the minimum spanning tree.