Question

Which algorithm solves the shortest path problem in a weighted graph?

A Depth-first search
B Breadth-first search
C Dijkstra's algorithm
D Bellman-Ford algorithm
Practice Next

Relevant for Exams:

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)