User Tools
courses:alg2022:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2022:main [2022/11/07 17:01] tsay2 [Announcements] |
courses:alg2022:main [2023/10/17 12:50] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 01/04: grade report available (revised 01/08); please send inquiries, if any, to the instructor by 2PM 01/06 (Fri.). | ||
| + | * 12/15: the draft of Suggested Solutions to Final 2021 Problems revised. | ||
| + | * 12/13: a draft of {{courses:alg2022:alg2021final_s20221215.pdf|Suggested Solutions to Final 2021 Problems}} available (revised 12/15). | ||
| + | * 12/12: {{courses:alg2022:alg2022mid_s.pdf|Suggested Solutions to Midterm Problems}} revised for Problem 10. | ||
| + | * 12/05: {{courses:alg2022:hw10.pdf|HW#10}} due on 12/13. | ||
| + | * 12/05: notes/slides for NP-Completeness available. | ||
| + | * 12/05: notes/slides for Reduction available. | ||
| + | * 11/28: {{courses:alg2022:hw9.pdf|HW#9}} due on 12/06. | ||
| + | * 11/28: notes/slides for Dynamic Programming available. | ||
| + | * 11/24: notes/slides for Basic Graph Algorithms revised. | ||
| + | * 11/21: {{courses:alg2022:hw8.pdf|HW#8}} due on 11/29. | ||
| + | * 11/21: an illustration of Computing SCCs Using DFS is available. | ||
| * 11/07: {{courses:alg2022:hw7.pdf|HW#7}} due on 11/16. | * 11/07: {{courses:alg2022:hw7.pdf|HW#7}} due on 11/16. | ||
| * 11/07: notes/slides for Advanced Graph Algorithms available. | * 11/07: notes/slides for Advanced Graph Algorithms available. | ||
| Line 61: | Line 73: | ||
| * **Midterm** (**2022/10/25**) | * **Midterm** (**2022/10/25**) | ||
| *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/01, 11/08a*) [{{courses:alg2022:ch7_notes_a.pdf|notes}}, {{courses:alg2022:ch7_slides_a.pdf|slides}}, {{courses:alg2022:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2022:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/01, 11/08a*) [{{courses:alg2022:ch7_notes_a.pdf|notes}}, {{courses:alg2022:ch7_slides_a.pdf|slides}}, {{courses:alg2022:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2022:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | ||
| - | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/08b, 11/22) [{{courses:alg2022:ch7_notes_b.pdf|notes}}, {{courses:alg2022:ch7_slides_b.pdf|slides}}] | + | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/08b, 11/22) [{{courses:alg2022:ch7_notes_b.pdf|notes}}, {{courses:alg2022:ch7_slides_b.pdf|slides}}, {{courses:alg2022:ch7_slides_scc.pptx|Computing SCCs (Illustration)}}] |
| *Dynamic Programming [C: Ch.15] (1 week: 11/29*) [{{courses:alg2022:dynamic_prog_notes.pdf|notes}}, {{courses:alg2022:dynamic_prog_slides.pdf|slides}}] | *Dynamic Programming [C: Ch.15] (1 week: 11/29*) [{{courses:alg2022:dynamic_prog_notes.pdf|notes}}, {{courses:alg2022:dynamic_prog_slides.pdf|slides}}] | ||
| *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 12/06a) [{{courses:alg2022:ch10_notes.pdf|notes}}, {{courses:alg2022:ch10_slides.pdf|slides}}] | *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 12/06a) [{{courses:alg2022:ch10_notes.pdf|notes}}, {{courses:alg2022:ch10_slides.pdf|slides}}] | ||
courses/alg2022/main.1667811700.txt.gz · Last modified: 2022/11/07 17:01 by tsay2
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
