Minimum spanning tree (MST) - tree connecting all vertices with minimum total edge weight — IITM BS previous year questions

Minimum spanning tree (MST) - tree connecting all vertices with minimum total edge weight is part of Minimum Cost Spanning Trees - Prim's and Kruskal's Algorithms, 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.