Section A : Syamantak Das (<firstname> at iiitd....)
Office Hours : Tuesday 12.30-1.45pm , R&D B505
Section B : Supratim Shit (<firstname> at iiitd...)
Renu Singh (<firstname> at iiitd)
There is no fixed textbook for the course. However, we will be heavily following for lectures
[KT] : Algorithm Design, Kleinberg and Tardos
Additional Texts and Referrences :
[Jeff]: An excellent and fun text on algorithms by the hilarious and brilliant Jeff Erickson with a lot of interesting exercises
[CLRS]: Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein aka the Bible of Algorithms
[DPV]: Algorithms by Papadimitrou, Dasgupta, and Vazirani
Algorithms are step-by-step procedure to perform computational tasks. In this course, the objective is to enable the students to design algorithms, formally argue their correctness and communicate them.
1. In-class quizzes (Best 4 out of 5 x 7.5% each) : 30%
2. Midsem + Endsem : 35% + 35%
3. Make-up Exam : One quiz (eligible only if you have formal approval from academics AND you have appeared for at least 3 out of 5 quizzes)
One make-up Exam for midsem and endsem combined
Both of these will be held after the endsem
Mandatory: Must have cleared DSA (relaxed for the current iteration)
Desirable: Have cleared DM/DS. The course will assume knowledge of
mathematical proof techniques and discrete objects like sets, graphs etc
Monday, Wednesday (3.00 - 4.30 PM)
Section A & B: Tuesday 1:30 - 3 PM.