Adjacency list - O(V + E) space; efficient for sparse graphs — IITM BS previous year questions

Adjacency list - O(V + E) space; efficient for sparse graphs is part of Graph Representation, 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.