演算法
Computer Algorithms
| 節 | 週二 | 週四 |
|---|---|---|
2 09:00–09:50 | 演算法 MB312（光復） | |
5 13:20–14:10 | 演算法 MB312（光復） 2 節連堂 | |
6 14:20–15:10 |
* 根據陽明交大上課時間表所列
The theme is to prepare the students with fundamentals of the design and analysis of computer algorithms. Through theoretical studies as well as computer implementation, we will acquire analytical and computational techniques for computer science study.
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 |
| 第 3 週 | Recurrences |
| 第 4 週 | Recurrences Dynamic Programming |
| 第 5 週 | Dynamic Programming |
| 第 6 週 | Greedy Method |
| 第 7 週 | Greedy Method |
| 第 8 週 | B-Trees |
| 第 9 週 | Mid-term exam |
| 第 10 週 | Binomial Heaps |
| 第 11 週 | Elementary Graph Algorithms 1126 |
| 第 12 週 | Minimum Spanning Trees |
| 第 13 週 | Single-Source Shortest Paths |
| 第 14 週 | All-Pairs Shortest Paths |
| 第 15 週 | Polynomials and the FFT |
| 第 16 週 | String Matching |
| 第 17 週 | Final exam |
| 第 18 週 | Presentation: Term Project |
T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd Ed., MIT Press, 2008.
- 地點
- MB310
- 時間
- Tuesday EF, Thursday E
- 聯絡方式
- ext. 31472 bmtlin@mail.nctu.edu.tw