演算法
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.
Computer Programming, Data Structures (no specific programming languages are designated)
無備註
採實體授課。視當周情況,部分採線上進行。
作業(含程式設計)45%; 期中報告 (分組) 15% Team Project (分組) 30% 課堂參與 10%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction, Complexity of Algorithms, Complexity of Problems, Asymptotic Notation 2025-09-01(一) |
| 第 2 週 | Divide-and-Conquer Method, Recurrence Relation 2025-09-08(一) |
| 第 3 週 | Divide-and-Conquer Method, Recurrence Relation 2025-09-15(一) |
| 第 4 週 | Merge Sort, Quick Sort 2025-09-22(一) |
| 第 5 週 | Decision Tree Models Lower Bound 2025-09-29(一) |
| 第 6 週 | Depth-First-Search, Breadth-First-Search, Best-First-Search 2025-10-06(一) |
| 第 7 週 | A* Algorithm, \alpha-\beta Cut 2025-10-13(一) |
| 第 8 週 | Binary Search Tree B-Tree 2025-10-20(一) |
| 第 9 週 | 期中考 2025-10-27(一) |
| 第 10 週 | Greedy method Matroid 2025-11-03(一) |
| 第 11 週 | Dynamic Programming 2025-11-10(一) |
| 第 12 週 | Branch-and-Bound 2025-11-17(一) |
| 第 13 週 | Branch-and-Bound 2025-11-24(一) |
| 第 14 週 | Local Search, Tabu Search, Simulated Annealing 2025-12-01(一) |
| 第 15 週 | Ant Colony Optimization, Genetic Algorithm 2025-12-08(一) |
| 第 16 週 | 期末考與期末作業 2025-12-15(一) |
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
- 地點
- MB310
- 時間
- 四 CD
- 聯絡方式
- ext. 31472 bmtlin@nycu.edu.tw