BFS tree and shortest path in unweighted graphs — IITM BS previous year questions

BFS tree and shortest path in unweighted graphs is part of Breadth-First Search (BFS), Week 10 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.