User Tools
courses:ds2015:main
Differences
This shows you the differences between two versions of the page.
|
courses:ds2015:main [2015/11/30 15:23] tsay [Syllabus/Schedule (with links to notes/slides)] |
courses:ds2015:main [2016/05/04 11:18] (current) tsay [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| - | * 11/30: slides for Queues (The ADT and Its Uses) available. | + | * 01/31: Grade Report available; contact Yih-Kuen Tsay by 5PM 02/01 if you have any question or request. |
| + | * 01/10: draft versions of solutions to HW#7-9: {{courses:ds2015:DS2015_TA_hw7andhw8.pdf|HW#7 and HW#8}}, {{courses:ds2015:DS2015_TA_hw9.pdf|HW#9}}. | ||
| + | * 01/06: {{courses:ds2015:hw10.pdf|HW#10}} due 01/18. | ||
| + | * 01/04: slides for Graphs available. | ||
| + | * 01/04: slides from TA sessions: {{courses:ds2015:DS2015_TA4.pdf|TA Session #4}}. | ||
| + | * 12/28: slides from TA sessions: {{courses:ds2015:DS2015_TA3.pdf|TA Session #3}}. | ||
| + | * 12/28: slides for Balanced Search Trees available. | ||
| + | * 12/21: {{courses:ds2015:hw9.pdf|HW#9}} due 12/28. | ||
| + | * 12/21: slides for Heaps available. | ||
| + | * 12/14: {{courses:ds2015:hw8.pdf|HW#8}} due 12/21. | ||
| + | * 12/14: slides for Trees (the Implementations part) available. | ||
| + | * 12/07: slides for Trees (the ADT part) available. | ||
| + | * 11/30: {{courses:ds2015:hw7.pdf|HW#7}} due 12/07. | ||
| + | * 11/30: slides for Queues available. | ||
| * 11/23: slides for Algorithms Efficiency and for Sorting available (revised 11/29). | * 11/23: slides for Algorithms Efficiency and for Sorting available (revised 11/29). | ||
| * 11/21: slides for Lists (the ADT part) available. | * 11/21: slides for Lists (the ADT part) available. | ||
| Line 62: | Line 75: | ||
| *Algorithm Efficiency [CH: Ch. 10] (.5 week: 11/23a) [{{courses:ds2015:DS2015_08_AlgorithmEfficiency.pptx|slides}}] | *Algorithm Efficiency [CH: Ch. 10] (.5 week: 11/23a) [{{courses:ds2015:DS2015_08_AlgorithmEfficiency.pptx|slides}}] | ||
| *Sorting and Efficiency [CH: Ch. 11] (.5 week: 11/23b) [{{courses:ds2015:DS2015_09_SortingAndEfficiency.pptx|slides}}] | *Sorting and Efficiency [CH: Ch. 11] (.5 week: 11/23b) [{{courses:ds2015:DS2015_09_SortingAndEfficiency.pptx|slides}}] | ||
| - | *Queues [CH: Ch. 13,14] (1 week: 11/30*) [slides: {{courses:ds2015:DS2015_10a_Queues.pptx|ADT}}{{courses:ds2015:DS2015_10b_QueuesImplementations.pptx|Implementations}}] | + | *Queues [CH: Ch. 13,14] (1 week: 11/30*) [slides: {{courses:ds2015:DS2015_10a_Queues.pptx|ADT}}, {{courses:ds2015:DS2015_10b_QueuesImplementations.pptx|Implementations}}] |
| - | *Trees [CH: Ch. 15,16] (2 weeks: 12/07, 12/14) | + | *Trees [CH: Ch. 15,16] (2 weeks: 12/07, 12/14) [slides: {{courses:ds2015:DS2015_11a_Trees.pptx|ADT}}, {{courses:ds2015:DS2015_11b_TreesImplementations.pptx|Implementations}}] |
| - | *Heaps [CH: Ch. 17] (1 week: 12/21) | + | *Heaps [CH: Ch. 17] (1 week: 12/21) [{{courses:ds2015:DS2015_12_Heaps.pptx|slides}}] |
| - | *Balanced Search Trees [CH: Ch. 19] (1 week: 12/28*) | + | *Balanced Search Trees [CH: Ch. 19] (1 week: 12/28*) [{{courses:ds2015:DS2015_13_BalancedSearchTrees.pptx|slides}}] |
| - | *Graphs [CH: Ch. 20] (1 week: 2016/01/04) | + | *Graphs [CH: Ch. 20] (1 week: 2016/01/04) [{{courses:ds2015:DS2015_15_Graphs.pptx|slides}}] |
| * **Final** (**2016/01/11**) | * **Final** (**2016/01/11**) | ||
| =====References===== | =====References===== | ||
courses/ds2015/main.1448868210.txt.gz · Last modified: 2015/11/30 15:23 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
