Foundations of Algorithms (CSCI-665-02), Spring 2014-15

Instructor:   Ivona Bezakova, email: (please replace my_initials with ib)
Class meets:   Tu/Th 3:20-4:35, room (GOL)-3435
Office hours (tentative), January 26 - May 12: Tuesday 11am-12pm (due to a conflict in my schedule this office hour moved from the original time 10-11) and Thursday 2-3pm, office (GOL)-3645
Tutoring center: schedule, staffed by students who took (and performed well in) theory-related courses in recent years

0. Homework and Reading Assigments

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

1. Prerequisites

CSCI 603 (Advanced C++), CSCI 605 (Advanced Java), and CSCI 661 (Foundations of CS Theory), with B or better in each of these courses (or equivalent), or permission of instructor (students who take CSCI 261 may not take CSCI 665 for credit).

2. Text

Algorithm Design by Jon Kleinberg and Eva Tardos.
The assignments webpage (that will contain slides from the lectures):
Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, 3rd ed. is a great text for further reading (optional).

3. Course description and intended learning outcomes.

This course provides an introduction to the design and analysis of algorithms. It covers a variety 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: 88%-100%: A grades (91%-100% A, 88%-91% A-), 77%-88%: B grades (85%-88% B+, 80%-85% B, 77%-80% B-), 66%-77%: C grades (74%-77% C+, 69%-74% C, 66%-69% C-), 55%-66%: D, 0%-55%: 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