Design and Analysis of Algorithms
CS 3510  Spring 2020
[ Home 
Lectures
 Calendar
 Homeworks
]
COURSE INFO CLASS TIMES: Tu+Th Noon1:15pm in Van Leer C240 INSTRUCTOR: Eric Vigoda Email: Eric's office hours: Tuesday and Thursday 10:3011am. Held in Klaus 2222 TAs: Daniel Hathcock, Neil Thistlewaite, Ida Wang, and Bojun Yang. Monday: 12:301:30pm (Daniel), 5:306:30pm (Bojun) Tuesday: 56pm (Neil) Wednesday: 12:301:30pm (Daniel), 4:305:30pm (Bojun) Thursday: 56pm (Ida) Friday: 1:302:30pm (Ida), 4:305:30pm (Neil) 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 (Some of these books are available online from the library) TOPICS COVERED: GRADING SCHEME: Best of two schemes:
If you take the final exam then we will take the max of the two schemes. If you don't reach the B threshold by scheme 1 then you need to take the final exam. EXAMS: There will be 4 midterm exams plus a final exam. The tentative exam dates are listed on the lecture schedule page. No books, no notes, no calculators. We will provide scrap paper. The final exam will be all inclusive. You do not need to take the final exam if you qualify for an A or a B. ADAPTS: If you have special accommodations for testing or homeworks then you should discuss it with me during the first week of classes. Note you need to submit your ADAPTS testing requests on time so that they can adminster the testing, we cannot adminster the testing with special accommodations. Exam Absences: If you have an institute approved absence around an exam date then notify the instructor at least 10 days in advance and email me a copy of the institute approved absence from the Dean of Students. If you are sick for an exam then you need to submit documentation to the Dean of Students and then email the instructor an excused absence letter from the Dean of Students (we cannot be privy to any medical information). Cheating: Any evidence of cheating or plagarism on homeworks or exams will be immediately reported to the Office of Student Integrity (OSI). You will be given a zero on that aspect (total homework grade for the course or that exam) AND your overall course grade will be lowered by one letter. OSI may impose stricter punishments. There are typically multiple versions of the exam so it is easy to identify students who copy from other students. 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 Canvas 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 and any outside sources you consulted (including any solution sets you might have found on the web). Note homeworks are not worth much, the point of homeworks is to practice and learn the material so copying the solutions does not serve much purpose. We will typically do a fast grading of the homeworks and only of a subset of the problems, so you should doublecheck the solutions yourself. 
