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 |
|---|---|---|
| 01: Lecture | MWF 11-11:50AM | Dana 115 |
| 02: Lecture | MWF 9-9:50AM | Dana 115 |
| R40: Recitation | Th 9-9:50AM | Dana 115 |
| R41: Recitation | Th 11-11:50AM | Dana 115 |
Syllabus
Lecture Notes
- Set 1 – Intro
- Set 2 – Example Algorithm
- Set 3 – Proof Techniques
- Set 4 – Asymptotic Analysis
- Set 5 – Recurrences
- Set 6 – Divide & Conquer
- Set 7 – Dynamic Programming Intro
- Set 8 – Dynamic Programming Formalism
- Exam 1 Study Guide
- Set 9 – Matrix Chain Multiplication
- Set 10 – Longest Common Subsequence