演算法
Computer Algorithms
| 節 | 週一 |
|---|---|
A 18:30–19:20 | 演算法 MB311（光復） 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
The theme is to prepare the students with fundamentals of design and analysis of computer algorithms. Through theoretical expositions as well as computer implementations, the students will acquire analytical and computational techniques for research as well as applications.
資料結構 程式設計
無備註
教師未提供此項資料
作業(含程式) 50% 期中考、期末考共 50%
Recurrence
Divide-and-Conquer Method Recurrence Relation
- 講授：
- 5
- 實作：
- 1
Sorting
Merge Sort Quick Sort Decision Tree Models
- 講授：
- 4
- 實作：
- 1
Searching
Depth-First-Search Breadth-First-Search Best-First-Search A* Algorithm \alpha-\beta Cut
- 講授：
- 5
- 實作：
- 1
Trees
Binary Search Tree B-Tree Red-Black Tree
- 講授：
- 8
- 實作：
- 1
Greedy Method and Dynamic Programming Algorithms, Branch-and-Bound
Greedy method Matroid Dynamic Programming Branch-and-Bound
- 講授：
- 8
- 實作：
- 1
Meta-Heuristics
Local Search, Tabu Search, Simulated Annealing, Ant Colony Optimization, Genetic Algorithm
- 講授：
- 8
- 實作：
- 1
Complexity
Complexity of Algorithms Complexity of Problems Asymptotic Notation
- 講授：
- 3
- 實作：
- 0
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction, Complexity of Algorithms, Complexity of Problems, Asymptotic Notation |
| 第 2 週 | Divide-and-Conquer Method, Recurrence Relation |
| 第 3 週 | Divide-and-Conquer Method, Recurrence Relation |
| 第 4 週 | Merge Sort, Quick Sort |
| 第 5 週 | Decision Tree Models Lower Bound |
| 第 6 週 | Depth-First-Search, Breadth-First-Search, Best-First-Search |
| 第 7 週 | A* Algorithm, \alpha-\beta Cut |
| 第 8 週 | Binary Search Tree B-Tree |
| 第 9 週 | 期中考 |
| 第 10 週 | B-Tree Red-Black Tree |
| 第 11 週 | Greedy method Matroid |
| 第 12 週 | Dynamic Programming |
| 第 13 週 | Branch-and-Bound |
| 第 14 週 | Branch-and-Bound |
| 第 15 週 | Local Search, Tabu Search, Simulated Annealing |
| 第 16 週 | Local Search, Tabu Search, Simulated Annealing |
| 第 17 週 | Ant Colony Optimization, Genetic Algorithm |
| 第 18 週 | 期末考與期末作業 |
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
- 地點
- MB310
- 時間
- 一EF, 四D
- 聯絡方式
- bmtlin@mail.nctu.edu.tw 分機 31472