通過條件
成 績 :60 分
-
課前介紹
-
本學期課程安排表
-
本學期課程活動
-
本學期評分標準
-
Basic Concepts Part(1/3)
-
Basic Concepts Part(2/3)
-
Basic Concepts Part(3/3)
-
Bacsic Concepts 講義
-
CHAPT1測驗題目及詳解表
-
Arrays (Part1/2)
-
Arrays (Part2/2)
-
Arrays 講義
-
CHAPT2測驗題目及詳解表
-
Stacks and queues Part(1/2)
-
Stacks and queues Part(2/2)
-
Stacks and queues 講義
-
CHAPT3測驗題目及詳解表
-
Linked Lists part(1/4)
-
Linked Lists part(2/4)
-
Linked Lists part(3/4)
-
Linked Lists part(4/4)
-
Linked Lists 講義
-
CHAPT4測驗題目及詳解表
-
Trees and Binary Trees part(1/3)
-
Trees and Binary Trees part(2/3)
-
Trees and Binary Trees part(3/3)
-
Trees and Binary Trees 講義
-
CHAPT5測驗題目及詳解表
-
Graphs
-
Adjacency Matrix
-
Adjacency List
-
Traversal (DFS and BFS)
-
Index table
-
Spanning Tree
-
Kruskal's algorithm
-
Kruskal's algorithm(analysis)
-
Prim's algorithm
-
Sollin's algorithm
-
Dijsktra's algorithm
-
Aov network
-
Graphs~Aov Network 講義
-
Search
-
Sort
-
Insertion Sorting
-
Selection Sorting
-
Bubble Sorting
-
Quick Sorting
-
Quick Sorting Analysis
-
Quick Sorting Time complexity analysis
-
Merge and Heap Sorting
-
Search~Merge and Heap Sorting 講義
-
Hashing
-
Hashing 講義
-
CHAPT8測驗題目及詳解表
-
Min Max Heap
-
Min Max Heap Insert
-
Min Max Heap Delete
-
Deap
-
Deap Insert
-
Deap Delete
-
Deap Delete example and summary
-
Extended Binary Tree
-
AVL Tree and M-way Search Tree Insert
-
Weighted External Path Length
-
Min Max Heap~Weighted External Path Length 講義
-
CHAPT9測驗題目及詳解表
-
程式作業題目一.pdf
-
103學年度資料結構第一次小考試題
- 課程介紹
- 課程安排
- 評論