NOC | Design and Analysis of Algorithms

Course abstract

This course will cover basic concepts in the design and analysis of algorithms.

Asymptotic complexity, O() notation
Sorting and search
Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
Design techniques: divide and conquer, greedy, dynamic programming
Data structures: heaps, union of disjoint sets, search trees
Intractability

Course Instructor

Prof. Madhavan Mukund

Prof. Madhavan Mukund studied at IIT Bombay (BTech) and Aarhus University (PhD). He has been a faculty member at Chennai Mathematical Institute since 1992, where he is presently Professor and Dean of Studies. His main research area is formal verification. He has active research collaborations within and outside India and serves on international conference programme committees and editorial boards of journals.

He is President of the Indian Association for Research in Computing Science (IARCS) and Vice-President of the ACM India Council. He has been the National Coordinator of the Indian Computing Olympiad since 2002. He served as the Executive Director of the International Olympiad in Informatics from 2011-2014.

In addition to the NPTEL MOOC programme, he has been involved in organizing IARCS Instructional Courses for college teachers. He is a member of ACM India's Education Council. He has contributed lectures on algorithms to the Massively Empowered Classroom (MEC) project of Microsoft Research and the QEEE programme of MHRD.
More info

Course Sponsors

Teaching Assistant(s)

Mirza Ahad Baig

B.Sc. IInd Yr. Maths and Computer Science
Chennai Mathematical Institute

R. Goutham

B.Sc. 3rd year Mathematics,
Chennai Mathematical Institute

Course Duration : Jan-Mar 2016

View Course

Enrollment : 15-Dec-2015 to 04-Feb-2016

Exam Date : 20-Mar-2016

Enrolled

10673

Registered

871

Certificate Eligible

796

Certified Category Count

Gold

Silver

Elite

213

Successfully completed

161

Participation

413

Success

Elite

Gold

Legend

>=90 - Elite+Gold
60-89 - Elite
35-59 - Successfully Completed
<=34 - Certificate of Participation

Final Score Calculation Logic

Assignment Score = 25% of best 4 out of 8 quizzes + 25% of best 3 out of 5 Programming assignments
Score on dispplay: Assignment 1 indicates quizzes and assignment 2 indicates Programming assignments
FINAL SCORE (Score on Certificate) = 50% of Exam Score + 50% of Assignment Score

Design and Analysis of Algorithms - Toppers list