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.
More info

Teaching Assistant(s)

Kapil Rajendra Shenvi Pause

Bsc in Math & CS

Ankita Sarkar

M.Sc. Computer Science

Course Duration : Jan-Mar 2020

View Course

Enrollment : 18-Nov-2019 to 03-Feb-2020

Exam registration : 16-Dec-2019 to 21-Feb-2020

Exam Date : 29-Mar-2020

Enrolled

10056

Registered

353

Certificate Eligible

178

Certified Category Count

Gold

Silver

Elite

Successfully completed

Participation

101

Success

Elite

Silver

Gold

Legend

AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75 AND FINAL SCORE >=40
BASED ON THE FINAL SCORE, Certificate criteria will be as below:
>=90 - Elite + Gold
75-89 -Elite + Silver
>=60 - Elite
40-59 - Successfully Completed

Final Score Calculation Logic

Assignment Score = 15% for best 6 of 8 weekly quizzes 10% for best 3 of 5 programming assignment
Final Score(Score on Certificate)= 75% of Exam Score + 25% of Assignment Score Note: A1- A8 are weekly quiz and A9-A13 are Programming assignment We have taken best assignment score from Both Jan and July course

Design and analysis of algorithms - Toppers list

Top 1 % of Certified Candidates