This shows you the differences between two versions of the page.
courses:alg2013:main [2013/04/29 23:07] tsay |
courses:alg2013:main [2019/12/31 12:46] (current) tsay2 [Announcements] |
||
---|---|---|---|
Line 3: | Line 3: | ||
algorithms and their design principles and to cultivate the students' ability | algorithms and their design principles and to cultivate the students' ability | ||
in designing and analyzing algorithms independently. | in designing and analyzing algorithms independently. | ||
- | |||
=====Announcements===== | =====Announcements===== | ||
+ | * 07/03: grade report available; please send inquiries, if any, to the instructor by 2PM July 05. | ||
+ | * 06/14: slides from TA sessions: {{courses:alg2013:hw6slides.pptx|HW#6}}, {{courses:alg2013:hw7slides.pptx|HW#7}}, {{courses:alg2013:hw8slides.pptx|HW#8}}, {{courses:alg2013:hw9slides.pptx|HW#9}}. | ||
+ | * 06/03: notes/slides for NP-Completeness available. | ||
+ | * 05/29: reminder: there will be a TA session on 06/04. | ||
+ | * 05/28: {{courses:alg2013:hw10.pdf|HW#10}} due on 06/11. | ||
+ | * 05/27: notes/slides for Dynamic Programming and for Reduction available. | ||
+ | * 05/21: {{courses:alg2013:hw9.pdf|HW#9}} due on 05/28. | ||
+ | * 05/14: reminder: there will be a TA session on 05/21. | ||
+ | * 05/07: {{courses:alg2013:alg2013mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
+ | * 05/06: {{courses:alg2013:hw8.pdf|HW#8}} due on 05/14. | ||
+ | * 05/05: notes/slides for Advanced Graph Algorithms available. | ||
* 04/29: notes/slides for Basic Graph Algorithms available. | * 04/29: notes/slides for Basic Graph Algorithms available. | ||
* 04/22: {{courses:alg2013:hw7.pdf|HW#7}} due on 04/30. | * 04/22: {{courses:alg2013:hw7.pdf|HW#7}} due on 04/30. | ||
* 04/22: notes/slides for String Processing available. | * 04/22: notes/slides for String Processing available. | ||
* 04/09: slides from TA sessions: {{courses:alg2013:hw1slides.pptx|HW#1}}, {{courses:alg2013:hw2slides.pptx|HW#2}}, {{courses:alg2013:hw3slides.pptx|HW#3}}, {{courses:alg2013:hw4slides.pptx|HW#4}}. | * 04/09: slides from TA sessions: {{courses:alg2013:hw1slides.pptx|HW#1}}, {{courses:alg2013:hw2slides.pptx|HW#2}}, {{courses:alg2013:hw3slides.pptx|HW#3}}, {{courses:alg2013:hw4slides.pptx|HW#4}}. | ||
- | * 04/09: old exams: {{courses:alg:old_exams.zip|1996-2012}}. | + | * 04/09: {{courses:alg:old_exams.zip|old exams}}. |
* 04/01: problem statement of 5.8 in {{courses:alg2013:hw4.pdf|HW#4}} corrected. | * 04/01: problem statement of 5.8 in {{courses:alg2013:hw4.pdf|HW#4}} corrected. | ||
* 03/27: reminder: there will be a TA session on 04/09. | * 03/27: reminder: there will be a TA session on 04/09. | ||
Line 25: | Line 35: | ||
* 02/19: eight copies of [Manber 1989] available for loan; please contact TA Lai or Chang. | * 02/19: eight copies of [Manber 1989] available for loan; please contact TA Lai or Chang. | ||
* 02/18: notes/slides for Introduction and Mathematical Induction and an appendix on Proving a Loop Invariant available. | * 02/18: notes/slides for Introduction and Mathematical Induction and an appendix on Proving a Loop Invariant available. | ||
- | |||
=====Instructor===== | =====Instructor===== | ||
[[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept., | [[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept., | ||
Line 64: | Line 73: | ||
* **Midterm** (**2013/04/16**) | * **Midterm** (**2013/04/16**) | ||
*String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/23) [{{courses:alg2013:ch6_notes_b.pdf|notes}}, {{courses:alg2013:ch6_slides_b.pdf|slides}}] | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/23) [{{courses:alg2013:ch6_notes_b.pdf|notes}}, {{courses:alg2013:ch6_slides_b.pdf|slides}}] | ||
- | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 4/30, 5/7a) [{{courses:alg2013:ch7_notes_a.pdf|notes}}, {{courses:alg2013:ch7_slides_a.pdf|slides}}] | + | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 4/30, 5/7, 5/14) [{{courses:alg2013:ch7_notes_a.pdf|notes}}, {{courses:alg2013:ch7_slides_a.pdf|slides}}] |
- | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 5/7b, 5/14) [{{courses:alg2013:ch7_notes_b.pdf|notes}}, {{courses:alg2013:ch7_slides_b.pdf|slides}}] | + | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/21*) [{{courses:alg2013:ch7_notes_b.pdf|notes}}, {{courses:alg2013:ch7_slides_b.pdf|slides}}] |
- | *Dynamic Programming [C: Ch.15] (1 week: 5/21*) [{{courses:alg2013:dynamic_prog_notes.pdf|notes}}, {{courses:alg2013:dynamic_prog_slides.pdf|slides}}] | + | *Dynamic Programming [C: Ch.15] (.5 week: 5/28a) [{{courses:alg2013:dynamic_prog_notes.pdf|notes}}, {{courses:alg2013:dynamic_prog_slides.pdf|slides}}] |
- | *Reduction [M: Ch. 10; C: Ch. 29] (1 week: 5/28) [{{courses:alg2013:ch10_notes.pdf|notes}}, {{courses:alg2013:ch10_slides.pdf|slides}}] | + | *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 5/28b) [{{courses:alg2013:ch10_notes.pdf|notes}}, {{courses:alg2013:ch10_slides.pdf|slides}}] |
*NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/4*, 6/11) [{{courses:alg2013:ch11_notes.pdf|notes}}, {{courses:alg2013:ch11_slides.pdf|slides}}, {{courses:alg2013:ch11_appendix.pdf|An NP-Completeness Proof}}] | *NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/4*, 6/11) [{{courses:alg2013:ch11_notes.pdf|notes}}, {{courses:alg2013:ch11_slides.pdf|slides}}, {{courses:alg2013:ch11_appendix.pdf|An NP-Completeness Proof}}] | ||
* **Final** (**2013/06/18**) | * **Final** (**2013/06/18**) |