Question

Which famous algorithm follows a greedy approach for solving the minimum spanning tree problem in a graph?

A Kruskal's algorithm
B Dijkstra's algorithm
C Bellman-Ford algorithm
D Depth-First Search (DFS)
E None of the mentioned
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)