This shows you the differences between two versions of the page.
courses:alg2022:main [2022/11/21 18:05] 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: {{courses:alg2022:hw8.pdf|HW#8}} due on 11/29. | ||
* 11/21: an illustration of Computing SCCs Using DFS is available. | * 11/21: an illustration of Computing SCCs Using DFS is available. |