gratuitous image    

Computer Science 211
Combinatorial Algorithms
CMPS 211 (40864)

DO NOT RUN lpr at school on a ps.gz file. Use the ps file or a pdf file. For example,
lpr -Pe3east -o sides=two-sided-long-edge.
Or print out of acroread on moondance or sundance after making sure the print command is correct (as above) in the print window that opens.

CMPS 201 is a pre-requisite for this class.
Class Mailing List (when created):
Actually this is a google group now. The name is
Subscribe with your SOE login. Non-SOE subscribers will be deleted soon.

For this class you will need to send mail from your SOE login and receive mail there. If you do not have an SOE email, you can request it.
Course Topics:
The theme is solving optimization problems via combinatorial algorithms.
To some extent, topics will be based on students' interests.
Linear Programming and the Simplex Algorithm
Fourier Transforms
How are the above three topics related?
Cluster Analysis and Community Structure in Graphs
Network Flow
Linear Programming, Interior-Point Methods
Dynamic Programming
Graph Searching
Constraint Satisfaction, Propositional Satisfiability and Quantified Boolean Formulas

References to ``the syllabus'' mean or ho01.pdf.


Winter 2015 Class Handouts
Handouts and other files. The syllabus is or ho01.pdf

Winter 2015 Class Project
Shared files for 211 projects, if there are any projects.

Key Dates, A.Y. 2014-15.     2014-15calendar-two-pages.pdf

Schedule of Classes.

Registrar Catalog pages, the official source.
School of Engineering class pages, an unofficial source.

Lecture times:
MWF 3:30-4:40, Baskin 169
Prof. Allen Van Gelder (avg @
Phone: (831) 459-4611
Office: 355 Engineering II
Office Hours: Mon., Wed. 2:00-3:00, plus 5PM-??, plus drop-in or appt.

Primary Textbook:
Introduction to Computer Algorithms, 3rd Ed.
by Cormen, Leiserson, Rivest, and Stein (2009)
Students should already be familiar with most of Chs. 1-26.
Lectures will cover advanced topics in chs. 1-26 and chapters on course topics.
Several topics not in the text will be covered by handouts.

Possible Internet source: look up Abe's books and decide for yourself.

Other Texts (for reference, no assignments):
Computer Algorithm Design by Kleinberg and Tardos

Design and Analysis of Computer Algorithms
by Aho, Hopcroft, and Ullman (1979)

Computer Algorithms, 3rd Edition by Sara Baase and Allen Van Gelder
Please click here to see web-errata.pdf

C: An Advanced Introduction, ANSI C Edition
by Narain Gehani

Questions regarding page content should be directed to
Last modified Thursday, 01-Jan-2015 17:55:50 PST.