Courses » Design and Analysis of Algorithms

Design and Analysis of Algorithms

Exam datesMarch 22nd / 29th 2015; 1 PM to 4 PM
Exam Registration URL

Exam registration open till Feb 27th 2015 5 PM.

Certificate will have the test score, which is a combination of your assignment scores and exam score. Only those who have already enrolled in this course will be able to register for the exam.

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
NPTEL mirror for this course: http://nptel.ac.in/courses/106106131/

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.