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. 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 Indias 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

Teaching Assistant(s)

KARTHIK GANAPATHY V

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

AALOK THAKKAR

Chennai Mathematical Institute

Ritankar Nath

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

Course Duration : Jul-Sep 2017

View Course

Enrollment : 17-May-2017 to 24-Jul-2017

Exam registration : 02-Aug-2017 to 23-Aug-2017

Exam Date : 24-Sep-2017

Enrolled

12564

Registered

656

Certificate Eligible

506

Certified Category Count

Gold

Silver

Elite

233

Successfully completed

267

Participation

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.
Final Score(Score on Certificate)= 75% of Exam Score + 25% of Assignment Score
NOTE: A9,A10,A11,A12,A13 are programming Assignments

Design and analysis of algorithms - Toppers list

Top 1 % of Certified Candidates