Design and Analysis of Algorithms
CS 3510  FALL 2013
[ Home 
Lectures  Homeworks
]
[Piazza course page]
COURSE INFO CLASS TIMES: MWF 12:0512:55 PM in Instructional Center 205 INSTRUCTOR: Eric Vigoda Email: Office Hours: Mondays and Wednesdays 12pm in Klaus 2146 TA: Ioannis Panageas Office Hours: Tuesdays and Thursdays 67pm in the commons area in front of Klaus 2138 GRADING SCHEME:
EXAMS: There will be 5 midterm exams plus a final exam. The final exam will be all inclusive. The midterm exams will tentatively take place on the following dates:
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: Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein [CLRS] An online version of [CLRS] is available from the library here. TOPICS COVERED: 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 we will often discuss the solutions during class and solution sets will be posted to Tsquare 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. 
