User Tools
courses:alg2017:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2017:main [2017/03/31 23:36] tsay [Announcements] |
courses:alg2017:main [2019/12/31 12:44] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 07/01: grade report available; please send inquiries, if any, to the instructor by 2PM 07/03. | ||
| + | * 06/18: slides from TA sessions: {{courses:alg2017:hw6slides.pptx|HW#6}}, {{courses:alg2017:hw7slides.pptx|HW#7}}, {{courses:alg2017:hw8slides.pptx|HW#8}}, {{courses:alg2017:hw9slides.pptx|HW#9}}. | ||
| + | * 06/06: notes/slides for NP-Completeness and an appendix available. | ||
| + | * 06/05: {{courses:alg2017:hw10.pdf|HW#10}} due on 06/15; ACM ICPC 2016 World Finals {{courses:alg2017:2016WorldFinalsProblemB.pdf|Problem B}} and {{courses:alg2017:2016WorldFinalsProblemK.pdf|Problem K}}. | ||
| + | * 05/23: notes/slides for Dynamic Programming and for Reduction available. | ||
| + | * 05/16: {{courses:alg2017:hw9.pdf|HW#9}} due on 05/23. | ||
| + | * 05/16: notes/slides for Advanced Graph Algorithms available. | ||
| + | * 05/09: {{courses:alg2017:hw8.pdf|HW#8}} due on 05/16. | ||
| + | * 05/08: {{courses:alg2017:alg2017mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/02: notes/slides for Basic Graph Algorithms available. | ||
| + | * 05/02: {{courses:alg2017:hw7.pdf|HW#7}} due on 05/09. | ||
| + | * 04/20: slides from TA sessions: {{courses:alg2017:hw1slides.pptx|HW#1}}, {{courses:alg2017:hw2slides.pptx|HW#2}}, {{courses:alg2017:hw3slides.pptx|HW#3}}, {{courses:alg2017:hw4slides.pptx|HW#4}}. | ||
| + | * 04/18: {{courses:alg:old_exams.zip|old exams}}. | ||
| + | * 04/11: {{courses:alg2017:hw6.pdf|HW#6}} due on 04/25. | ||
| + | * 04/11: notes/slides for String Processing available. | ||
| * 03/31: {{courses:alg2017:hw5.pdf|HW#5}} due on 04/11; ACM ICPC 2016 World Finals {{courses:alg2017:2016WorldFinalsProblemC.pdf|Problem C}} and {{courses:alg2017:2016WorldFinalsProblemL.pdf|Problem L}}. | * 03/31: {{courses:alg2017:hw5.pdf|HW#5}} due on 04/11; ACM ICPC 2016 World Finals {{courses:alg2017:2016WorldFinalsProblemC.pdf|Problem C}} and {{courses:alg2017:2016WorldFinalsProblemL.pdf|Problem L}}. | ||
| * 03/28: notes/slides for Searching and Sorting available. | * 03/28: notes/slides for Searching and Sorting available. | ||
| Line 52: | Line 67: | ||
| *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/21b) [{{courses:alg2017:ch4_notes.pdf|notes}}, {{courses:alg2017:ch4_slides.pdf|slides}}, {{courses:alg2017:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/21b) [{{courses:alg2017:ch4_notes.pdf|notes}}, {{courses:alg2017:ch4_slides.pdf|slides}}, {{courses:alg2017:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}] | ||
| *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (2 weeks: 3/28, 4/11*) [{{courses:alg2017:ch6_notes_a.pdf|notes}}, {{courses:alg2017:ch6_slides_a.pdf|slides}}, {{courses:alg2017:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2017:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | *Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (2 weeks: 3/28, 4/11*) [{{courses:alg2017:ch6_notes_a.pdf|notes}}, {{courses:alg2017:ch6_slides_a.pdf|slides}}, {{courses:alg2017:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2017:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}] | ||
| - | * **Midterm** (**2017/04/18**) | + | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/18) [{{courses:alg2017:ch6_notes_b.pdf|notes}}, {{courses:alg2017:ch6_slides_b.pdf|slides}}, {{courses:alg2017:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] |
| - | *String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/25) [{{courses:alg2017:ch6_notes_b.pdf|notes}}, {{courses:alg2017:ch6_slides_b.pdf|slides}}, {{courses:alg2017:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}] | + | * **Midterm** (**2017/04/25**) |
| *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/2, 5/9*) [{{courses:alg2017:ch7_notes_a.pdf|notes}}, {{courses:alg2017:ch7_slides_a.pdf|slides}}, {{courses:alg2017:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2017:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | *Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (2 weeks: 5/2, 5/9*) [{{courses:alg2017:ch7_notes_a.pdf|notes}}, {{courses:alg2017:ch7_slides_a.pdf|slides}}, {{courses:alg2017:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2017:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}] | ||
| *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/16) [{{courses:alg2017:ch7_notes_b.pdf|notes}}, {{courses:alg2017:ch7_slides_b.pdf|slides}}] | *Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/16) [{{courses:alg2017:ch7_notes_b.pdf|notes}}, {{courses:alg2017:ch7_slides_b.pdf|slides}}] | ||
courses/alg2017/main.1490974609.txt.gz · Last modified: 2017/03/31 23:36 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
