User Tools
courses:alg2010:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2010:main [2010/04/12 14:08] tsay |
courses:alg2010:main [2022/12/09 11:02] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 7/09: grade report available; please send inquiries, if any, to the instructor by 12Noon July 10. | ||
| + | * 5/31: {{courses:alg2010:hw10.pdf|HW#10}} due on June 11 | ||
| + | * 5/31: slides for NP-Completeness and a note available | ||
| + | * 5/31: slides for Dynamic Programming available | ||
| + | * 5/17: {{courses:alg2010:hw9.pdf|HW#9}} due on May 31 | ||
| + | * 5/17: slides for Advanced Graph Algorithms available | ||
| + | * 5/13: {{courses:alg2010:hw8.pdf|HW#8}} due on May 24 | ||
| + | * 5/03: {{courses:alg2010:mid2010_s.pdf|Solutions to Midterm Problems}} available | ||
| + | * 5/03: slides for Basic Graph Algorithms available | ||
| + | * 4/26: {{courses:alg2010:hw5.pdf|HW#5}} and {{courses:alg2010:hw7.pdf|HW#7}} due on May 10 | ||
| + | * 4/24: slides for String Processing available | ||
| + | * 4/16: solutions to selected homework problems: {{courses:alg2010:hw1s.pdf|HW#1}}, {{courses:alg2010:hw2s.pdf|HW#2}}, {{courses:alg2010:hw3s.pdf|HW#3}}, {{courses:alg2010:hw4s.pdf|HW#4}} | ||
| + | * 4/13: {{courses:alg2010:hw6.pdf|HW#6}} due on April 26; HW#5 (a programming exercise) to be given later | ||
| * 4/12: slides for Searching and Sorting available | * 4/12: slides for Searching and Sorting available | ||
| * 3/29: {{courses:alg2010:hw4.pdf|HW#4}} due on April 8 (at 9AM, for this assignment) | * 3/29: {{courses:alg2010:hw4.pdf|HW#4}} due on April 8 (at 9AM, for this assignment) | ||
| Line 40: | Line 53: | ||
| *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 4/12, 4/26a) [{{courses:alg2010:ch6slides_a.pdf|slides}}] | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 4/12, 4/26a) [{{courses:alg2010:ch6slides_a.pdf|slides}}] | ||
| *String Processing [M: Ch. 6; C: Ch. 32] (1.5 weeks: 4/26b, 5/3) [{{courses:alg2010:ch6slides_b.pdf|slides}}] | *String Processing [M: Ch. 6; C: Ch. 32] (1.5 weeks: 4/26b, 5/3) [{{courses:alg2010:ch6slides_b.pdf|slides}}] | ||
| - | *Graph Algorithms [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 5/10, 5/17, 5/24) [{{courses:alg2010:ch7slides.pdf|slides}}] | + | *Graph Algorithms [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 5/10, 5/17, 5/24) [slides: {{courses:alg2010:ch7slides_a.pdf|Basic Graph Algorithms}}, {{courses:alg2010:ch7slides_b.pdf|Advanced Graph Algorithms}}] |
| *Selected Topics: Dynamic Programming and Mergeable Heaps [C: Ch.15,19] (1 week: 5/31) [{{courses:alg2010:dynamic_prog.pdf|Dynamic Programming}}] | *Selected Topics: Dynamic Programming and Mergeable Heaps [C: Ch.15,19] (1 week: 5/31) [{{courses:alg2010:dynamic_prog.pdf|Dynamic Programming}}] | ||
| *NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/7, 6/14) [{{courses:alg2010:ch11slides.pdf|slides}};{{courses:alg2010:ch11note1.pdf|note}}] | *NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/7, 6/14) [{{courses:alg2010:ch11slides.pdf|slides}};{{courses:alg2010:ch11note1.pdf|note}}] | ||
courses/alg2010/main.1271052487.txt.gz · Last modified: 2010/04/12 14:08 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
