Design and Analysis of Algorithms

CS 3510 - SPRING 2013


[ Home | Lectures | Homeworks ]

[Piazza course page]

COURSE INFO


CLASS TIMES: MWF 12:05-12:55 AM in Klaus 2447

INSTRUCTOR: Eric Vigoda
Office: Klaus 2146  
Email:
Office Hours: Tuesdays 10-11am and Wednesdays 1-2pm in Klaus 2146

TAs:
  • Linji Yang
    Email:
    Office Hours: Tuesday and Thursday 5:30-6:30pm
                    in the commons area in front of Klaus 2138
  • Shray Bansal
    Email:
    Office Hours: Mondays and Wednesdays 4:30-5:30pm
                    in the commons area in front of Klaus 2138

TEXTBOOK: (required) Algorithms by S. Dasgupta, C. Papadimitriou, and U. Vazirani [DPV]
(Available at GaTech Bookstore or via Amazon)
A preliminary version of the book is available online.
(Note, the exercises and section numbers may be slightly different in the online version.)

Other good references:
Algorithm Design by Kleinberg and Tardos [KT]
Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein [CLRS]
An online version of [CLRS] is available from the library here.
These three books ([DPV], [KT], and [CLRS]) are on course reserve at the library.

TOPICS COVERED:
  • Dynamic programming
  • Divide-and-conquer strategies
  • Graph algorithms: strongly connected components, shortest paths, and minimum spanning trees
  • NP-completeness
  • Other topics depending on the time available

    • HOMEWORK POLICIES:
     Submissions:
    Homeworks are due at the start of class.
    If you cannot make class, you can send it as a PDF to Eric and the TAs.
    No late homeworks will be accepted since solution sets will be
    posted to T-square after the homeworks are collected.

    Collaboration:
    Homework solutions must be in your own words.
    It is probably best to try the homework on your own first. For the challenging problems, it might be useful to work together with other students. However, you should redo the solution from scratch by yourself, and write it up in your own words.
    List at the top of your homework who you collaborated with.
    You cannot consult outside sources, other than the above textbooks.

    EXAMS:
    There will be 3 midterm exams plus a final exam.
    The final exam will be all inclusive, but it will emphasize the later topics (namely, NP-completeness) not covered on a midterm exam.

    The midterm exams will tentatively take place on the following dates:
    • Friday, January 25
    • Wednesday, February 20
    • Wednesday, March 13
    GRADING SCHEME:
    • Homeworks: 10%
    • 3 Midterm Exams: 60%
    • Final exam: 30%