W10 - Tutorial 1

Welcome to Week 10 Tutorial 1 of the course "Mathematics for Data Science I" by Profs. Neelesh Upadhye, Madhavan Mukund. Full Course: https://study.iitm.ac.in/ds/course_pages/BSMA1001.html Video Overview In this tutorial, we solve a graph theory problem inspired by a knockout cricket tournament. We show how tournament data can be represented using a directed graph, and then analyze properties like the outdegree of vertices, focusing on losing teams and the champion. The tutorial also demonstrates how to construct a Breadth-First Search (BFS) tree starting from the champion’s vertex, illustrating how graph traversal provides useful insights into real-world problems. By the end of this session, you’ll see how graph-theoretic tools like directed graphs, degrees, and BFS apply naturally to practical scenarios. About IIT Madras' online Bachelor of Science programme IIT Madras offers four-year BS programmes that aim to provide quality education to all, irrespective of age, educational background, or location. The BS programme has multiple levels, which provide flexibility to students to exit at any of these levels. Depending on the courses completed and credits earned, the learner can receive a Foundation Certificate from IITM CODE (Centre for Outreach and Digital Education), Diploma(s) from IIT Madras, or BSc/BS Degrees from IIT Madras. For more details, visit: https://www.iitm.ac.in/academics/study-at-iitm/non-campus-bs-programmes #GraphTheory #Tournament #Knockout #DirectedGraph #Outdegree #BFS #BreadthFirstSearch #Algorithms #DataStructures #Cricket #Champions #LosingTeams #Tutorial #ProblemSolving #ComputerScience #Mathematics