User Tools
courses:alg2018:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2018:main [2018/04/10 11:03] tsay [Announcements] |
courses:alg2018:main [2019/12/31 12:43] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| - | * 04/10: {{courses:alg2018:hw5.pdf|HW#5}} due on 04/17. | + | * 07/08: grade report available; please send inquiries, if any, to the instructor by 2PM 07/09. |
| + | * 06/23: the final exam will be held in Room 101, Management Building 2. | ||
| + | * 06/20: slides from TA sessions: {{courses:alg2018:2018hw6.pptx|HW#6}}, {{courses:alg2018:2018hw7.pptx|HW#7}}, {{courses:alg2018:2018hw8.pptx|HW#8}}, {{courses:alg2018:2018hw9.pptx|HW#9}}. | ||
| + | * 06/05: notes/slides for Reduction and for NP-Completeness available. | ||
| + | * 06/01: {{courses:alg2018:hw10.pdf|HW#10}} due on 06/14; ACM ICPC 2018 World Finals {{courses:alg2018:2018WorldFinalsProblemA.pdf|Problem A}} and {{courses:alg2018:2018WorldFinalsProblemK.pdf|Problem K}}. | ||
| + | * 05/29: notes/slides for Dynamic Programming available. | ||
| + | * 05/22: {{courses:alg2018:hw9.pdf|HW#9}} due on 05/29. | ||
| + | * 05/15: notes/slides for Advanced Graph Algorithms available. | ||
| + | * 05/15: {{courses:alg2018:hw8.pdf|HW#8}} due on 05/22. | ||
| + | * 05/15: {{courses:alg2018:alg2018mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/08: {{courses:alg2018:hw7.pdf|HW#7}} due on 05/15. | ||
| + | * 05/01: notes/slides for Basic Graph Algorithms available. | ||
| + | * 04/19: slides from TA sessions: {{courses:alg2018:2018hw1.pptx|HW#1}}, {{courses:alg2018:2018hw2.pptx|HW#2}}, {{courses:alg2018:2018hw3.pptx|HW#3}}, {{courses:alg2018:2018hw4.pptx|HW#4}}. | ||
| + | * 04/17: {{courses:alg:old_exams.zip|old exams}}. | ||
| + | * 04/17: {{courses:alg2018:hw6.pdf|HW#6}} due on 05/01. | ||
| + | * 04/17: notes/slides for String Processing available. | ||
| + | * 04/10: {{courses:alg2018:hw5.pdf|HW#5}} due on <del>04/17</del> 05/01. | ||
| * 03/27: notes/slides for Searching and Sorting available. | * 03/27: notes/slides for Searching and Sorting available. | ||
| * 03/27: {{courses:alg2018:hw4.pdf|HW#4}} due on 04/10. | * 03/27: {{courses:alg2018:hw4.pdf|HW#4}} due on 04/10. | ||
| Line 18: | Line 34: | ||
| * 02/27: notes/slides for Introduction and for Mathematical Induction available. | * 02/27: notes/slides for Introduction and for Mathematical Induction available. | ||
| * 02/25: this website announced. | * 02/25: 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 54: | Line 69: | ||
| *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/27a*) [{{courses:alg2018:ch4_notes.pdf|notes}}, {{courses:alg2018:ch4_slides.pdf|slides}}, {{courses:alg2018:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/27a*) [{{courses:alg2018:ch4_notes.pdf|notes}}, {{courses:alg2018:ch4_slides.pdf|slides}}, {{courses:alg2018:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | ||
| *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 3/27b, 4/10) [{{courses:alg2018:ch6_notes_a.pdf|notes}}, {{courses:alg2018:ch6_slides_a.pdf|slides}}, {{courses:alg2018:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2018:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 3/27b, 4/10) [{{courses:alg2018:ch6_notes_a.pdf|notes}}, {{courses:alg2018:ch6_slides_a.pdf|slides}}, {{courses:alg2018:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2018:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | ||
| - | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/17) [{{courses:alg2018:ch6_notes_b.pdf|notes}}, {{courses:alg2018:ch6_slides_b.pdf|slides}}, {{courses:alg2018:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] | + | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/17*) [{{courses:alg2018:ch6_notes_b.pdf|notes}}, {{courses:alg2018:ch6_slides_b.pdf|slides}}, {{courses:alg2018:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] |
| * **Midterm** (**2018/04/24**) | * **Midterm** (**2018/04/24**) | ||
| *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/1, 5/8) [{{courses:alg2018:ch7_notes_a.pdf|notes}}, {{courses:alg2018:ch7_slides_a.pdf|slides}}, {{courses:alg2018:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2018:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/1, 5/8) [{{courses:alg2018:ch7_notes_a.pdf|notes}}, {{courses:alg2018:ch7_slides_a.pdf|slides}}, {{courses:alg2018:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2018:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | ||
courses/alg2018/main.1523329388.txt.gz · Last modified: 2018/04/10 11:03 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
