Design and Analysis of Algorithms
CS 3510 - Fall 2019
[ Home |
Lectures
| Calendar
| Homeworks
]
COURSE INFO CLASS TIMES: Tu+Th 3-4:15pm in College of Business 100 INSTRUCTOR: Eric Vigoda Email: Eric's Office Hours: Check the calendar, in Klaus 2222 TA office hours: Check the calendar GRADING SCHEME: Best of two:
EXAMS: There will be 4 midterm exams plus a final exam. No books, no notes, no calculators. The final exam will be all inclusive. TEXTBOOK: (required) Algorithms by Dasgupta, Papadimitriou, and Vazirani [DPV] (Note, exercise/section numbers may differ in unofficial online versions.) Other good references: Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein An online version of [CLRS] is available from the library here. TOPICS COVERED: HOMEWORK POLICIES: Submissions: Homeworks are submitted via Gradescope. 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. |
|