Computer Science 365b, Design and Analysis of Algorithms

Spring 2012

[Home] [Schedule]

Course Information

  • Where : Mason Labs 211
  • When : Tuesday and Thursday, 2:30-3:45
  • Textbook : Algorithm Design by Jon Kleinberg and Eva Tardos
  • Instructor : Daniel A. Spielman. Office hours : Wednesday 3:00-4:30, (AKW 201) or by appointment .
  • TAs:
    • Jerrod Ankenman. Office hours: Mon 2-4pm (AKW 114).
    • Roy Lederman. Office hours: Fri 9-11am (AKW 112).
  • All readings, assignments, tests and exams are listed on the course schedule. Please consult it regularly.
  • Please note that collaboration on problems sets is not allowed.

    • Prerequisites

    The prerequisites for this course are CS 202 and CS 223. However, I am willing to take students who have a sufficient background in discrete mathematics and computer science. If you are not sure if you are ready to take the course, please discuss it with me. If you have not taken the prerequisites, be sure to familiarize yourself with the material in Chapters 2 and 3 of Kleinberg-Tardos.

    Course Requirements

    There will be 9 problem sets, a midterm and a final. The grading breakdown will be: The problem sets will be difficult. Accordingly, the threshold for an A grade will be set to around 82%. I will also drop your lowest homework grade, and replace it by your average (suitably normalized). This note explains how grades will be assigned to problem set problems.

    Sign Up

    Please sign up for the course on the Classes*v2 server. I will use the Classes*v2 server to send out announcements.