Final examination: Thursday, December 20, 9 a.m. to noon, Noyce 3819.
Here's an old final examination from a previous offering of this course, just so you can see how I structure exams.
CSC 301, “Analysis of algorithms,” 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 3819, on Mondays, Wednesdays, and Fridays, from 1:15 to 2: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). It would be worth while to read this book in its entirety, but that project is perhaps too ambitious for this course. Instead, we'll study selected chapters more intensively.
The authors of the textbook have kindly supplied some supplementary material on line, including answers to selected exercises and a list of errata.
The instructor for this course is John David Stone. My office is Noyce 3829, near the east end of the long corridor on the third floor of the Noyce Science Center, on the north side (facing Eighth Avenue). My telephone extension on the Grinnell College campus is 3181.
My office hours for fall 2012 are
or by appointment.
I am indebted to Kate Ingersoll for pointing out that an earlier version of this Web page gave the wrong meeting time for this course.