ECS 222B - Algorithm Design and Analysis - Spring 2010

Course Information Sheet

March 26, 2010



You are responsible for everything on this handout. Please read it.

Lectures

T,Th 1:40-3 125 Wellman.

Instructor

  • Chip Martel. Kemper Hall , #3049. Phone: 752-2651. email: martel@cs.ucdavis.edu. Office hours: Friday 1:45-2:45, and Tuesday 12:30-1:25

    Midterm

    There will be one midterm in this class (around May. 11).

    Final

    There will be a final exam.

    Textbook

    Approximation Algorithms , by Vijay Vazirani.
  • We will also cover a few advanced sections from the Kleinberg-Tardos Book used in 222A.
  • We will also cover several topics in neither text.

    Course Web page

    We will maintain useful information on the course Web page: http://www.cs.ucdavis.edu/~martel/222b.
  • Visit this page regularly to see what's new. If you miss a handout, get it from here.

    Grading

    There will be periodic problem sets (~4) (40%), a midterm (25%), and a final (35%).

    Homeworks

    Homeworks are due by Noon on the due date. They can be turned in in class, to my office, or my mailbox (or by email). Homeworks will be graded on clarity of presentatation as well as correctness.

    Your solutions should be terse, correct, and legible. Understandability of the solution is as necessary as correctness. Expect to lose points if you provide a "correct" solution with a not-so-good writeup. As with an English paper, you can't expect to turn in a first draft: it takes refinement to describe something well. Typeset solutions are always appreciated.