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: 9:15am - 10:45am Tuesday, Thursday or by appointment |
Week | Date | Topic | Note |
---|---|---|---|
Tu-Aug. 22 | Introduction | ||
Week 1 | Th-Aug. 24 | Fundamentals of Analysis of Algorithms | Ch. 2 |
Tu-Aug. 29 | Fundamentals of Analysis of Algorithms | Ch. 2 | |
Week 2 | Th-Aug. 31 | Brute Force and Exhausive Search | Ch. 3 |
Tu-Sep. 5 | Brute Force and Exhaustive Search | Ch. 3 | |
Week 3 | Th-Sep. 7 | Decrease and Conquer | Ch. 4 |
Tu-Sep. 12 | Decrease and Conquer | Ch. 4 | |
Week 4 | Th-Sep. 14 | Divide and Conquer | Ch. 5 |
Tu-Sep. 19 | Divide and Conquer | Ch. 5 | |
Week 5 | Th-Sep. 21 | Divide and Conquer | Ch. 5 |
Tu-Sep. 26 | Mid-term Exam 1 | Ch. 2 - Ch. 5 | |
Week 6 | Th-Sep. 28 | Transform and Conquer | Ch. 6 |
Tu-Oct. 3 | Transform and Conquer | Ch. 6 | |
Week 7 | Th-Oct. 5 | Space and Time Tradeoffs | Ch. 7 |
Tu-Oct. 10 | Space and Time Tradeoffs | Ch. 7 | |
Week 8 | Th-Oct. 12 | Dynamic Programming | Ch. 8 |
Tu-Oct. 17 | Dynamic Programming | Ch. 8 | |
Week 9 | Th-Oct. 19 | Dynamic Programming | Ch. 8 |
Tu-Oct. 24 | Greedy Technique | Ch. 9 | |
Week 10 | Th-Oct. 26 | Greedy Technique | Ch. 9 |
Tu-Oct. 31 | Iterative Improvement | Ch. 10 | |
Week 11 | Th-Nov. 2 | Iterative Improvement | Ch. 10 |
Tu-Nov. 7 | Mid-term Exam 2 | Ch. 6-10 | |
Week 12 | Th-Nov. 9 | Limitation of Algorithm Power | Ch. 11 |
Tu-Nov. 14 | Limitation of Algorithm Power | Ch. 11 | |
Week 13 | Wed-Nov. 16 | Coping with the Limitations of Algorithm | Ch. 12 |
Tu-Nov. 21 | No class | Holiday | |
Week 14 | Th-Nov. 23 | No class | Holiday |
Tu-Nov. 28 | Coping with Limitations of Algorithms | Ch. 12 | |
Week 15 | Th-Nov. 30 | Coping with Limitations of Algorithms | Ch. 12 |
Tu-Dec. 5 | Discussions | ||
Week 16 | Th-Dec. 7 | Discussions | |
Tu-Dec. 12 | Final Exam (TBA) | Exam week | |
Week 17 | Th- Dec. 14 | No class | Exam Week |