Differences

This shows you the differences between two versions of the page.

--- courses:alg2021:main [2021/12/28 03:49] – [Announcements] tsay2
+++ courses:alg2021:main [2022/02/07 03:41] (current) – [Algorithms, Fall 2021] tsay2
@@ Line 5: / Line 5: @@
 algorithms and their design principles and to cultivate the students' ability
 in designing and analyzing algorithms independently.
+}=====Announcements=====
-=====Announcements=====
+  * 01/23: grade report available; please send inquiries, if any, to the instructor by 2PM 01/25 (Tue.).
+  * 01/11: notes/slides for Dynamic Programming revised.
   * 12/28: notes/slides for NP-Completeness available.
   * 12/28: notes/slides for Reduction available.
@@ Line 58: / Line 59: @@
   *Graph Algorithms: Advanced [M: Ch. 7;  C: Ch. 22,23,24,25,26] (2 weeks: 12/07, 12/14) [{{courses:alg2021:ch7_notes_b.pdf|notes}}, {{courses:alg2021:ch7_slides_b.pdf|slides}}]
   *Dynamic Programming [C: Ch.15] (1 week: 12/21*) [{{courses:alg2021:dynamic_prog_notes.pdf|notes}}, {{courses:alg2021:dynamic_prog_slides.pdf|slides}}]
-  *Reduction [M: Ch. 10; C: Ch. 29] (1 week: 12/28) [{{courses:alg2021:ch10_notes.pdf|notes}}, {{courses:alg2021:ch10_slides.pdf|slides}}]
+  *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 12/28a) [{{courses:alg2021:ch10_notes.pdf|notes}}, {{courses:alg2021:ch10_slides.pdf|slides}}]
-  *NP-Completeness [M: Ch. 11; C: Ch. 34] (1 week: 2022/01/04*) [{{courses:alg2021:ch11_notes.pdf|notes}}, {{courses:alg2021:ch11_slides.pdf|slides}}]
+  *NP-Completeness [M: Ch. 11; C: Ch. 34] (1.5 weeks: 12/28b, 2022/01/04*) [{{courses:alg2021:ch11_notes.pdf|notes}}, {{courses:alg2021:ch11_slides.pdf|slides}}]
   * **Final** (**2022/01/11**)
   *NP-Completeness Continued [M: Ch. 11; C: Ch. 34] (1 week: 01/18)