Introduction to Graph Algorithms

By Prof. C. Pandu Rangan | IISc Bangalore

Learners enrolled: 1990 | Exam registration: 222

ABOUT THE COURSE:
A Computer is basically an information processing system and this means it can be used for solving only abstract mathematical problems. That is why, solving a Real World Problem (RWP) by using a computer, begins with a formulation of the RWP as a Mathematical problem in an appropriate mathematical domain. For example, privacy and security problems are formulated as cryptographic problems in Number Theory, Elliptic Curves and Linear Algebra.

Mathematical domains such as combinatorics, Geometry, Sets and Relations, Number Theory, Stringology and Graph Theory are among most frequently used domains to arrive at mathematical problems that are equivalent to the real-world problems.

In this course we focus on basic graph algorithms. Problems arising in communication networks, social networks and transportation networks are naturally modelled as problems on graphs. Graph algorithms are among the extensively investigated and applied topics in computer science.

INTENDED AUDIENCE: UG/PG Students

PREREQUISITES: Discrete Mathematics, Graph Theory, Basics of Programming and Data Structures

INDUSTRY SUPPORT: Infosys, TCS, MSR

Summary

Course Status :	Completed
Course Type :	Core
Language for course content :	English
Duration :	8 weeks
Category :	Computer Science and Engineering Foundations of Computing
Credit Points :	2
Level :	Undergraduate/Postgraduate
Start Date :	22 Jul 2024
End Date :	13 Sep 2024
Enrollment Ends :	05 Aug 2024
Exam Registration Ends :	16 Aug 2024
Exam Date :	22 Sep 2024 IST

Note: This exam date is subject to change based on seat availability. You can check final exam date on your hall ticket.

Page Visits

Course layout

Week 1: Principles of algorithms

Week 2: Introduction to directed and undirected graphs

Week 3: DAGs and incremental algorithms

Week 4: DFS, BFS of directed and undirected graph

Week 5: Application of DFS – cut vertices/bridges of a graph

Week 6: MST

Incremental greedy template
Krushkals algorithms and partition ADT
PRIMS algorithm and Fibonacci Heaps

Week 7: SSSP

Week 8: APSP

Books and references

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein; Introduction to Algorithms Third Edition, PHI, 2009

Instructor bio

Prof. C. Pandu Rangan

IISc Bangalore

Prof. C. Pandu Rangan obtained his doctorate degree from IISc, Bangalore in 1984. His main area of Research is Algorithms. I focus my research in the design of pragmatic algorithms. Problems of practical interest in Graph Theory, Combinatorics and Computational Geometry often turn out to be NP-complete or very hard to solve that we have to look for pragmatic alternatives for them. We explore the avenues such as 1) Restricting the problem domain 2) Approximate algorithm design 3) Randomized Algorithms and 4) Parallel and VLSI Algorithms to arrive at efficient solutions. Our design strategies are neither special purpose (very specific to a problem) nor general purpose (which are too inefficient) but broad purpose ones. Thus, our research efforts can be summarised in a single term - Application Oriented Paradigm Design (AOPD) (one more acronym to the world of Computer Science!). In Cryptology my current focus is on Secure message transmission and Provable security of cryptographic protocols / primitives.

Course certificate

The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 22 September 2024 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 6 assignments out of the total 8 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of NPTEL and IISc Bangalore .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team

SWAYAM Helpline / Support