CS:3330 AlgorithmsComputer Science, College of Liberal Arts & Sciences, University of IowaInstructor: Tianbao Yang Email: [first-name]-[last-name] at uiowa.edu Office: 257 Macbridge Hall Office hours: 4:00pm - 5:00pm TuThu or by appointment |
Week | Date | Topic | Note |
---|---|---|---|
Tu | Introduction | ||
Week 1 | Th | Fundamentals of Analysis of Algorithms | Ch. 2 |
Tu | Fundamentals of Analysis of Algorithms | Ch. 2 | |
Week 2 | Th | Brute Force and Exhausive Search | Ch. 3 |
Tu | Decrease and Conquer | Ch. 4 | |
Week 3 | Th | Decrease and Conquer | Ch. 4 |
Tu | Decrease and Conquer | Ch. 4 | |
Week 4 | Th | Divide and Conquer | Ch. 5 |
Tu | Divide and Conquer | Ch. 5 | |
Week 5 | Th | Divide and Conquer | Ch. 5 |
Tu | Transform and Conquer | Ch. 6 | |
Week 6 | Th | Transform and Conquer | Ch. 6 |
Tu | Transform and Conquer | Ch. 6 | |
Week 7 | Th | Space and Time Tradeoffs | Ch. 7 |
Tu | Space and Time Tradeoffs | Ch. 7 | |
Week 8 | Th | Dynamic Programming | Ch. 8 |
Tu | Dynamic Programming | Ch. 8 | |
Week 9 | Th | Dynamic Programming | Ch. 8 |
Tu | Greedy Technique | Ch. 9 | |
Week 10 | Th | Greedy Technique | Ch. 9 |
Tu | Iterative Improvement | Ch. 10 | |
Week 11 | Th | Iterative Improvement | Ch. 10 |
Tu | Limitation of Algorithm Power | Ch. 11 | |
Week 12 | Th | Limitation of Algorithm Power | Ch. 11 |
Tu | Limitation of Algorithm Power | Ch. 11 | |
Week 13 | Th | Coping with the Limitations of Algorithm | Ch. 12 |
Tu | Coping with Limitations of Algorithms | Ch. 12 | |
Week 14 | Th | Coping with Limitations of Algorithms | Ch. 12 |
Tu | Intro to Machine Learning | ||
Week 15 | Th | Intro to Machine Learnings | |
Tu | Discussions | ||
Week 16 | Th | Discussions | |
Tu | No class | Exam week | |
Week 17 | Th | No class | Exam Week |