Theory of Computer Algorithms

Instructor:   Ivona Bezakova,   email:   my_initials at (humans please replace my_initials by ib)
Class meets:   Mo/We   6:00-7:50pm,   room GOL(70)-1610
Office hours (new, as of January 10):   Mo   2-3pm and 8-8:30pm,   We   8-8:30pm,   Th   11am-12pm and 1-2pm,   office 70-3645
(For the evening office hours, please come at 8pm - I may leave with the last person.)
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. Prerequisites

Discrete math (need to pass 4003-700 or an equivalent course with a grade B or better) and programming in C/C++ or Java (need to pass 4003-703/707 or equivalent courses with a grade B or better).

2. Text

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

3. 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:

4. 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.

5. Topics
6. Technical issues