User Tools
courses:alg2015:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2015:main [2015/04/28 10:31] tsay [Announcements] |
courses:alg2015:main [2019/12/31 12:45] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 07/14: grade report available; please send inquiries, if any, to the instructor by 2PM 07/16. | ||
| + | * 06/18: slides from TA sessions: {{courses:alg2015:hw6slides.pptx|HW#6}}, {{courses:alg2015:hw7slides.pptx|HW#7}}, {{courses:alg2015:hw8slides.pptx|HW#8}}, {{courses:alg2015:hw9slides.pptx|HW#9}}. | ||
| + | * 06/18: the {{courses:alg:old_exams.zip|old_exam}} zip file updated to include the Final of 2014. | ||
| + | * 06/08: notes/slides for NP-Completeness and an appendix available. | ||
| + | * 06/02: {{courses:alg2015:hw10.pdf|HW#10}} due on 06/16. | ||
| + | * 06/01: notes/slides for Dynamic Programming and Reduction available. | ||
| + | * 05/26: {{courses:alg2015:hw9.pdf|HW#9}} due on 06/02. | ||
| + | * 05/26: notes/slides for Advanced Graph Algorithms available. | ||
| + | * 05/18: {{courses:alg2015:alg2015mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/12: {{courses:alg2015:hw8.pdf|HW#8}} due on 05/19. | ||
| + | * 05/05: {{courses:alg2015:hw7.pdf|HW#7}} due on 05/12. | ||
| + | * 05/05: TA session of 5/26 moved one week earlier to 5/19. | ||
| + | * 05/05: notes/slides for Basic Graph Algorithms available. | ||
| * 04/28: notes/slides for String Processing available. | * 04/28: notes/slides for String Processing available. | ||
| - | * 04/18: old exams: {{courses:alg:old_exams.zip|1996-2014}}. | + | * 04/18: {{courses:alg:old_exams.zip|old exams}}. |
| * 04/17: slides from TA sessions: {{courses:alg2015:hw1slides.pptx|HW#1}}, {{courses:alg2015:hw2slides.pptx|HW#2}}, {{courses:alg2015:hw3slides.pptx|HW#3}}, {{courses:alg2015:hw4slides.pptx|HW#4}}. | * 04/17: slides from TA sessions: {{courses:alg2015:hw1slides.pptx|HW#1}}, {{courses:alg2015:hw2slides.pptx|HW#2}}, {{courses:alg2015:hw3slides.pptx|HW#3}}, {{courses:alg2015:hw4slides.pptx|HW#4}}. | ||
| * 04/06: {{courses:alg2015:hw6.pdf|HW#6}} due on 04/21. | * 04/06: {{courses:alg2015:hw6.pdf|HW#6}} due on 04/21. | ||
| Line 21: | Line 34: | ||
| * 02/24: notes/slides for Introduction and for Mathematical Induction available. | * 02/24: notes/slides for Introduction and for Mathematical Induction available. | ||
| * 02/24: this website announced. | * 02/24: this website announced. | ||
| - | |||
| =====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 50: | Line 62: | ||
| book by Cormen //et al.// (Note: a TA session will precede a class meeting | book by Cormen //et al.// (Note: a TA session will precede a class meeting | ||
| whose date is marked with an *. There are four TA sessions on 3/24, 4/14, | whose date is marked with an *. There are four TA sessions on 3/24, 4/14, | ||
| - | 5/26, and 6/9.) | + | 5/19, and 6/9.) |
| *Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/24a) [{{courses:alg2015:ch1_notes.pdf|notes}}, {{courses:alg2015:ch1_slides.pdf|slides}}] | *Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/24a) [{{courses:alg2015:ch1_notes.pdf|notes}}, {{courses:alg2015:ch1_slides.pdf|slides}}] | ||
| *Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 2/24b, 3/3) [{{courses:alg2015:ch2_notes.pdf|notes}}, {{courses:alg2015:ch2_slides.pdf|slides}}, Proving a Loop Invariant ({{courses:alg2015:ch2_appendix.pdf|the gcd example}}, {{courses:alg2015:ch2_appendix_old.pdf|the original example}})] | *Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 2/24b, 3/3) [{{courses:alg2015:ch2_notes.pdf|notes}}, {{courses:alg2015:ch2_slides.pdf|slides}}, Proving a Loop Invariant ({{courses:alg2015:ch2_appendix.pdf|the gcd example}}, {{courses:alg2015:ch2_appendix_old.pdf|the original example}})] | ||
| Line 59: | Line 71: | ||
| * **Midterm** (**2015/04/21**) | * **Midterm** (**2015/04/21**) | ||
| *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/28) [{{courses:alg2015:ch6_notes_b.pdf|notes}}, {{courses:alg2015:ch6_slides_b.pdf|slides}}] | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/28) [{{courses:alg2015:ch6_notes_b.pdf|notes}}, {{courses:alg2015:ch6_slides_b.pdf|slides}}] | ||
| - | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 5/5, 5/12, 5/19) [{{courses:alg2015:ch7_notes_a.pdf|notes}}, {{courses:alg2015:ch7_slides_a.pdf|slides}}] | + | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 5/5, 5/12, 5/19*) [{{courses:alg2015:ch7_notes_a.pdf|notes}}, {{courses:alg2015:ch7_slides_a.pdf|slides}}] |
| - | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/26*) [{{courses:alg2015:ch7_notes_b.pdf|notes}}, {{courses:alg2015:ch7_slides_b.pdf|slides}}] | + | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/26) [{{courses:alg2015:ch7_notes_b.pdf|notes}}, {{courses:alg2015:ch7_slides_b.pdf|slides}}] |
| *Dynamic Programming [C: Ch.15] (.5 week: 6/2a) [{{courses:alg2015:dynamic_prog_notes.pdf|notes}}, {{courses:alg2015:dynamic_prog_slides.pdf|slides}}] | *Dynamic Programming [C: Ch.15] (.5 week: 6/2a) [{{courses:alg2015:dynamic_prog_notes.pdf|notes}}, {{courses:alg2015:dynamic_prog_slides.pdf|slides}}] | ||
| *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 6/2b) [{{courses:alg2015:ch10_notes.pdf|notes}}, {{courses:alg2015:ch10_slides.pdf|slides}}] | *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 6/2b) [{{courses:alg2015:ch10_notes.pdf|notes}}, {{courses:alg2015:ch10_slides.pdf|slides}}] | ||
courses/alg2015/main.1430188302.txt.gz · Last modified: 2015/04/28 10:31 by tsay
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
