Course news

The final examination is now out. It will be due at 5 p.m. on Thursday, December 16.

I have received, by e-mail, two questions about problem 5 on the examination:

We are supposed to assume that the H(homes) and S(shelters) are disjoint. Are we also supposed to assume that these are disjoint from the intersections?

No, a path from a home to a shelter may include another home or shelter. Intersections is just a handy way to refer to the rest of the vertices; it isn't intended to exclude such paths.

What assumptions, if any, are we allowed to make about the number of residents at each house?

The number of residents in each house is a positive integer.

Knuth's implementation of the "dancing links" algorithm (in CWeb) · My implementation (in C)

Simulated annealing applied to the traveling-salesperson problem

The genetic algorithm applied to the monkeys-writing-Hamlet problem

General information about the course

This course deals with the design, formulation, and implementation of algorithms and with the data structures on which commonly occurring algorithms operate. We study and develop techniques for determining the resource use of algorithms and for establishing the correctness of implementations.

The class meets in Noyce 3821, on Mondays, Wednesdays, and Fridays, from 2:15 to 3:05 p.m.

Our textbook is Introduction to algorithms, third edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (Cambridge, Massachusetts: The MIT Press, 2009; ISBN 978-0-262-00384-8).

My office is room 3829 in the Noyce Science Center. My office hours for the fall semester are Tuesdays from 9 to 11 a.m., Thursdays from 1:15 to 3:15 p.m., and Fridays from 10 a.m. to noon. My telephone extension is 3181.

Course requirements · Grading and attendance policies · Schedule of topics · Exercises · Study questions