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

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

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

Exam registration : 08-Jan-2018 to 07-Mar-2018

Exam Date : 28-Apr-2018

Enrolled

15455

Registered

780

Certificate Eligible

453

Certified Category Count

Gold

Silver

Elite

214

Successfully completed

234

Participation

173

Success

Elite

Gold

Legend

>=90 - Elite + Gold
60-89 - Elite
40-59 - Successfully Completed
<40 - No Certificate

Final Score Calculation Logic

Assignment Score = 12.5% of 6 out of 8 quiz+12.5% of 3 out of 5 Programming assignment.
Exam Score = 75% of Certification Exam Score out of 100
FINAL SCORE (Score on Certificate) = Exam Score + Assignment Score
NOTE:A9,A10,A11,A12,A13 are programming Assignments

Design and Analysis of Algorithms - Toppers list

Top 1 % of Certified Candidates