資料結構
Data Structures
| 節 | 週一 |
|---|---|
A 18:30–19:20 | 資料結構 AB101（光復） 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21: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 FB: ds110_imf_nycu
35% Programming assignments 25% Midterm 25% Final 15% In-class participation
Introduction
- 講授：
- 3
Arrays
Arrays, Memory allocations, 1D, 2D, 3D arrays, Structures and Pointers
- 講授：
- 6
Programming tool introduction
- 示範：
- 3
Stack
Definition, behavior, implementations and applications of Stacks
- 講授：
- 3
Queue
Definition, behavior, implementations and applications of Queues
- 講授：
- 3
Linked Lists
Singly linked lists and Chains, Insertion/deletion/search in linked lists, Linked stack/queue, Doubly linked lists
- 講授：
- 6
Tree
Definition, behavior, implementations and applications of Trees, Heap, Binary search trees, Balanced binary search tree, AVL trees
- 講授：
- 9
Midterm Exam.
- 其他：
- 3
備註：Exam.
Graphs
Definition, behavior, implementations and applications of Graphs, DFS/BFS, Minimum cost spanning trees, Shortest paths, Transitive Closure, AOV networks
- 講授：
- 9
Sorting
Selection/Bubble/Insertion/Quick/Merge/Heap sorts, How fast can we sort
- 講授：
- 6
Final Exam.
- 其他：
- 3
備註：Exam.
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction (Performance analysis/measures, Programming tool) Please join the FB club: ds110_imf_nycu to receive the timely news. Week1 using Google Meet: https://meet.google.com/mmg-hprh-odt 9/13 |
| 第 2 週 | Arrays 9/20 |
| 第 3 週 | Structures and Pointers 9/27 |
| 第 4 週 | Stacks and Queues I: Definitions and implementations, Mouse-in-a-maze problem 10/4 |
| 第 5 週 | Stacks and Queues II: Evaluation of expressions 10/11 |
| 第 6 週 | Linked Lists: Singly linked lists and chains 10/18 |
| 第 7 週 | Linked Lists: Insertion/deletion/search, Linked stack/queue, Doubly linked lists 10/25 |
| 第 8 週 | Trees: Representation of trees, Binary trees, Traversal of binary trees 11/1 |
| 第 9 週 | Trees: Heaps, Binary search trees 11/8 |
| 第 10 週 | Midterm Exam 11/15 |
| 第 11 週 | Review, Programming tips and Discussion 11/22 |
| 第 12 週 | Balanced binary trees: AVL trees 11/29 |
| 第 13 週 | Graphs I: Depth first search, Breadth first search, Connected components 12/6 |
| 第 14 週 | Graphs II: Minimum cost spanning trees 12/13 |
| 第 15 週 | Graphs III: Shortest paths, Transitive Closure, AOV networks 12/20 |
| 第 16 週 | Sorting I: Insertion/Quick sort, How fast can we sort 12/27 |
| 第 17 週 | Sorting II: Merge/Heap sort, List/Table sort 1/3 |
| 第 18 週 | Final Exam 1/10 |
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C (2nd Edition), Silicon Press, 2008, NJ.
- 地點
- MB312
- 時間
- JK, Monday
- 聯絡方式
- sjshyu@gmail.com sjshyu@nycu.edu.tw