Introduction to Algorithms
CS 300 - SPRING 2015
[ Home |
Lectures | Homeworks
]
[Piazza course page]
COURSE INFO CLASS TIMES: Tuesdays and Thursdays 10:30 - 11:45am in building N1 room 102 INSTRUCTOR: Eric Vigoda Email: Office Hours: Mondays and Wednesdays 11:30am-12:30pm in N1 #506 (my office) TAs:
GRADING SCHEME:
EXAMS: There will be 3 midterm exams plus a final exam. The final exam will be all inclusive. The midterm exams will tentatively take place on the following dates: These may change by ± one class
The final exam is scheduled for Thursday, June 18 9-11:45am TEXTBOOK: (required) Algorithms by Dasgupta, Papadimitriou, and Vazirani [DPV] (There was an online version available. 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] 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 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. |
|