This shows you the differences between two versions of the page.
courses:alg2020:main [2020/11/17 11:40] tsay2 [Announcements] |
courses:alg2020:main [2021/11/09 09:35] (current) tsay2 [Announcements] |
||
---|---|---|---|
Line 7: | Line 7: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 01/20: grade report available; please send inquiries, if any, to the instructor by 2PM 01/22 (Fri.). | ||
+ | * 01/06: slides from TA sessions: {{courses:alg2020:alg2020hw6_s.pdf|HW#6}}, {{courses:alg2020:alg2020hw7_s.pdf|HW#7}}, {{courses:alg2020:alg2020hw8_s.pdf|HW#8}}, {{courses:alg2020:alg2020hw9_s.pdf|HW#9}}. | ||
+ | * 12/29: notes/slides for NP-Completeness available. | ||
+ | * 12/22: {{courses:alg2020:hw10.pdf|HW#10}} due on 2021/01/04 (Monday); {{courses:alg2020:icpc2017WorldFinalsProblemF.pdf|Problem F}} of the 2017 ACM ICPC World Finals. | ||
+ | * 12/22: notes/slides for Reduction available. | ||
+ | * 12/15: {{courses:alg2020:hw9.pdf|HW#9}} due on 12/22. | ||
+ | * 12/15: notes/slides for Dynamic Programming available. | ||
+ | * 12/01: {{courses:alg2020:hw8.pdf|HW#8}} due on 12/08. | ||
+ | * 12/01: notes/slides for Advanced Graph Algorithms available. | ||
+ | * 11/24: {{courses:alg2020:hw7.pdf|HW#7}} due on 12/01. | ||
+ | * 11/23: {{courses:alg2020:alg2020mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
* 11/17: notes/slides for Basic Graph Algorithms available. | * 11/17: notes/slides for Basic Graph Algorithms available. | ||
* 11/03: slides from TA sessions: {{courses:alg2020:alg2020hw1_s.pdf|HW#1}}, {{courses:alg2020:alg2020hw2_s.pdf|HW#2}}, {{courses:alg2020:alg2020hw3_s.pdf|HW#3}}, {{courses:alg2020:alg2020hw4_s.pdf|HW#4}}. | * 11/03: slides from TA sessions: {{courses:alg2020:alg2020hw1_s.pdf|HW#1}}, {{courses:alg2020:alg2020hw2_s.pdf|HW#2}}, {{courses:alg2020:alg2020hw3_s.pdf|HW#3}}, {{courses:alg2020:alg2020hw4_s.pdf|HW#4}}. |