演算法
Computer Algorithms
學期
115-1
學分
3
學分
當期課號
557603
永久課號
MGIM30021
開課單位
管理學院碩士在職專班-資管組
授課教師
林妙聰
校區
光復
類別
選修
上課時間表
| 節 | 週一 |
|---|---|
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 |
| 第 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 週 | Greedy method Matroid |
| 第 11 週 | Dynamic Programming |
| 第 12 週 | Branch-and-Bound |
| 第 13 週 | Branch-and-Bound |
| 第 14 週 | Local Search, Tabu Search, Simulated Annealing |
| 第 15 週 | Ant Colony Optimization, Genetic Algorithm |
| 第 16 週 | 期末考與期末作業 |
教科書
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
Office Hours
- 地點
- MB310
- 時間
- 四 CD
- 聯絡方式
- ext. 31472 bmtlin@nycu.edu.tw