Problem: single-source shortest paths allowing negative edge weights — IITM BS previous year questions

Problem: single-source shortest paths allowing negative edge weights is part of Bellman-Ford Algorithm, Week 11 in Mathematics 1. Prasnya files every IIT Madras BS previous year question from this subtopic here, each one with a worked explanation. Take the whole set as a timed mock and you get accuracy, pacing and per-question analysis back.