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)
Course Duration : Jul-Sep 2016
View Course
Syllabus
Enrollment : 23-May-2016 to 18-Jul-2016
Exam registration : 02-Aug-2016 to 19-Aug-2016
Exam Date : 18-Sep-2016, 25-Sep-2016
Enrolled
6808
Registered
177
Certificate Eligible
91
Certified Category Count
Gold
0
Elite
34
Successfully completed
57
Participation
40
Success
.jpg)
Category : Successfully Completed
Elite
.jpg)
Category : Elite
Gold
.jpg)
Category : Gold
Legend
>=90 - Elite + Gold
60-89 - Elite
40-59 - Successfully Completed
<40 - No Certificate
Final Score Calculation Logic
- Assignment Score = 12.5% of Best 6 out of 8 quizzes + 12.5% of best 3 out of 5 Programming assignments
- 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
Assignment
Exam score
Final score
Exam score
Final score