資料結構
Data Structures
學期
106-1
學分
3
學分
當期課號
1509
永久課號
DIF1025
開課單位
資訊管理與財務金融系
授課教師
徐熊健
校區
光復
類別
必修
上課時間表
| 節 | 週一 |
|---|---|
7 15:30–16:20 | 資料結構 MB210 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: 25% Final Exam: 25% Ongoing and Assignments (8-12 programming H/Ws included): 50%
週次計畫
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction (Performance analysis / measures) |
| 第 2 週 | Array 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, Doubly linked lists |
| 第 7 週 | Trees: Representation of trees, Binary trees, Traversal of binary trees |
| 第 8 週 | Trees: Heaps, Binary search trees |
| 第 9 週 | Midterm Exam |
| 第 10 週 | AVL trees: Rotations in insertion/deletion |
| 第 11 週 | Graphs: Depth first search, Breadth first search, Connected components |
| 第 12 週 | Graphs: Minimum cost spanning trees |
| 第 13 週 | Graphs: Shortest paths, Transitive Closure, AOV networks |
| 第 14 週 | Sorting: Insertion/Quick sort, How fast can we sort |
| 第 15 週 | Sorting: Merge/Heap sort, List/Table sort |
| 第 16 週 | Hashing |
| 第 17 週 | Priority Queues |
| 第 18 週 | Final Exam |
教科書
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C (2nd Edition), Silicon Press, 2008, NJ.
Office Hours
- 地點
- 管理一館(M-b01)
- 時間
- 星期一 EF
- 聯絡方式
- sjshyu@gmail.com, sjshyu@g2.nctu.edu.tw