User Tools
courses:ds2017:main
Differences
This shows you the differences between two versions of the page.
|
courses:ds2017:main [2017/10/23 11:12] tsay [Announcements] |
courses:ds2017:main [2018/03/19 11:06] (current) tsay [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 01/22: Grade Report available; contact Yih-Kuen Tsay by 5PM 01/23 if you have any question or request. | ||
| + | * 01/03: {{courses:ds2017:ds2017_hw9s.pptx|Suggested solutions for HW#9}} avilable. | ||
| + | * 01/03: slides from TA sessions: {{courses:ds2017:DS2017_TA4.pptx|TA Session #4}}. | ||
| + | * 12/18: slides for Graphs available. | ||
| + | * 12/18: {{courses:ds2017:hw10.pdf|HW#10}} due 2018/01/02. | ||
| + | * 12/11: {{courses:ds2017:hw9.pdf|HW#9}} due 12/25. | ||
| + | * 12/11: slides for Balanced Search Trees available. | ||
| + | * 12/04: slides for Dictionaries and for Hashing available. | ||
| + | * 11/27: {{courses:ds2017:hw8.pdf|HW#8}} due 12/04. | ||
| + | * 11/20: slides from TA sessions: {{courses:ds2017:DS2017_TA3.pptx|TA Session #3}}. | ||
| + | * 11/20: slides for Heaps available. | ||
| + | * 11/20: {{courses:ds2017:ds2017mid_s.pdf|Suggested solutions for midterm problems}} avilable. | ||
| + | * 11/13: {{courses:ds2017:hw7.pdf|HW#7}} due 11/20. | ||
| + | * 11/13: slides for Trees (Terminology and ADTs) and for Tree Implementations available. | ||
| + | * 10/30: slides from TA sessions: {{courses:ds2017:DS2017_TA1.pptx|TA Session #1}}, {{courses:ds2017:DS2017_TA2.pptx|TA Session #2}}. | ||
| + | * 10/30: {{courses:ds2017:hw6.pdf|HW#6}} due 11/13. | ||
| + | * 10/30: slides for Queues available. | ||
| * 10/23: {{courses:ds2017:old_exams.zip|old exams}}. | * 10/23: {{courses:ds2017:old_exams.zip|old exams}}. | ||
| * 10/23: slides for Algorithm Efficiency and for Sorting available. | * 10/23: slides for Algorithm Efficiency and for Sorting available. | ||
| Line 58: | Line 75: | ||
| *Trees [CH: Ch. 15,16] (2 weeks: 11/13, 11/20*) [slides: {{courses:ds2017:DS2017_11a_Trees.pptx|ADT}}, {{courses:ds2017:DS2017_11b_TreesImplementations.pptx|Implementations}}] | *Trees [CH: Ch. 15,16] (2 weeks: 11/13, 11/20*) [slides: {{courses:ds2017:DS2017_11a_Trees.pptx|ADT}}, {{courses:ds2017:DS2017_11b_TreesImplementations.pptx|Implementations}}] | ||
| *Heaps [CH: Ch. 17] (1 week: 11/27) [{{courses:ds2017:DS2017_12_Heaps.pptx|slides}}] | *Heaps [CH: Ch. 17] (1 week: 11/27) [{{courses:ds2017:DS2017_12_Heaps.pptx|slides}}] | ||
| - | *Hashing [CH: Ch. 18] (1 week: 12/04) [{{courses:ds2017:DS2017_13_Hashing.pptx|slides}}] | + | *Dictionaries [CH: Ch. 18] (.5 week: 12/04a) [{{courses:ds2017:DS2017_13_Dictionaries.pptx|slides}}] |
| - | *Balanced Search Trees [CH: Ch. 19] (1.5 weeks: 12/11, 12/18a*) [{{courses:ds2016:DS2017_14_BalancedSearchTrees.pptx|slides}}] | + | *Hashing [CH: Ch. 18] (.5 week: 12/04b) [{{courses:ds2017:DS2017_14_Hashing.pptx|slides}}] |
| - | *Graphs [CH: Ch. 20] (1.5 weeks: 12/18b, 12/25) [{{courses:ds2017:DS2017_15_Graphs.pptx|slides}}] | + | *Balanced Search Trees [CH: Ch. 19] (1.5 weeks: 12/11, 12/18a*) [{{courses:ds2017:DS2017_15_BalancedSearchTrees.pptx|slides}}] |
| + | *Graphs [CH: Ch. 20] (1.5 weeks: 12/18b, 12/25) [{{courses:ds2017:DS2017_16_Graphs.pptx|slides}}] | ||
| * **Final** (**2018/01/08**) | * **Final** (**2018/01/08**) | ||
| =====References===== | =====References===== | ||
courses/ds2017/main.1508728338.txt.gz · Last modified: 2017/10/23 11:12 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
