CS473 - Fundamental Algorithms - Fall 2009

Lectures: Tue and Thu 11:00-12:15, 1404 Siebel Center

Discussion Sections: Tue 5 - 5.50pm (1302 Siebel), Wed 2 - 2.50pm and 3 - 3.50pm (1111 Siebel)

Instructor:
Chandra Chekuri (chekuri), 3228 Siebel Center
Office hours: Thursday and Friday from 1-2pm or by arrangement

Teaching assistants:
Alina Ene (ene1), Office hours: Friday, 3:15-4:15 pm.
Kyle Fox (kylefox2), Office hours: Monday, 11:15-12:15 pm.
Dan Schreiber (dschrei2), Office hours: Monday, 2-3 pm.

All TA office hours held in Theory Lounge next to room 3240 Siebel Center

Graders:
Pichayoot Ouppaphan (pouppap2)

Course policies:

Course materials:

Announcements:

See class newsgroup class.fa09.cs473 for all announcements

Administrivia:

Audience:
CS 473 is a required course for undergraduates in computer science. It can also be taken by graduate students in computer science and related areas who are interested in building up their algorithmic background. It satisfies the distribution requirement in theory (along with CS 573) for the MS and MCS programs. We encourge graduate students in computer science to take CS 573 (graduate algorithms), in particular if they have previously taken an undergraduate level algorithms class.

Prerequisites:
Students are assumed to have mastered the material taught in CS 225 (basic algorithms and data structures) and CS 173 (discrete mathematics). Please note that "mastery" is not the same as "exposure" or even "a good grade". Hence, Homework Zero.

Required textbook:
Jon Kleinberg and Éva Tardos. Algorithm Design. Addison-Wesley, 2005.

Other recommended reading:
Jeff Erickson's course material from Spring 2009 (highly recommended).
Chandra Chekuri's class notes from Fall 2008.
Mahesh Viswanathan's class notes from Spring 2008.
Sariel Har-Peled's course material (mostly for the graduate level).
Algorithms by Dasgupta, Papadimitriou, Vazirani. On reserve at Grainger. Very readable and nice book (highly recommended).
Introduction to Algorithms by Cormen, Leiserson, Rivest, Stein. On reserve at Grainger.
Computers and Intractability by Garey and Johnson. On reserve at Grainger.

Newsgroup: class.fa09.cs473 on the news server news.cs.illinois.edu.
You must sign up for access if you have not already done so.


Webpage contents generously borrowed/copied from those of Jeff Erickson.