NOC | Design and analysis of algorithms

Course abstract

This course will cover basic concepts in the design and analysis of algorithms. 1. Asymptotic complexity,notation 2. Sorting and search 3. Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees 4. Design techniques: divide and conquer, greedy, dynamic programming 5. Data structures: heaps, union of disjoint sets, search trees 6. 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)

No teaching assistant data available for this course yet

Course Duration : Jan-Mar 2021

View Course

Syllabus

Enrollment : 18-Nov-2020 to 25-Jan-2021

Exam registration : 15-Jan-2021 to 12-Feb-2021

Exam Date : 21-Mar-2021

Enrolled

8005

Registered

563

Certificate Eligible

279

Certified Category Count

Gold

Silver

Elite

101

Successfully completed

139

Participation

124

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 20 and July 20 and jan 21course

Design and analysis of algorithms - Toppers list

Top 1 % of Certified Candidates