E0 225: Design and Analysis of Algorithms, Fall 2015.

Instructors: Arnab Bhattacharyya and C. Pandu Rangan
Teaching Assistants: Indranil Bhattacharya, Palash Dey, Abhiruk Lahiri, and Anurita Mathur.

Course Description
In this course, you will learn how to design algorithms for common computational problems and how to analyse their performance rigourously. You will see a variety of data structures and algorithms, chosen so as to illustrate foundational concepts and paradigms. Towards the end of the course, we will also discuss what's known about the boundary between computationally feasible and infeasible problems.

Lectures are on every Tuesday and Thursday, 11:30 am to 1:00 pm, at Lecture Hall 4. The first class is on Tuesday, August 11.

This term we will be using Piazza for class discussion. Rather than emailing questions to the teaching staff, we encourage you to post your questions on the Piazza Q&A.

There will also be optional coffee-hour advanced problem sessions for interested students. Timings to be decided.

Text Books
Another very good resource is the book Algorithms by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, as well as the numerous lecture notes scattered throughout the web.