演算法
Computer Algorithms
| 節 | 週一 |
|---|---|
A 18:30–19:20 | 演算法 MB312（光復） 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 the computer science discipline.
Computer Programming or Data Structures
無備註
採實體授課 是防疫規定,須採線上授課時另行公告上課連結
mind-term exam 30%; final exam 30% homework & programming assignment 30% participation 10%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Overview and Introduction |
| 第 2 週 | Growth of Functions Complexity of problems Complexity of algorithms |
| 第 3 週 | Recurrences |
| 第 4 週 | Recurrences Dynamic Programming (classical models and design techniques, approximate DP) |
| 第 5 週 | Dynamic Programming (classical models and design techniques, approximate DP) |
| 第 6 週 | Greedy Method and Matroid Theory |
| 第 7 週 | B-Trees, B^+ trees |
| 第 8 週 | Mid-term exam |
| 第 9 週 | B^+ Trees, Fibonacci Heaps |
| 第 10 週 | B^+ trees, RB trees |
| 第 11 週 | Amortized analysis Disjoint Set Operations |
| 第 12 週 | Elementary Graph Algorithms (DFS, BFS, BestFS, A^* algorithm) |
| 第 13 週 | Minimum Spanning Trees (correctness proofs, implementation details, and run-time analysis) |
| 第 14 週 | Single-Source Shortest Paths, All-Pairs Shortest Paths |
| 第 15 週 | Local search and meta-heuristics |
| 第 16 週 | Performance ratio analysis, PTAS, FPTAS |
| 第 17 週 | Final exam |
| 第 18 週 | Reserved for project review, if implemented |
T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
- 地點
- MB310
- 時間
- Monday abc (6:30PM-09:20PM)
- 聯絡方式
- ext. 31472 bmtlin@nycu.edu.tw