Theory of Computer Algorithms

Instructor:   Ivona Bezakova,   email:   my_initials at (humans please replace my_initials by ib)
Class meets:   Mo/We   10-11:50am,   room 86-1110 (Mo) - this classroom has been changed from the original location in building 23, 70-2455 (We)
(No lecture Dec 19th, 2007.)
Office hours:   Mo   8-9pm,   Tu   11am-12pm,   Th   2:30pm-4:30pm,   part-time students also by appointment,   office 70-3645
Tutoring center:   about 20 hours of tutoring per week (follow this link to see the schedule and more information)

0. Homework and Reading Assigments

For information about topics covered in the class, reading and homework assignments, follow this link.

1. Text

Algorithm Design by Jon Kleinberg and Eva Tardos.
This webpage:

2. Course description and intended learning outcomes.

This course provides an introduction to the design and analysis of algorithms. It covers a large number of classical algorithms and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms.

Intended learning outcomes:

3. Grading Policy Grading scale: 90%-100%: A, 80%-90%: B, 70%-80%: C, 60%-70%: D, 0%-60%: F.
However, your overall grade cannot be more than one letter better than your average exam grade. Moreover, average exam grade F results in failing the class.

4. Topics
5. Technical issues