Modern algorithm design

Course description

MAD (CSE319/CSE519) is designed as a second course in analysis and design of algorithms, a follow-up to the standard undergrad course on the same topic (ADA). On the one hand, this course covers old as well as relatively new algorithms for classical computational problems like spanning trees, shortest paths, matchings etc. On the other, we will discuss more modern topics like how to use of randomization in big data computation, linear programming and its applications, online learning etc. The course can be thought of as a 'Theoretician's Course on Algorithm Design'. Hence, we will be more concerned about rigorously proving various properties of the algorithms rather than their implementation in practice.

Pre-requisite  

Undergraduate Algorithms (ADA) is a definite pre-requisite for this course. However, it is desirable that takers would have some foundation of probability and linear algebra. Most importantly, an appreciation and understanding of how to prove things would be required

Please make yourself aware of IIIT-D's academic dishonesty policy.

Email-etiquette to be followed while mailing the Course Instructor or TA. These are also to be kept in mind while posting on Google Classroom.

Assignment Template

Instructor                                         

Dr. Syamantak Das                                                                        

B-505, New Academic Block

Email : syamantak@iiitd.ac.in 

Office hours :  Wednesday 12.30pm -2pm (please drop an email before coming)

Evaluation

H.W. Assignments : 20% (4 Assignments)

Quizzes : 20% (4 quizzes , best n-1 policy to be applied)

Mid-sem : 30% (open notes exam)

End-sem : 30% (open notes exam)

Resources

The primary resources for the course would be the lecture notes uploaded by the instructor. Each lecture note will have additional references. 

Exams