Instructor: Victor Shoup
Graders and tutors: TBA
IMPORTANT: This class combines an honors section and a regular section. Section 001 is honors, section 002 is regular. The honors section students will get a few, more challenging projects to work on. Please make sure you know which one you are in.
Lectures: Tue, Thur, 11am-12:15pm, CIWW 109
Recitation: Wed, 12:30-1:45pm, CIWW 109
Grading: Homework 30%, midterm 30%, final 40%.
Course description: Big-O notation, algorithms with numbers (with applications to cryptography and hashing), divide and conquer algorithms, algorithms on graphs, greedy algorithms, dynamic programming, NP-completeness.
Midterm Exam: TBA
Final Exam: TBA
Text: Algorithms, by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani.