We will basically follow the syllabus sketched on page xx of the text book. Week 1: Chapter 1 Preparation for hw 1 working with claims Gale-Shapley Algorithm 1.2 Five Representative Problems Week 2: Chapter 2 Basics of Algorithm Analysis Preparation for the Jar Stress Testing Homework hw2: Chapter 2, exercise 8. Week 3: Chapter 3: Graphs hw3: Jar Stress Testing continued. Topological sorting implementation Week 4: Chapter 4: Greedy Algorithms Week 5: Chapter 5: Divide and Conquer Week 6: Divide and Conquer Week 7: Dynamic Programming Week 7: Dynamic Programming Week 8: Network Flow Week 9: Network Flow Week 10: NP and Computational Intractability Week 11: Extending the Limits of Tractability following the text book chapters with some exceptions to be announced in class. ================ The grade will be based on a open-book midterm (20%), open-book final (30%), homework solutions (30%) and class participation. You should actively participate in class with questions and answers. Please also reply on the mailing list when you know an answer.