Off-line Resources

All scheduling information listed below is only approximate. For specific days, please consult the course schedule.

Lectures

Lectures take place on Tuesdays and Thursdays, from 1:15p to 3:05p, between June 24 and August 14, 1997, in Gates B03. They are broadcasted live on SPCD channel E4; also, videotapes of the lectures may be viewed at the Mathematical and Computer Sciences library.

Students are strongly encouraged to attend the (required) lectures, as they occasionally cover material which is not present in the textbook. Class participation is encouraged, and will be taken into account when the course grade is borderline. Auditors are welcome.


Problem sessions

Problem sessions take place on Mondays, from 11:00a to 12:15p, between June 30 and August 4, 1997, in Gates B03. They are broadcasted live on SPCD channel E3; also, videotapes of the lectures may be viewed at the Mathematical and Computer Sciences library.

Students are strongly encouraged to attend the (optional) problem sessions, during which the TA interactively solves problems with the assistance of the class, offers hints to solving homework problems, and suggests approaches to the project. Class participation is essential, and will be taken into account when the course grade is borderline. Auditors are welcome.


Handouts

Course handouts will be distributed in class and via the SPCD courier. During the course, handouts will be archived in Gates 377, in a drawer marked "CS 161". Some handouts will also be available on-line.

Textbook

The textbook is available from the Stanford Bookstore, which accepts mail orders.

Authors Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest
Title Introduction to Algorithms
Series The MIT electrical engineering and computer science series
Year 1990
Publisher MIT Press/McGraw-Hill, Cambridge, MA
Call # QA76.6.C662 1990
ISBN # (McGraw) 0-07-013143-0
ISBN # (MIT) 0-262-03141-8
Price $66.95
Errata Available on-line


Library

The Mathematical and Computer Sciences library is open to all students. It offers a wealth of resources, including taped lectures and problem sessions, journal articles, textbook copies, and alternative textbooks.

Reserve items

The following items, along with a copy of the textbook, have been placed on reserve (1 day loan; may circulate outside the library); the last two are excellent resources for the project:

Selected references

The following books are good sources to consult when you need alternative presentations or additional examples on CS 161 topics. This list includes books covering the more practical aspects of coding algorithms.
© 1998 Apostolos Lerios