Course Name: 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

Media Object

Prof. Madhavan Mukund

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 both the Indian Association for Research in Computing Science (IARCS) and 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.


Teaching Assistant(s)

Ritankar Nath

B.Sc, Mathematics and Computer Science

Aalok Thakkar

B.Sc. (Honours), Mathematics and Computer Science

Karthik Ganapathy V

BSc. (Hons.), Mathematics and Computer Science, Chennai Mathematical Institute

 Course Duration : Feb-Mar 2018

  View Course

 Syllabus

 Enrollment : 20-Nov-2017 to 05-Feb-2018

 Exam Date : 28-Apr-2018, 29-Apr-2018