CS:3330 AlgorithmsComputer Science, College of Liberal Arts & Sciences, University of IowaInstructor: Tianbao Yang Email: [first-name]-[last-name] at uiowa.edu Office: 101E MacLean Hall Office hours: 10:20am - 11:50am MW or by appointment |
| Week | Date | Topic | Note |
|---|---|---|---|
| M | Introduction | ||
| Week 1 (Aug. 20 - 24) | W | Fundamentals of Analysis of Algorithms | Ch. 2 |
| F | Fundamentals of Analysis of Algorithms | Ch. 2 | |
| M | Fundamentals of Analysis of Algorithms | Ch. 2 | |
| Week 2 (Aug. 27 - Aug. 31) | W | Brute Force and Exhausive Search | Ch. 3 |
| F | Brute Force and Exhausive Search | Ch. 3 | |
| M | Labor Day | ||
| Week 3 (Sep. 3 - Sep. 7) | W | Decrease and Conquer | Ch. 4 |
| F | Decrease and Conquer | Ch. 4 | |
| M | Decrease and Conquer | Ch. 4 | |
| Week 4 (Sep. 10 - Sep. 14) | W | Divide and Conquer | Ch. 5 |
| F | Divide and Conquer | Ch. 5 | |
| M | Divide and Conquer | Ch. 5 | |
| Week 5 (Sep. 17 - Sep. 21) | W | Divide and Conquer | Ch. 5 |
| W | Divide and Conquer | Ch. 5 | |
| M | Transform and Conquer | Ch. 6 | |
| Week 6 (Sep. 24 - Sep. 28) | W | Transform and Conquer | Ch. 6 |
| F | Midterm Exam 1 | Ch. 2 - 5 | |
| M | Transform and Conquer | Ch. 6 | |
| Week 7 (Oct. 1 - Oct. 5) | W | Space and Time Tradeoffs | Ch. 7 |
| F | Space and Time Tradeoffs | Ch. 7 | |
| M | Space and Time Tradeoffs | Ch. 7 | |
| Week 8 (Oct. 8 - Oct. 12) | W | Dynamic Programming | Ch. 8 |
| F | Dynamic Programming | Ch. 8 | |
| M | Dynamic Programming | Ch. 8 | |
| Week 9 (Oct. 15 - Oct. 19) | W | Dynamic Programming | Ch. 8 |
| F | Dynamic Programming | Ch. 8 | |
| M | Greedy Technique | Ch. 9 | |
| Week 10 (Oct. 22 - Oct. 26) | W | Greedy Technique | Ch. 9 |
| F | Greedy Technique | Ch. 9 | |
| M | Iterative Improvement | Ch. 10 | |
| Week 11 (Oct. 29 - Nov. 2) | W | Iterative Improvement | Ch. 10 |
| F | Iterative Improvement | Ch. 10 | |
| M | Limitation of Algorithm Power | Ch. 11 | |
| Week 12 (Nov. 5 - Nov. 9) | W | Limitation of Algorithm Power | Ch. 11 |
| F | Midterm Exam 2 | Ch. 6-10 | |
| M | Limitation of Algorithm Power | Ch. 11 | |
| Week 13 (Nov. 12 - Nov. 16) | W | Coping with the Limitations of Algorithm | Ch. 12 |
| F | Coping with the Limitations of Algorithm | Ch. 12 | |
| M | No class | Holiday | |
| Week 14 (Nov. 19 - Nov. 23) | W | No class | Holiday |
| F | No class | Holiday | |
| M | Coping with Limitations of Algorithms | Ch. 12 | |
| Week 15 (Nov. 26 - Nov. 30) | W | Coping with Limitations of Algorithms | Ch. 12 |
| F | Coping with Limitations of Algorithms | Ch. 12 | |
| M | Discussions | ||
| Week 16 (Dec. 3 - Dec. 7) | W | Discussions | |
| F | Discussions | ||
| M | No class | Exam week | |
| Week 17 (Dec. 10 - Dec. 14) | W | No class | Exam Week |
| F | No class | Exam Week |