This shows you the differences between two versions of the page.
courses:alg2009:home [2009/05/07 09:11] tsay |
courses:alg2009:home [2022/12/09 11:04] (current) tsay2 [Announcements] |
||
---|---|---|---|
Line 7: | Line 7: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 7/2: grade report available | ||
+ | * 6/4: slides for NP-Completeness available; Note on Chapter 11 of [Manber] available | ||
+ | * 6/4: slides for Dynamic Programming available | ||
+ | * 5/17: {{courses:alg2009:mid2009_s.pdf|Suggested Solutions to Midterm Problems}} available | ||
+ | * 5/7: {{courses:alg2009:hw6.pdf|Homework Assignment #6}} due on May 27 (Wednesday) | ||
+ | * 5/7: {{courses:alg2009:hw5.pdf|Homework Assignment #5 (Programming Exercise #2)}} due on June 4 | ||
* 5/7: slides for Graph Algorithms available | * 5/7: slides for Graph Algorithms available | ||
* 4/24: {{courses:alg2009:hw4.pdf|Homework Assignment #4}} due on May 7 | * 4/24: {{courses:alg2009:hw4.pdf|Homework Assignment #4}} due on May 7 | ||
Line 42: | Line 48: | ||
*Sorting, Searching, and String Processing - Chapter 6 (2 weeks: 4/9, 4/23) [{{courses:alg2009:ch6slides.pdf|slides}}] | *Sorting, Searching, and String Processing - Chapter 6 (2 weeks: 4/9, 4/23) [{{courses:alg2009:ch6slides.pdf|slides}}] | ||
*Graph Algorithms - Chapter 7 (2 weeks: 4/30, 5/7) [{{courses:alg2009:ch7slides.pdf|slides}}] | *Graph Algorithms - Chapter 7 (2 weeks: 4/30, 5/7) [{{courses:alg2009:ch7slides.pdf|slides}}] | ||
- | *Selected Topics: Dynamic Programming, Mergeable Heaps, and Linear Programming - Chapters 15, 19, 20, and 29 of Cormen //et al.// (2 weeks: 5/14, 5/21) | + | *Selected Topics: Dynamic Programming, Mergeable Heaps, and Linear Programming - Chapters 15, 19, 20, and 29 of Cormen //et al.// (2 weeks: 5/14, 5/21) [{{courses:alg2009:dynamic_prog.pdf|Dynamic Programming}}] |
- | *NP-Completeness - Chapter 11 (2 weeks: 6/4, 6/11) | + | *NP-Completeness - Chapter 11 (2 weeks: 6/4, 6/11) [{{courses:alg2009:ch11slides.pdf|slides}};{{courses:alg2009:ch11note1.pdf|note}}] |
=====Grading===== | =====Grading===== |