Computer
Science and Engineering SUNY at Buffalo 
CSE 531: Design and Analysis of Algorithms
Instructor: Hung
Q. Ngo 
Fall 2007
Tue Thu,
11001220, 
Week  Topics  Reading Assignments  Recitation Topics  Notable Events 

1. Aug 28, 30 
Administrative aspects [ pdf ] 
Chapters 1 to 4, (except 4.4)  No recitation in the first week  Tuesday, Aug 28  Homework 1 out 
2. Sep 04, 06  Divide and Conquer [ pdf ] 
Chapter 7 Sections 9.1, 9.3 Sections 30.1, 30.2 
Solving Recurrences, Master Theorem 

3. Sep 11, 13  Binary Heap, Priority Queue  Tuesday, Sep 11  Homework 1 due  Homework 2 out Thursday, Sep 13  No class, Rosh Hashanah 

4. Sep 18, 20  Greedy Algorithms [ pdf ] 
Sections 16.1 to 16.3 Chapter 23 Section 24.3 
Discuss solution to HW1, Q&A on HW2 

5. Sep 25, 27  Discuss one more example of a greedy algorithm and its proof of correctness  Tuesday, Sep 25  Homework 2 due  Homework 3 out: 

6. Oct 02, 04 
Dynamic
Programming [ pdf ]

Chapters 15, 24, 25  Discuss solution to HW2,
Q&A on HW3 

7. Oct 09, 11  Discuss one more example of dynamic programming  Thursday, Oct 11  Homework 3 due 

8. Oct 16, 18  Network Flow 
Sections 26.1 to 26.3  Discuss solution to HW3, Q&A before midterm exam. 

9. Oct 23, 25  Discuss one more example of network flows  Tuesday,
Oct 23  Homework 4 out 

10. Oct 30, Nov 01  NPCompleteness

Chapter 34  Q&A on HW4 

11. Nov 06, 08  Discuss one (or two) more example of NPCompleteness reductions  Tuesday,
Nov 06  Homework 4 due  Homework 5 out 

12. Nov 13, 15  
13. Nov 20, 22  Linear Programming [ pdf  completed ]  Chapter 29  Discuss solution to HW4, Q&A on HW5 
Tuesday,
Nov 20 Thursday,
Nov 24 
14. Nov 27, 29  Discuss a bit more on linear programming  
15. Dec 04, 06  Discuss solution to hw5, general Q&A. 
Tue,
Dec 04 

16. Dec 11, 13 
Final exam: Time: 8am11am, Date: Monday Dec 17, Place: Bell 138 