資料結構
Data Structures
學期
108-1
學分
3
學分
當期課號
1556
永久課號
DIF1025
開課單位
資訊管理與財務金融系
授課教師
徐熊健
校區
光復
類別
必修
上課時間表
| 節 | 週一 |
|---|---|
5 13:20–14:10 | 資料結構 A305 3 節連堂 |
6 14:20–15:10 | |
7 15:30–16: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) |
| 第 2 週 | Arrays |
| 第 3 週 | Structures and Pointers |
| 第 4 週 | Stacks and Queues I: Definitions and implementations, Mouse-in-a-maze problem |
| 第 5 週 | Stacks and Queues II: Evaluation of expressions |
| 第 6 週 | Linked Lists: Singly linked lists and chains |
| 第 7 週 | Linked Lists: Insertion/deletion/search, Linked stack/queue, Doubly linked lists |
| 第 8 週 | Trees: Representation of trees, Binary trees, Traversal of binary trees |
| 第 9 週 | Trees: Heaps, Binary search trees |
| 第 10 週 | Midterm Exam |
| 第 11 週 | Review, Programming tips and Discussion |
| 第 12 週 | Balanced binary trees: AVL trees |
| 第 13 週 | Graphs I: Depth first search, Breadth first search, Connected components |
| 第 14 週 | Graphs II: Minimum cost spanning trees |
| 第 15 週 | Graphs III: Shortest paths, Transitive Closure, AOV networks |
| 第 16 週 | Sorting I: Insertion/Quick sort, How fast can we sort |
| 第 17 週 | Sorting II: Merge/Heap sort, List/Table sort |
| 第 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
- 地點
- MB312
- 時間
- JK, Monday
- 聯絡方式
- sjshyu@gmail.com