CS 482 STAFF Name Office Instructor
email@example.com 494 Rhodes TAs Alan Cheng akc25@ Tom Church tfc23@ Anirban DasGupta adg@cs. Eric Holmberg-Weidler ejh26@ Hari Nathan hsn4@ Samuel Krasnik smk72@ Joel Ossher jpo5@ Thanh Nguyen thanh@cs. Jeffery Zhang jz87@
Office/Consulting Hours Where Who Monday, 2:30 - 3:30 328 Upson Jeffery Zhang Tuesday, 12:00 - 1:00 328 Upson Hari Nathan Tuesday, 3:00 - 4:00 494 Rhodes Paul Chew Wednesday, 10:00 - 11:00 328 Upson Eric Holmberg-Weidler Wednesday, 1:30 - 2:30 328 Upson Thanh Nguyen Wednesday, 3:00 - 4:00 328 Upson Anirban DasGupta Thursday, 1:30 - 2:30 328 Upson Alan Cheng Thursday, 2:30 - 3:30 328 Upson Tom Church Thursday, 3:30 - 4:30 328 Upson Samuel Krasnik Thursday, 4:30 - 5:30 328 Upson Joel Ossher
Homework Topic Due Date HW1 Stable Matching + Review Friday, Feb 4 HW2 Greedy Algorithms Friday, Feb 11 HW3 Divide & Conquer; Dynamic Programming Friday, Feb 18 HW4 Network Flow Friday, Mar 4 HW5 More Network Flow Friday, Mar 11 HW6 NP-Completeness Friday, Apr 1 HW7 More NP-Completeness Friday, Apr 8 HW8 Solving/Approximating NP-Complete Problems Friday, Apr 22 HW9 Approximating NP-Complete Problems Friday, Apr 29 HW10 Randomized Algorithms Friday, May 6
(but OK if in by noon on Tuesday, May 10)
Course Description (from the Catalog): Techniques used in the creation and analysis of algorithms. Combinatorial algorithms, computational complexity, NP-completeness, and intractable problems.