Computer Science 231
Fundamental Algorithms
Spring 2012

---

Welcome to CS231
Computer Science 231 is an introduction to the design and analysis of fundamental algorithms. General techniques covered: Divide-and-conquer algorithms, dynamic programming, greediness, probabilistic algorithms. Topics include: sorting, searching, graph algorithms, file compression, and NP-completeness. Course requirements will be discussed on the first day.
Prerequisite: 230
Distribution: Mathematical Modeling
Semester: Fall, Unit: 1.0

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

Course Materials
CS231 course materials for each class will be handed out at the beginning of each lecture. Copies are available in .pdf format using the links on this page and require the Adobe Acrobat Reader program for on-screen viewing and printing.

Course Conference
The course conference will contain announcements and changes to the schedule. Please check this conference before each class and especially before an assign is due. In addition, the conference will contain a section for CS231 students ask and answer questions among themselves concerning course material and assignments. You may discuss the homework in general terms, suggest where to go in the text or lecture notes to help someone get started, or you may help clarify an ambiguous question. However, please do not post your solutions either complete or partial. I will check the conference regularly to help with any unanswered questions.

Randy Shull -- rshull@wellesley.edu
Based on JavaScript calendar program by Mark A. Sheldon
Computer Science 231, Spring 2012
Last Modified April 17, 2012
Page Expires May 31, 2012