There is only one exam in this course. It is a comprehensive exam covering material presented before spring break. The exam will be given out in class on Tuesday, March 21 and will be due back at the beginning of class on Tuesday, March 28.
You may use your class notes and any other notes that you have prepared in advance of the exam. No other materials should be used and no collaboration is permitted. There will be no time limit imposed on the exam, but it will be designed to take approximately 3 to 4 hours.
One of the major objectives of this course is to prepare you to learn a challenging topic on your own, synthesize the (probably challenging) literature on this topic, and give a clear oral presentation onthe topic. This is a valuable skill no matter where your career takes you! It is my intention to help you refine these skills in this course.
The final project in this course, therefore, comprises a presentation on a topic in the area of algorithms, preferably related to one of the topics covered in the first part of the course. It is preferred that these presentations be done in teams of two people. If you are unable to find a classmate with compatible interests, you may request to do the presentation on your own. The presentation comprises the following components:Here are the key dates for the presentations:
Here is the schedule for the talks:
DATE PRESENTER(S) TOPIC Tuesday, March 28 Dave Buchfuhrer and Brad Tennis Matroid Duals & The Shannon Switching Game Thursday, March 30 Garrett Heckel and Jon Dodge Online Algorithms Tuesday, April 4 Cris Cecka and Chris Erickson Online Routing Thursday, April 6 Elisa Celis and Mac Mason Online Whack-a-Mole Tuesday, April 11 NO CLASS Thursday, April 13 Topper Kain and Pyry Matikainen Online Algorithms and Game Theory Tuesday, April 18 Michael Coupland and John McCullough Adaptive Huffman Coding Thursday, April 20 Dan Halperin and Susanna Ricco Cache-Oblivious Algorithms Tuesday, April 25 Alan Davidson and Reid Howard Pattern Matching Thursday, April 27 Esteban Molina-Estolano Sorting Networks
Last modified February 2006 by hadas@cs.hmc.edu