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 yetCourse Duration : Jan-Mar 2022
View Course
Enrollment : 14-Nov-2021 to 31-Jan-2022
Exam registration : 13-Dec-2021 to 18-Feb-2022
Exam Date : 27-Mar-2022
Enrolled
Will be announced
Registered
Will be announced
Certificate Eligible
Will be announced
Certified Category Count
Gold
Will be announced
Silver
Will be announced
Elite
Will be announced
Successfully completed
Will be announced
Participation
Will be announced
Success
.jpg)
Category : Successfully Completed
Elite
.jpg)
Category : Elite
Gold
.jpg)
Category : Gold