CS473: Fundamental Algorithms (Fall 2010)

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

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

Instructor:

Chandra Chekuri (chekuri), 3228 Siebel Center
Office hours: Monday 10-11am and by appointment.

Teaching assistants:

Ben Raichel (raichel2), Office hours: Friday, 12-1pm
Smit Shah (ssshah5), Office hours: Thursday, 4-5pm
Curtis Wang (wang505), Office hours: Monday, 12.30-1.30pm
Reza Zamani (zamani), Office hours: Sat 2.30pm-3.30pm (for I2CS students - I create the virtual meeting a little bit before we start and will email its pin).

Office hours will be held in the theory lounge on the 3rd floor of Siebel.
Please use cs473help[at]cs.illinois.edu to email the course staff unless you wish to address a specific member of the staff.

Graders: Mo Kudeki, Dan Larkin, Thapanapong Rukkanchanunt

Course policies:

• Homework • Oral Presentations • Head-banging Sessions • Grading • Academic integrity • I2CS/Online Students

Course materials:

• Schedule and links to lecture notes.
• Homeworks and HBS Problems

Announcements:

See class newsgroup class.fa10.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 2010 (highly recommended).

Chandra Chekuri's class notes from Fall 2009.

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.fa10.cs473 on the news server news.cs.illinois.edu.

You must sign up for access if you have not already done so.