- From www.icourse163.org
数据结构
- 10 Sequences
- Introductive Level
- Starts on February 14, 2016
- Ends on April 23, 2016
Course details
Syllabus
Week 0 | Overview
|
Week 1 | Getting Started; Heap
|
Week 2 | Sorting Lower Bound
Basic Data Structures I (List, Queue, Stack)
|
Week 3 | Basic Data Structures II (Tree, Graph)
Graph and Tree Traversals I (BFS, DFS)
|
Week 4 | Graph and Tree Traversals II (Tree Traversals, Expression Tree )
Graph and Tree Traversals III (Topological Sort)
|
Week 5 | Searching Set Data I (Binary Search Tree)
|
Week 6 | Searching Set Data II (AVL Tree)
|
Week 7 | Searching Set Data III (B-Tree)
|
Week 8 | Hashing (Chaining, Open Addressing)
Suffix Tree and Suffix Array
|
Prerequisite
Instructors
- 韩永楷
资讯工程学系副教授 - None
None - z0000b2002
None - None
None - 曾建维
None