This is a graduate level course about algorithms. Our goal is to discuss the foundations of algorithm design and analysis. It is assumed that you are comfortable with mathematical proofs before you take this class. We will often use ideas like proofs by contradiction, and proofs by induction. This is content from an undergraduate course on the same topics. This class will cover similar material in greater depth and faster.
There will be bi-weekly homework (40%), a take-home midterm (25%), and a take-home final (35%). You may discuss solutions to the homework problems with your classmates, but you should write all solutions by yourself.
We meet in CSE2 G10 for lectures. Lectures are on Tuesday from 620pm-930pm. Videos of lectures will be posted on the schedule page.