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:
- Motwani, Rajeev, and Prabhakar Raghavan. Randomized
Algorithms. Cambridge UP: New York, NY, 1995.
QA274.M68 1995.
- Samet, Hanan. Applications of Spatial Data Structures:
Computer Graphics, Image Processing, and GIS. Addison-Wesley:
Reading, MA, 1990.
QA76.9.D35.S25 1990
- Samet, Hanan. The Design and Analysis of Spatial Data
Structures. Addison-Wesley: Reading, MA, 1990.
QA76.9.D35.S26 1990
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.
- Aho, Alfred V., John E. Hopcroft, and Jeffrey
D. Ullman. The Design and Analysis of Computer
Algorithms. Addison-Wesley: Reading, MA, 1974.
QA76.6.A35
- Aho, Alfred V., John E. Hopcroft, and Jeffrey
D. Ullman. Data Structures and Algorithms.
Addison-Wesley: Reading, MA, 1983.
QA76.9.D35.A38 1983
- Bentley, Jon Louis. Programming Pearls.
Addison-Wesley: Reading, MA, 1986.
QA76.6.B453 1986
- Bentley, Jon Louis. More Programming Pearls: Confessions
of a Coder. Addison-Wesley: Reading, MA, 1988.
QA76.6.B452 1988
- Bentley, Jon Louis. Writing Efficient Programs.
Prentice-Hall: Englewood Cliffs, NJ, 1982. On-line
summary.
QA76.6.B455 1982
- Brassard, Gilles, and Paul Bratley. Fundamentals of
Algorithmics. Prentice-Hall: Englewood Cliffs, NJ, 1996.
QA9.58.B73 1996
- Knuth, Donald Ervin. The Art of Computer
Programming. Addison-Wesley: Reading, MA, 1996.
QA76.5.K55 1973 V.1 (this library copy is an older edition/printing)
QA76.5.K55 1973 V.2 (this library copy is an older edition/printing)
QA76.5.K55 V.3 (this library copy is an older edition/printing)
- Knuth, Donald Ervin. The Stanford GraphBase: a Platform for
Combinatorial Computing. ACM/Addison-Wesley: New York,
NY/Reading, MA, 1993.
QA164.K6 1993
- Musser, David R., and Atul Saini. STL Tutorial & Reference
Guide: C++ Programming with the Standard Template Library.
Addison-Wesley: Reading, MA, 1996.
QA76.73.C153.M87
- Pitman, Jim. Probability. Springer-Verlag: New York,
NY, 1993.
QA273.P493 1993
- Weiss, Mark Allen. Data Structures and Algorithm Analysis
in C. Second edition. Addison-Wesley: Menlo Park, CA,
1996.
QA76.73.C15.W463 1996
- Weiss, Mark Allen. Data Structures and Algorithm Analysis
in C++. Benjamin/Cummings: Redwood City, CA, 1994.
QA76.73.C153.W46 1994
© 1998 Apostolos Lerios