This is an introductory course about algorithms. Our goal is to introduce the basic concepts used to design and analyze algorithm. It is assumed that you are comfortable with mathematical proofs before you take this class. We will often use ideas like proof by contradiction, and proof by induction.

Visit the schedule tab for a list of topics and course resources. The class meets MWF from 1:30-2:20 in CSE2 G20.

There will be weekly homework (40%), a midterm (25%), and a final (35%). You may discuss solutions to the homework problems with your classmates, but you should write all solutions by yourself.

## Professor and TAs

- Anup Rao, anuprao@cs.
- Maxwell Gray, maxgray@cs.
- Siddharth Kulkarni, sidhk@cs.
- Sam Lee, minhsuan@cs.
- Siva Ramamoorthy, sivanr@cs.
- Oscar Sprumont, osprum@cs.
- Ivy Wangno, fw29@cs.
- Xin Yang, yx1992@cs.
- Guanghao Ye, ghye@cs.

Office hour schedule: