演算法
Computer Algorithms
學期
108-1
學分
3
學分
當期課號
5613
永久課號
IIM5408
開課單位
管理學院碩士在職專班-資管組
授課教師
林妙聰
校區
光復
類別
選修
上課時間表
| 節 | 週一 |
|---|---|
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
- Sorting
- Searching
- Trees
- Greedy Method and Dynamic Programming Algorithms, Branch-and-Bound
- Meta-Heuristics
- Complexity
週次計畫
| 週次 | 主題 |
|---|---|
| 第 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.
Office Hours
- 地點
- MB310
- 時間
- 一EF, 四D
- 聯絡方式
- bmtlin@mail.nctu.edu.tw 分機 31472