CS 411 Fall 2025 > Semester Plan
CS 411 Fall 2025
Semester Plan
Updated: 2025-08-23
Topics and dates—other than exam dates—are subject to change. Due dates will not be earlier than those given.
| Week | Topics | Events | 
|---|---|---|
| Week 1 Aug 25–Aug 29 | Course Introduction Introduction (L Ch 1) Basics of Analysis (L Ch 2) | 
 | 
| Week 2 Sep 1–Sep 5 | Basics of Analysis (L Ch 2) | 
 | 
| Week 3 Sep 8–Sep 12 | Basics of Analysis (L Ch 2) Brute Force (L Ch 3) | 
 | 
| Week 4 Sep 15–Sep 19 | Brute Force (L Ch 3) Decrease and Conquer (L Ch 4) | |
| Week 5 Sep 22–Sep 26 | Decrease and Conquer (L Ch 4) | 
 | 
| Week 6 Sep 29–Oct 3 | Divide and Conquer (L Ch 5) | |
| Week 7 Oct 6–Oct 10 | Divide and Conquer (L Ch 5) Transform and Conquer (L Ch 6) Midterm Exam | 
 | 
| Week 8 Oct 13–Oct 17 | Transform and Conquer (L Ch 6) Space-Time Trade-Offs (L Ch 7) | |
| Week 9 Oct 20–Oct 24 | Space-Time Trade-Offs (L Ch 7) Dynamic Programming (L Ch 8) | |
| Week 10 Oct 27–Oct 31 | Dynamic Programming (L Ch 8) Greedy Techniques (L Ch 9) | 
 | 
| Week 11 Nov 3–Nov 7 | Greedy Techniques (L Ch 9) | 
 | 
| Week 12 Nov 10–Nov 14 | Iterative Improvement (L Ch 10) | |
| Week 13 Nov 17–Nov 21 | Limits of Algorithm Power (L Ch 11) | |
| Week 14 Nov 24–Nov 28 | Limits of Algorithm Power (L Ch 11) | 
 | 
| Week 15 Dec 1–Dec 5 | Coping with Limits of Algorithms (L Ch 12) Course Wrap-Up | 
 | 
| Finals Dec 8–Dec 12 | Final Exam | 
 | 
| 
 |