• 数据结构

    随堂模式 计算机学科
    韩永楷
    • 韩永楷副教授 台湾新竹清华大学资讯工程学系
    • $
    • g1917人
    • V2

    简介本课程目标是帮助学生学得下列观念和能力: 1. 各种基本数据结构的认识。2. 透过实作数据结构让同学对所学有更深刻的了解,并加强同学写程式的训练。3. 用数据结构配合基本的演算法来解决问题。4. 本课程将透过OJ (Online Judge) 程式判读功能进行测验。 授课大纲 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  

    章节01 Getting Started 02 Heap 03 Sorting Lower Bound 04 Basic Data Structures I (List, Queue, Stack) 05 Basic Data Structures II (Tree, Graph) 06 Graph and Tree Traversals I (BFS, DFS) 07 Graph and Tree Traversals II (Tree Traversals, Expression Tree) 08 Graph and Tree Traversals III (Topological Sort) 09 Searching Set Data I (Binary Search Tree) 10 Searching Set Data II (AVL Tree) 11 Searching Set Data III (B-Tree) 12 Hashing (Chaining, Open Addressing) 13 Suffix Tree and Suffix Array Homework Exam Sandbox (non-scoring, just for practice)