Visited set - preventing revisiting nodes in a cycle-bearing graph — IITM BS previous year questions

Visited set - preventing revisiting nodes in a cycle-bearing graph is part of Depth First Search (DFS), Week 9 in Computational Thinking. 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.