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

Course Description
In this course, you will learn how to design algorithms for common computational problems and how to analyze their performance rigorously. 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.

Instructors: Siddharth Barman, Arindam Khan, and Rahul Saladi.

Teaching Assistants: Rachana Gusain, Debajyoti Kar, Rameesh Paul, and Arka Ray.

Logistics
We will be using Teams for class discussions and announcements. Also, the assignments will be distributed and collected via Teams. We encourage you to post your questions on that platform.

Classes
Lectures are on every Tuesday and Thursday, 2 pm to 3:30 pm, at CSA 117. The first class is on August 3.

Text Books

Algorithm Design by Jon Kleinberg and Eva Tardos. (Accompanying lecture slides) .
Introduction to Algorithms by Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein.

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.