CMSC 441, Section 0201, Spring 1996
Reference Books
Here's a list of several textbooks that are good sources of
information for this course. They are not required reading, but if
you want a source of information other than our textbook, you might
find these texts useful.
- The Design and Analysis of Algorithms. Aho, Hopcroft and Ullman.
Addison-Wesley, 1976.
[Somewhat dated, but this is an old standby]
- Data Structures and Algorithms. Aho, Hopcroft and Ullman.
Addison-Wesley, 1983.
[Really a data structures book --- good for reviewing.]
- Algorithms in C. Robert Sedgewick. Addison-Wesley.
[The same book is also available in Pascal, C++ and Modula-3.]
Some more advanced texts:
- Data Structures and Algorithms 1: Sorting and Searching. Kurt Mehlhorn.
Volume 1 of EATCS Monographs on Theoretical Computer Science.
Springer-Verlag, 1984.
- Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness.
Kurt Mehlhorn. Volume 1 of EATCS Monographs on Theoretical Computer
Science. Springer-Verlag, 1984.
- The Design and Analysis of Algorithms. Dexter Kozen.
Springer-Verlag, 1992.
Last Modified:
Wed Feb 7 16:35:27 EST 1996
Richard Chang, chang@gl.umbc.edu