資料結構
Data Structures
| 節 | 週一 |
|---|---|
7 15:30–16:20 | 資料結構 M102（光復） 3 節連堂 |
8 16:30–17:20 | |
9 17:30–18:20 |
* 根據陽明交大上課時間表所列
This course is aimed at preparing the students with basic computing theory, representation schemes and solution methods through programming practice and implementation.
Basic Computer Programming Skills
無備註
教師未提供此項資料
Midterm Exam: 30% Final Exam: 30% Ongoing and Assignments (6 programming H/Ws included): 40%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction (Performance analysis/measures) |
| 第 2 週 | Arrays and Structures |
| 第 3 週 | Stacks and Queues: Definitions and implementations, Mouse-in-a-maze problem |
| 第 4 週 | Stacks and Queues: Evaluation of expressions |
| 第 5 週 | Linked Lists: Singly linked lists and chains |
| 第 6 週 | Linked Lists: Insertion/deletion/search |
| 第 7 週 | Trees: Representation of trees, Binary trees, Traversal of binary trees |
| 第 8 週 | Trees: Binary search trees |
| 第 9 週 | Midterm Exam |
| 第 10 週 | Trees: Heaps |
| 第 11 週 | Graphs: Depth first search, Breadth first search |
| 第 12 週 | Graphs: Minimum cost spanning trees |
| 第 13 週 | Graphs: Minimum cost spanning trees, Shortest paths |
| 第 14 週 | Graphs: Transitive Closure, AOV networks |
| 第 15 週 | Sorting: Insertion/Quick sort |
| 第 16 週 | Sorting: Merge/Heap sort |
| 第 17 週 | Sorting: Performance analysis/evaluation of sorting algorithms |
| 第 18 週 | Final Exam |
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C (2nd Edition), Silicon Press, 2008, NJ
- 地點
- 管理二館MB310
- 時間
- 星期一EF
- 聯絡方式
- yttsai@gmail.com