User Tools
courses:alg2021:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2021:main [2021/08/11 23:09] tsay2 [Syllabus/Schedule (with links to notes/slides)] |
courses:alg2021:main [2022/02/07 11:41] (current) tsay2 [Algorithms, Fall 2021] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| 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===== | + | * 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. | ||
| + | * 12/21: notes/slides for Dynamic Programming available. | ||
| + | * 12/07: notes/slides for Advanced Graph Algorithms available. | ||
| + | * 11/29: {{courses:alg2021:alg2021mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 11/23: notes/slides for Basic Graph Algorithms available. | ||
| + | * 11/09: notes/slides for String Processing available. | ||
| + | * 11/02: {{courses:alg:old_exams.zip|old exams}}. | ||
| + | * 10/26: notes/slides for Searching and Sorting available. | ||
| + | * 10/26: notes/slides for A Supplement to Data Structures available. | ||
| + | * 10/19: notes/slides for Design by Induction available. | ||
| + | * 10/12: notes/slides for Analysis of Algorithms available. | ||
| + | * 09/28: notes/slides for Introduction and for Mathematical Induction available. | ||
| + | * 09/28: this website created to complement the NTU COOL site for this course. | ||
| =====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 39: | Line 53: | ||
| *Design by Induction [M: Ch. 5] (1 week: 10/19) [{{courses:alg2021:ch5_notes.pdf|notes}}, {{courses:alg2021:ch5_slides.pdf|slides}}] | *Design by Induction [M: Ch. 5] (1 week: 10/19) [{{courses:alg2021:ch5_notes.pdf|notes}}, {{courses:alg2021:ch5_slides.pdf|slides}}] | ||
| *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 10/26a*) [{{courses:alg2021:ch4_notes.pdf|notes}}, {{courses:alg2021:ch4_slides.pdf|slides}}, {{courses:alg2021:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 10/26a*) [{{courses:alg2021:ch4_notes.pdf|notes}}, {{courses:alg2021:ch4_slides.pdf|slides}}, {{courses:alg2021:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | ||
| - | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 10/26b, 11/02) [{{courses:alg2021:ch6_notes_a.pdf|notes}}, {{courses:alg202q:ch6_slides_a.pdf|slides}}, {{courses:alg2021:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2021:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | + | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 10/26b, 11/02) [{{courses:alg2021:ch6_notes_a.pdf|notes}}, {{courses:alg2021:ch6_slides_a.pdf|slides}}, {{courses:alg2021:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2021:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] |
| *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 11/09*) [{{courses:alg2021:ch6_notes_b.pdf|notes}}, {{courses:alg2021:ch6_slides_b.pdf|slides}}, {{courses:alg2021:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 11/09*) [{{courses:alg2021:ch6_notes_b.pdf|notes}}, {{courses:alg2021:ch6_slides_b.pdf|slides}}, {{courses:alg2021:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] | ||
| * **Midterm** (**2021/11/16**) | * **Midterm** (**2021/11/16**) | ||
| Line 45: | 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}}] | *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}}] | *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:ch11a_notes.pdf|notes}}, {{courses:alg2021:ch11a_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**) | * **Final** (**2022/01/11**) | ||
| - | *More about NP-Completeness [M: Ch. 11; C: Ch. 34] (1 week: 01/18) [{{courses:alg2021:ch11b_notes.pdf|notes}}, {{courses:alg2021:ch11b_slides.pdf|slides}}] | + | *NP-Completeness Continued [M: Ch. 11; C: Ch. 34] (1 week: 01/18) |
| *Wrap-Up Discussions (1 week: 01/25) | *Wrap-Up Discussions (1 week: 01/25) | ||
| =====References===== | =====References===== | ||
courses/alg2021/main.1628694547.txt.gz · Last modified: 2021/08/11 23:09 by tsay2
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
