高等演算法
Advanced Algorithms
| 節 | 週四 |
|---|---|
2 09:00–09:50 | 高等演算法 ED202(光復) 3 節連堂 |
3 10:10–11:00 | |
4 11:10–12:00 |
* 根據陽明交大上課時間表所列
1. Learn how to analyze the given problems 2. Learn how to design efficient and effective methods to resolve given problems 3. Learn the already-known marvelous algorithms for certain classical problems
1. Computer Programming (mandatory) 2. Data Structures (nice to have)
無備註
1. Lectures are available on the course webpage. 2. All course related information can also be found on the course webpage.
1. Midterm: 35% 2. Final Exam : 35% 3. Programming Assignments: 30%
1. Introduction
2. Sorting
3. Tree Structures
4. Hashing
5. Dynamic Programming
6. Greedy Algorithms
7. Graph Algorithms
教師未提供此項資料
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Introduction to Algorithms,” 3rd edition, 2009, MIT Press, ISBN: 978-0-262-53305-8.
- 地點
- ED621
- 時間
- 1CD, by appointment first
- 聯絡方式
- ext. 31372 jdhuang@mail.nctu.edu.tw
