Question

Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?

A Prim’s algorithm
B Kruskal’s algorithm
C Both A and B
D Dijkstra’s algorithm
E Bellman-Ford
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)