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

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)

GOUTHAM RAJENDRAN

Chennai Mathematical Institute

REBHU JOHYMALYO JOSH

Chennai Mathematical Institute

 Course Duration : Jul-Sep 2015

  View Course

 Enrollment : 18-May-2015 to 12-Jul-2015

 Exam registration : 01-Jul-2015 to 15-Aug-2015

 Exam Date : 06-Sep-2015

Enrolled

6464

Registered

133

Certificate Eligible

85

Certified Category Count

Gold

1

Silver

0

Elite

33

Successfully completed

20

Participation

31

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 Top 4 out of 8 weekly quizzes + 25% of Top 3 out of 5 programming assignments)
  • Exam Score = 50% of Certification Exam Score
  • FINAL SCORE (Score on Certificate) = Exam Score + Assignment Score.
Design and Analysis of Algorithms - Toppers list

ARAVIND RAJESWARAN 91%

INDIAN INSTITUTE OF TECHNOLOGY MADRAS

MITALEE RAMESHBHAI SHINGALA 84%

VGEC, CHANDKHEDA

PRASATH G 84%

SYMANTEC

SANDEEP MISHRA 84%

INSTITUTE OF ENGINEERING AND MANAGEMENT,KOLKATA

VIVEK SHARMA 83%

HPC SPHERE LLC

SHASHANK AGARWAL 82%

JSS ACADEMY OF TECHNICAL EDUCATION

KARTHIK BALAKRISHNAN 81%

SELF EMPLOYED

PREETPAL KAUR BUTTAR 80%

SLIET, LONGOWAL

PANKAJ KUMAR 80%

NIT KURUKSHETRA

HIMANK NAGPAL 79%

BIRLA INSTITUTE OF TECHNOLOGY, MESRA

Assignment

Exam score

Final score

Score Distribution Graph - Legend

Assignment Score: Distribution of average scores garnered by students per assignment.
Exam Score : Distribution of the final exam score of students.
Final Score : Distribution of the combined score of assignments and final exam, based on the score logic.