資料結構
Data Structures
| 節 | 週一 |
|---|---|
7 15:30–16:20 | 資料結構 M-b10（光復） 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
無備註
https://sites.google.com/view/sjshyudsimf
35% Programming assignments 25% Midterm 25% Final 15% In-class participation
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction (Performance analysis/measures, Programming tool) 9/14 |
| 第 2 週 | Arrays 9/21 |
| 第 3 週 | Structures and Pointers 9/28 |
| 第 4 週 | Stacks and Queues I: Definitions and implementations, Mouse-in-a-maze problem 10/5 |
| 第 5 週 | Stacks and Queues II: Evaluation of expressions 10/12 |
| 第 6 週 | Linked Lists: Singly linked lists and chains 10/19 |
| 第 7 週 | Linked Lists: Insertion/deletion/search, Linked stack/queue, Doubly linked lists 10/26 |
| 第 8 週 | Trees: Representation of trees, Binary trees, Traversal of binary trees 11/2 |
| 第 9 週 | Trees: Heaps, Binary search trees 11/9 |
| 第 10 週 | Midterm Exam 11/16 |
| 第 11 週 | Review, Programming tips and Discussion 11/23 |
| 第 12 週 | Balanced binary trees: AVL trees 11/30 |
| 第 13 週 | Graphs I: Depth first search, Breadth first search, Connected components 12/2 |
| 第 14 週 | Graphs II: Minimum cost spanning trees 12/7 |
| 第 15 週 | Graphs III: Shortest paths, Transitive Closure, AOV networks 12/14 |
| 第 16 週 | Sorting I: Insertion/Quick sort, How fast can we sort 12/21 |
| 第 17 週 | Sorting II: Merge/Heap sort, List/Table sort 12/28 |
| 第 18 週 | Final Exam 1/4 |
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C (2nd Edition), Silicon Press, 2008, NJ.
- 地點
- A103
- 時間
- JK, Monday
- 聯絡方式
- sjshyu@gmail.com