This shows you the differences between two versions of the page.
courses:alg2016:main [2016/04/11 21:39] tsay [Syllabus/Schedule (with links to notes/slides)] |
courses:alg2016:main [2019/12/31 12:44] (current) tsay2 [Announcements] |
||
---|---|---|---|
Line 5: | Line 5: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 07/11: grade report available; please send inquiries, if any, to the instructor by 2PM 07/12. | ||
+ | * 06/18: slides from TA sessions: {{courses:alg2016:hw1-2slides.pptx|HW#1-2}}, {{courses:alg2016:hw4slides.pptx|HW#4}}, {{courses:alg2016:hw6slides.pptx|HW#6}}, {{courses:alg2016:hw7slides.pptx|HW#7}}, {{courses:alg2016:hw8slides.pptx|HW#8}}, {{courses:alg2016:hw9slides.pptx|HW#9}}. | ||
+ | * 06/06: notes/slides for NP-Completeness and an appendix available. | ||
+ | * 05/31: {{courses:alg2016:hw10.pdf|HW#10}} (revised as discussed in class) due on 06/14. | ||
+ | * 05/31: notes/slides for Reduction available. | ||
+ | * 05/24: {{courses:alg2016:hw9.pdf|HW#9}} due on 05/31. | ||
+ | * 05/24: notes/slides for Dynamic Programming available. | ||
+ | * 05/17: {{courses:alg2016:hw8.pdf|HW#8}} due on 05/24. | ||
+ | * 05/17: notes/slides for Advanced Graph Algorithms available. | ||
+ | * 05/10: {{courses:alg2016:alg2016mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
+ | * 05/03: notes/slides for Basic Graph Algorithms available. | ||
+ | * 04/27: change of schedule: TA session on 5/3 moved to 5/10. | ||
+ | * 04/26: {{courses:alg2016:hw7.pdf|HW#7}} due on 05/10. | ||
+ | * 04/25: notes/slides for String Processing available. | ||
+ | * 04/11: {{courses:alg2016:hw6.pdf|HW#6}} due on 04/26. | ||
+ | * 04/11: {{courses:alg:old_exams.zip|old exams}}. | ||
* 04/05: {{courses:alg2016:hw5.pdf|HW#5}} due on 04/14. | * 04/05: {{courses:alg2016:hw5.pdf|HW#5}} due on 04/14. | ||
* 03/29: notes/slides for Searching and Sorting available. | * 03/29: notes/slides for Searching and Sorting available. | ||
Line 18: | Line 34: | ||
* 02/23: notes/slides for Introduction and for Mathematical Induction available. | * 02/23: notes/slides for Introduction and for Mathematical Induction available. | ||
* 02/17: this website announced. | * 02/17: 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 47: | 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/15, 3/29, | whose date is marked with an *. There are four TA sessions on 3/15, 3/29, | ||
- | 5/3, and 6/7.) | + | 5/10, and 6/7.) |
*Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/23a) [{{courses:alg2016:ch1_notes.pdf|notes}}, {{courses:alg2016:ch1_slides.pdf|slides}}] | *Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/23a) [{{courses:alg2016:ch1_notes.pdf|notes}}, {{courses:alg2016:ch1_slides.pdf|slides}}] | ||
*Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 2/23b, 3/1) [{{courses:alg2016:ch2_notes.pdf|notes}}, {{courses:alg2016:ch2_slides.pdf|slides}}, Proving a Loop Invariant ({{courses:alg2016:ch2_appendix.pdf|the gcd example}}, {{courses:alg2016:ch2_appendix_old.pdf|the original example}})] | *Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 2/23b, 3/1) [{{courses:alg2016:ch2_notes.pdf|notes}}, {{courses:alg2016:ch2_slides.pdf|slides}}, Proving a Loop Invariant ({{courses:alg2016:ch2_appendix.pdf|the gcd example}}, {{courses:alg2016:ch2_appendix_old.pdf|the original example}})] | ||
Line 55: | Line 70: | ||
*Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (2 weeks: 3/29*, 4/12) [{{courses:alg2016:ch6_notes_a.pdf|notes}}, {{courses:alg2016:ch6_slides_a.pdf|slides}}, {{courses:alg2016:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2016:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (2 weeks: 3/29*, 4/12) [{{courses:alg2016:ch6_notes_a.pdf|notes}}, {{courses:alg2016:ch6_slides_a.pdf|slides}}, {{courses:alg2016:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2016:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | ||
* **Midterm** (**2016/04/19**) | * **Midterm** (**2016/04/19**) | ||
- | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/26) [{{courses:alg2016:ch6_notes_b.pdf|notes}}, {{courses:alg2016:ch6_slides_b.pdf|slides}}] | + | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/26) [{{courses:alg2016:ch6_notes_b.pdf|notes}}, {{courses:alg2016:ch6_slides_b.pdf|slides}}, {{courses:alg2016:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] |
- | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/3*, 5/10) [{{courses:alg2016:ch7_notes_a.pdf|notes}}, {{courses:alg2016:ch7_slides_a.pdf|slides}}] | + | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/3, 5/10*) [{{courses:alg2016:ch7_notes_a.pdf|notes}}, {{courses:alg2016:ch7_slides_a.pdf|slides}}, {{courses:alg2016:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2016:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] |
*Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/17) [{{courses:alg2016:ch7_notes_b.pdf|notes}}, {{courses:alg2016:ch7_slides_b.pdf|slides}}] | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/17) [{{courses:alg2016:ch7_notes_b.pdf|notes}}, {{courses:alg2016:ch7_slides_b.pdf|slides}}] | ||
*Dynamic Programming [C: Ch.15] (1 week: 5/24) [{{courses:alg2016:dynamic_prog_notes.pdf|notes}}, {{courses:alg2016:dynamic_prog_slides.pdf|slides}}] | *Dynamic Programming [C: Ch.15] (1 week: 5/24) [{{courses:alg2016:dynamic_prog_notes.pdf|notes}}, {{courses:alg2016:dynamic_prog_slides.pdf|slides}}] |