CS 3510 - Design and Analysis of Algorithms

Spring 2007

[ Lectures] [Assignments]

Announcements: Check here regularly for updates.

• HW 6 and solutions are now posted.
• The review sessions for the remaining quizzes are on the Monday and Tuesday before the quiz at 6-7:30pm in Klaus 1456.
• You need to show up on time for the quizzes.
  
• There are 6 quizzes which will take place on the following days:
  • Friday, January 26
  • Wednesday, February 7
  • Wednesday, February 21
  • Wednesday, March 7
  • Wednesday, April 4
  • Wednesday, April 18
• The lectures will be coordinated so you can show up to either lecture.
  For the quizzes and final exam you must show up to the section you are registered for.

Lectures

Section A: MWF 11:05-11:55, CoC, Room 17.
Section B: MWF 10:05-10:55, Instructional Center, Room 213.

Professors

Pete Manolios
Office hours: Monday, Wednesday, 12-1PM, Klaus 2340
Email:

Eric Vigoda
Office hours: Monday, Wednesday, 12-1PM, Klaus 2146
Email:

Teaching Assistants

Spencer Charles Brubaker
Office hours: Thursday 4-5pm
Email:

Apurva Mudgal
Office hours: Monday 4-5pm
Email:

Gopal Pai
Office hours: Tuesday 4-5pm
Email:

The TA office hours are in the CoC Commons Room on the first floor.

Grading

• There will be regular homework assignments, but they will not be collected. We encourage you to first try to solve the problems on your own. Then meet with your classmates to go over your solutions and try to solve any unresolved problems.
• 6 quizzes (16.67% each).
  You need to take the quiz in the section you are registered for. There will be no makeup exams, for any reason. You can drop up to 2 quizzes. When we assign grades, we will automatically determine which (if any) of the quizzes it is to your advantage to drop.
• Final exam (0-33.33%).
  You can drop 0-2 quizzes and the final exam will count for the remainder of your grade. You can also simply use the grades from your 6 quizzes and then you do not need to take the final exam.
• You can take 1 double-sided cheat sheet to each quiz, and 2 double-sided cheat sheets to the final.

Textbooks

[DPV] Algorithms, by S. Dasgupta, C. Papadimitriou and U. Vazirani.

Prerequisites

CS 1050 Minimum Grade of C and (MATH 3012 Minimum Grade of D or MATH 3022 Minimum Grade of D) and (CS 1322 Minimum Grade of C or CS 1312 Minimum Grade of C or CS 1502 Minimum Grade of C).
If you do not have this background you should get the permission of the instructor.