CSCI-GA.1170-001/002 Fundamental Algorithms, Spring 2016

Lecturer: Prof. Yevgeniy Dodis,, (212) 998-3084, room 413, WWH. Office hour: Monday 3-4pm
Meeting Time/Place: Monday 5:10-7, room 109, WWH.
Recitation Time/Place: Thu 5:10-6, room 109, WWH.
Recitation Leader: Laura Florescu,
Tutor: Laura Florescu,, Ankit Vani, Office hours: Tue 5-6:30, Thu 6-8pm, Fri 3-4:30 room 412, WWH.
Midterm: March 21, in class. Final: May 9th, 5-7pm, room 109.
Mailing list: To subscribe to the class list, follow instructions at
To post a message to all the list members, send email to Please, post only messages interesting to everybody taking the class. Specific class-related questions and most of your other correspondence should be directed to the tutor or the instructor.
Course Homepage:
NYU classes (for homework submission):

Lecture Summaries (see also Selected Notes from MIT)

Additional Handouts:

Problem Sets:

Brief Course Description:

This is an introductory course in algorithms. We will cover standard topics such as sorting, divide-and-conquer, various data structures, graph algorithms, dynamic programming, greedy algorithms, and - time permitting - some special topics (e.g., online algorithms). The emphasis will be given to arguing the correctness of algorithms and performing the analysis of their running time.


Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein, published by MIT Press.
You can get either the THIRD EDITION (recommended) or the SECOND EDITION. The exercises will refer to the THIRD edition.


There will be one in-class midterm and a final exam, in addition to approximately weekly homework assignments. Tentative grade split is 40% homework, 25% midterm and 35% final exam. Students on the "boundary" between two grades can increase their grade by doing accurate self-grading, as explained below.


Each problem set will consist of several problems. Some of the homework exercises will be routine, but others will be more challenging. I do not expect you to solve all of the homework problems, but I hope that you will benefit from working on the more difficult ones. Homework will be assigned the day of the class, and will be due the following week (unless stated otherwise). No late homework will be accepted. The solutions will be discussed during the recitation of the week the homework is due. We encourage the students to come to the recitation - not only for the homework solutions, - but primarily to see examples of the problems similar to those assigned for the following week.

The maximum point value for each problem (and, sometimes, parts of the problem) will be stated on the homework. Some questions in the homework will be for the extra credit, and will be explicitly marked as such (together with their maximum extra credit) on each assignment. Solving such problems can make your overall grade for the homework above 100%, or, alternatively, effectively "erase" the credit lost for not solving some of the required problems.

We suggest students to use Latex for their solutions, and will provide a Latex source file for each homework (where the students need to replace "stars" ***** by their solutions). Students are welcome to look at this short Latex tutorial for some useful pointers.


In particular, after the students handed in their homework and learned the correct solutions during the following recitation, but before getting back their graded solutions, the students can hand in their self-graded homework, using the same grading system they expect from the actual graders. Unlike regular homework, self-graded homework should only be submitted by email to the Tutor. Make sure you use subject line "SP16 self-graded: homework number, your name" if you follow this option. We believe self-grading their own mistakes will greatly improve the students' understanding of the material. Moreover, as explained above, students on the "boundary" between two grades might increase their grade by doing accurate self-grading.

Concluding Remarks: