Week |
Files Available |
PDF 1/1 |
1. Jan 16, 18 |
Administrative aspects of CSE 431/531, Growth
of functions, Solving recurrences |
2. Jan 23, 25 |
3. Jan 30, Feb 01 |
Greedy Algorithms (Final
version), A Demo
of Interval Scheduling Algorithm, A Demo
of Dijkstra's Algorithm |
4. Feb 06, 08 |
5. Feb 13, 15 |
Divide and Conquer,
A Demo
of Merge Sort, A Demo
of Counting Inversions
|
6. Feb 20, 22 |
7. Feb 27, Mar 01 |
Dynamic programming: Basic
Examples and Shortest Paths
in Graphs |
8. Mar 06, 08 |
9. Mar 13, 15 |
Spring Break! |
10. Mar 20, 22 |
Network Flows
|
11. Mar 27, 29 |
|
12. Apr 03, 05 |
13. Apr 10, 12 |
14. Apr 17, 19 |
|
15. Apr 24, 26 |
|
|