CS231: Fundamental Algorithms

Spring 2008

Instructor: Brian Tjaden
Meeting: Tuesdays and Fridays, 8:30-9:40am in E111
Office Hours: Mondays 10:00-11:30am, Wednesdays 10:00-11:30am, Thursdays 3:00-5:00pm
FirstClass Conference: CS231-S08

Welcome to CS231
Computer Science 231 is an introduction to the design and analysis of fundamental algorithms in computer science. General techniques covered in the course include divide-and-conquer algorithms, dynamic programming, greediness, and probabilistic algorithms. Topics for the course include sorting, searching, graph algorithms, file compression, and NP-completeness.
Prerequisites: CS230 and MATH225
Distribution: Mathematical Modeling
Semester: Spring. Unit: 1.0

Course Materials
CS231 course materials will be available on the course website as PDF files, which can be viewed and printed using the freely available Adobe Acrobat Reader program.

Textbook
The text for the course is the second edition of Introduction to Algorithms, written by Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, and published by MIT Press, Cambridge, Massachusetts. Several copies of the text, here after known as CLRS, are on reserve in the library.