暂无课程咨询信息 [发表课程咨询]
数据结构 台湾新竹“清华大学”
- 内容简介:
-
本课程目标是帮助学生学得下列观念和能力：
1. 各种基本数据结构的认识。2. 透过实作数据结构让同学对所学有更深刻的了解，并加强同学写程式的训练。3. 用数据结构配合基本的演算法来解决问题。4. 本课程将透过OJ (Online Judge) 程式判读功能进行测验。
- 价格:
- 免费
课程介绍
| 01 Getting Started | Sorting的方法&分析 | Insertion Sort上機 |
| 01 Getting Started | Sorting的分析 | Sorting的分析 |
| 01 Getting Started | Growth of Function | Growth of Function |
| 01 Getting Started | Insertion Sort上機 | Insertion Sort上機 |
| 02 Heap | Heap-1 | Heap-1 |
| 02 Heap | Heap-2 | Heap-2 |
| 04 Basic Data Structures I (List, Queue, Stack) | Pointers in C | Pointers in C |
| 04 Basic Data Structures I (List, Queue, Stack) | Basic Data StructureⅠ- 1 | Basic Data StructureⅠ- 1 |
| 04 Basic Data Structures I (List, Queue, Stack) | Basic Data StructureⅠ- 2 | Basic Data StructureⅠ- 2 |
| 04 Basic Data Structures I (List, Queue, Stack) | Josephus上機 | Josephus上機 |
| 04 Basic Data Structures I (List, Queue, Stack) | Balanced括號上機 | Balanced括號上機 |
| 04 Basic Data Structures I (List, Queue, Stack) | List上機_insert | List上機_insert |
| 04 Basic Data Structures I (List, Queue, Stack) | List上機_delete | List上機_delete |
| 03 Sorting Lower Bound | Lower Bound on Comparison Sorts- 1 | Lower Bound on Comparison Sorts- 1 |
| 03 Sorting Lower Bound | Lower Bound on Comparison Sorts- 2 | Lower Bound on Comparison Sorts- 2 |
| 06 Graph and Tree Traversals I (BFS, DFS) | Breadth First Search | Breadth First Search |
| 06 Graph and Tree Traversals I (BFS, DFS) | Depth First Search | Depth First Search |
| 06 Graph and Tree Traversals I (BFS, DFS) | Depth First Search分析 | Depth First Search分析 |
| 05 Basic Data Structures II (Tree, Graph) | Tree and Graph | Tree and Graph |
| 07 Graph and Tree Traversals II (Tree Traversals, Expression Tree) | Tree Traversal | Tree Traversal |
| 07 Graph and Tree Traversals II (Tree Traversals, Expression Tree) | Expreesion Tree&Postfix Notation of an Expression | Expreesion Tree&Postfix Notation of an Expression |
| 07 Graph and Tree Traversals II (Tree Traversals, Expression Tree) | Infix-Postfix Coversion | Infix-Postfix Coversion |
| 08 Graph and Tree Traversals III (Topological Sort) | Topological Sort | Topological Sort |
| 08 Graph and Tree Traversals III (Topological Sort) | Topological 證明 | Topological 證明 |
| 08 Graph and Tree Traversals III (Topological Sort) | Two IQ questions | Two IQ questions |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree | Binary Search Tree |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree 實作 (Min/Max) | Binary Search Tree 實作 (Min/Max) |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree 實作 (Search Predecessor) | Binary Search Tree 實作 (Search Predecessor) |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree 實作 (Insert/Delete) | Binary Search Tree 實作 (Insert/Delete) |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree 實作 (Delete)- Case 1&2 | Binary Search Tree 實作 (Delete)- Case 1&2 |
| 09 Searching Set Data I (Binary Search Tree) | Binary Search Tree 實作 (Delete)- Case 3 | Binary Search Tree 實作 (Delete)- Case 3 |
| 09 Searching Set Data I (Binary Search Tree) | BST上機_insert | BST上機_insert |
| 09 Searching Set Data I (Binary Search Tree) | BST上機_delete_1 | BST上機_delete_1 |
| 09 Searching Set Data I (Binary Search Tree) | BST上機_delete_2 | BST上機_delete_2 |
| 09 Searching Set Data I (Binary Search Tree) | BST上機_3 | BST上機_3 |
| 10 Searching Set Data II (AVL Tree) | AVL Tree | AVL Tree |
| 10 Searching Set Data II (AVL Tree) | AVL Tree- Rotation | AVL Tree- Rotation |
| 10 Searching Set Data II (AVL Tree) | AVL Tree- Insertion的情形 | AVL Tree- Insertion的情形 |
| 10 Searching Set Data II (AVL Tree) | AVL Tree- Insertion實作Case2.2 | AVL Tree- Insertion實作Case2.2 |
| 10 Searching Set Data II (AVL Tree) | AVL Tree- Insertion實作Case2.3 | AVL Tree- Insertion實作Case2.3 |
| 10 Searching Set Data II (AVL Tree) | AVL Tree Insert 補充& Delete | AVL Tree Insert 補充& Delete |
| 10 Searching Set Data II (AVL Tree) | Augmenting Data Structure | Augmenting Data Structure |
| 11 Searching Set Data III (B-Tree) | B-tree EM Model | B-tree EM Model |
| 11 Searching Set Data III (B-Tree) | B-tree insert | B-tree insert |
| 11 Searching Set Data III (B-Tree) | B-tree delete | B-tree delete |
| 12 Hashing (Chaining, Open Addressing) | Hashing | Hashing |
| 12 Hashing (Chaining, Open Addressing) | Common Hash Function | Common Hash Function |
| 13 Suffix Tree and Suffix Array | Indexing Strings& Suffix Array | Indexing Strings& Suffix Array |
课程参数
课程评论
暂无课程评论信息 [发表课程评论]
课程咨询