CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2003

This is the home page for CMPSCI 311. CMPSCI 311 is the undergraduate core course in the theory of algorithms and will deal with methods of analysis, algorithmic paradigms, and algorithms for sorting, searching, graph problems, numerical problems, and other problem domains. We will conclude with a brief look at NP-completeness and approximation of NP-complete optimization problems.

Important Course Material:

Announcements (21 December):

The textbook for the course is a new one, Introduction to the Design and Analysis of Algorithms by Anany Levitin (Addison-Wesley, ISBN 0-201-74395-7). I have ordered copies through the Jeffrey Amherst College Store in downtown Amherst.

Last modified 21 December 2003