CS 6505 - Computability and Algorithms

Spring 2009

[ Lectures] [Assignments]

Lectures

MWF 12:05-12:55, Klaus room 2443.

Professors

H. Venkateswaran
Office hours: TBD
Email:

Eric Vigoda
Office hours: Monday and Wednesday, 1-2pm in Klaus 2146
Email:

Teaching Assistants     Office hours: Monday - Thursday 4:30-5:30pm

Apurva Mudgal
Office hours: Tuesday and Thursday 4:30 - 5:30pm
Email:

Linji Yang (for algorithms portion)
Office hours: Monday and Wednesday 4:30 - 5:30pm
Email:

Shiva Kintali (for computability/complexity portion)
Office hours: TBD
Email:

The TA office hours are on the 2nd floor of the Klaus building, in the common area between rooms 2116 and 2124.

Grading

• The grades for the course will be computed as:

  Best 3 of 4 quizzes - 50%

  Homeworks (drop lowest) - 20%

  Final exam - 30%

• In addition, we will use the following grading scheme:

  All 4 quizzes - 80%

  All homeworks - 20%

  If you have a solid A, B or C under this scheme we will inform you during reading week.
  (An A-, B- or C- won't qualify.)
  If you are OK with that grade you can choose to skip the final exam.
  If you decide to take the final exam it will not hurt your course grade.
• There will be no makeup exams, for any reason. You can use your dropped quiz if you need to miss an exam.

Textbooks

[KT] Algorithm Design, by J. Kleinberg and E. Tardos.

[S] Introduction to the Theory of Computation, by M. Sipser.

Both books are on reserve at the library, call numbers RES210955 and QA267.S56 2006