Bellman-Ford Algorithm — IITM BS previous year questions

Bellman-Ford Algorithm is part of Week 11 in Mathematics 1. Prasnya files every IIT Madras BS previous year question from this topic here, split across 2 subtopics, each one with a worked explanation. Take the whole set as a timed mock and you get accuracy, pacing and per-question analysis back.

Subtopics in this topic

Problem: single-source shortest paths allowing negative edge weights
Negative-weight cycle detection - if any edge can still be relaxed after V-1 rounds

Practise Week 11 free

Trial or subscription required

Unlock topic-wise questions

Topic-wise practice is available during your 1-day trial or with the Plus plan.

Plus plan

Rs 129/month

Go keeps subject and week wise practice active after the trial.

View plans Back to practice

End Term › Mathematics 1 › Week 11