Prim's algorithm - grow MST greedily from a start vertex using a priority queue; O(E log V) — IITM BS previous year questions

Prim's algorithm - grow MST greedily from a start vertex using a priority queue; O(E log V) 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.