Computer Science and Engineering
SUNY at Buffalo

CSE 531: Design and Analysis of Algorithms

Instructor: Hung Q. Ngo

Fall 2007

Tue Thu, 1100-1220,
Talbert 115 (map)

Course' Blog | General Information | Schedule and Notes | Assignments | Syllabus | Helpful Links
There might be minor changes to the following schedule throughout the semester. An announcement will be posted when there's some change.
Week Topics Reading Assignments Recitation Topics Notable Events
1. Aug 28, 30

Administrative aspects [ pdf ]
Growth of Functions, Asymtopic Notations and Analysis [ pdf ]
Solving Recurrences, Master Theorem [ 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 ]
  • Featuring Merge Sort, Quick Sort, Counting Inversions, Integer multiplication, FFT, Order Statistics.
  • A Demo of Merge Sort, A Demo of Counting Inversions
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 ]
  • Featuring several scheduling problems, shortest paths, MST, Huffman Coding
  • A demo of interval scheduling algorithm
  • A demo of Dijkstra's algorithm
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 ]

  • Featuring Scheduling, Subset Sums and Knapsacks, Shortest Paths, Matrix-chain Multiplication, Longest-Common Subsequence

 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
  • Max-Flow Min-Cut Theorem, Basic Algorithms and Applications [ pdf ], A demo of Ford-Fulkerson
  • More applications of network flow [ ppt ]
Sections 26.1 to 26.3 Discuss solution to HW3, Q&A before midterm exam.


Tuesday Oct 16
- Midterm exam
9. Oct 23, 25 Discuss one more example of network flows Tuesday, Oct 23
- Homework 4 out
10. Oct 30, Nov 01 NP-Completeness
  • History and Basic Settings [ pdf ]
  • More Reductions [ postscript -- incomplete, but readable ]
Chapter 34 Q&A on HW4

 
11. Nov 06, 08 Discuss one (or two) more example of NP-Completeness 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
- Homework 5 due
- Homework 6 out

Thursday, Nov 24
- No class, Thanksgiving!
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
- Homework 6 due
16. Dec 11, 13

Final exam: Time: 8am-11am, Date: Monday Dec 17, Place: Bell 138