Question

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

A Dynamic Programming
B Backtracking
C Greedy
D None of these
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)