15-451 Course Information, Fall 2004


Teaching Assistants:

Course Secretary:

Lectures: Tues/Thurs 12:00-1:20. Wean Hall 7500


Rec A: Wed 12:30 (SH 222) - Jon Derryberry
Rec B: Wed 1:30 (SH 222) - Nina Balcan
Rec C: Wed 2:30 (SH 222) - Doru Balcan
Rec D: Wed 12:30 (SH 214) - Runting Shi
Everyone is expected to go to one of the recitation sections. Recitations are a chance to engage in more discussion than is usually possible in a large lecture, with a focus on the process of solving algorithmic problems. Recitations will often contain new material as well.

Course Home page: http://www.cs.cmu.edu/afs/cs/academic/class/15451-f04/www/
Check it frequently for announcements and updates, for copies of handouts, assignments, solutions, and other goodies. We will also post outlines of the lecture notes on the web page.

Bboards: There are two bulletin boards for the course: academic.cs.15-451.discuss is for general discussion, and academic.cs.15-451 is for staff announcements. Please read them frequently.

Grading: Grading will be done as follows:

Important Dates: See the course schedule.

Homework: There will be a problem set every two weeks. These will alternate between ones that require written answers (hwks 1,3,5,7) and ones that require an oral presentation (hwks 2,4,6). Here are guidelines for each type of assignment.

Written homeworks:
Oral Homeworks:

Minis: Mini-homeworks will be made available on the course web page on Friday, and will be due via email to your TA by the upcoming Tuesday night . These will typically be practice-type problems or sometimes may consist of a single open-ended question to think about. Unlike the regular homeworks, these are intended to require at most one hour of work. If you are taking more time than that, please let one of us know.

Readings: The textbook is Introduction to Algorithms (Second Edition), by Cormen, Leiserson, Rivest, and Stein. Specific readings are listed on the course schedule. It is recommended that you skim the reading before lecture, with a more thorough read afterwards. We will also provide lecture notes and other handouts for material that is not covered by the textbook.

Other helpful material can be found in: Data Structures and Network Algorithms by R. E. Tarjan, Randomized Algorithms by Motwani and Raghavan, Programming Pearls by J. Bentley, Introduction to Algorithms: a Creative Approach by Manber, and the classic Aho-Hopcroft-Ullman book.