Algorithm Design & Analysis
Catalog Description
An introduction to standard patterns and techniques in algorithm design and tools for analyzing algorithmic performance. Students learn to evaluate algorithms, design new algorithmic solutions, and communicate the correctness and usefulness of their solutions. Prerequisite: MATH 241 or (MATH 240 and MATH 280) and CSCI 204.
Schedule
| Section | Time | Location |
|---|---|---|
| Lecture | MWF 9-9:50AM | Dana 137 |
| Recitation | T 1-1:50PM | BRKI 066 |
Syllabus
Lecture Notes
These notes closely follow Cormen, Leiserson, Rivest, and Stein’s Introduction to Algorithms. I was also influenced by my notes from taking Prasad Jayanti’s course at Dartmouth College.
If you want to use these notes for your own course, please just let me know! I’m also happy to share LaTeX source if that would be helpful.