詳細課綱請以此為主，網址：https://class-qry.acad.ncku.edu.tw/crm/course_map/course.php?dept=P7&cono=P76A000

介紹實務上常見之資料結構，包含advanced lists, self-balanced trees, digital search trees, sets/disjoint sets, and geographical data structures。 同時，課程亦包含部分資料結構的應用與演算法的配搭。

教學目標

To learn the knowledge some practical data structures.

To learn how the data structures work for algorithm designs and application.

To exercise the data structures in C.

To present state-of-the-art data structures.

課程大綱

Week1:Introductions of this course

Week2:Advanced lists (skip list)

Week3:Self-balanced trees (AVL)

Week4:Self-balanced trees (Binominal)

Week5:Self-balanced trees (red-black)

Week6:Self-balanced trees (B+ and its applications)

Week7:Disjoint sets (F-heap and its applications)

Week8:Disjoint sets (DEAP and its applications)

Week9:Digital search trees (trie)

Week10:Digital search trees (PATRICIA)

Week11:Sets (hash table and Bloom filters)

Week12:Geographical trees (rectangle)

Week13:Selected papers presentation & programming homework assignments (due)

Week14:Selected papers presentation & programming homework assignments (due)

Week15:Selected papers presentation & programming homework assignments (due)

Week16:Selected papers presentation & programming homework assignments (due)

Week17:Selected papers presentation & programming homework assignments (due)

Week18:Paper test