演算法概論
Introduction to Algorithms
學期
106-1
學分
3
學分
當期課號
1193
永久課號
DCP3573
開課單位
資訊學院共同課程
授課教師
陳健
校區
光復
類別
必修
上課時間表
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 演算法概論 EC015 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 演算法概論 EC015 |
* 根據陽明交大上課時間表所列
概述
This course introduces students to the analysis and design of computer algorithms.
先修科目
Programming & Data Structure
評分方式
作業部份: 4-6 Homework 3-5 Programming assignments 考試部份: 2 quizzes 3-5 pop quizzes 1 midterm 1 Final 評量部份: Homework assignment (5%) Programming assignment (20%) Quiz (20%); Mid-term (25%) Final exam (30%) Class participation (+/-)
課程大綱
- 1. Introduction to analysis of algorithms 2. Asymtotic notation 3. divide and conquer 4. Recurrences, summations 5. Heapsort & quicksort 6. Median, order statistics 7. Sorting in linear time 8. Hash 9. Red-Black tree 10. Dynamic Programming 11. Greedy algorithms 12. Minimum spanning tree 13. Graph algorithms: depth-first search, topological sorting, breadth-first search 14. Graph algorithms: Single-source shortest paths, Dijkstra's algorithm 15. Bellman-Ford algorithm, dag shortest paths 16. All-pairs shortest paths, Floyd-Warshall algorithm 17. Network flow 18. Introduction to NP-completeness
教科書
1.Introduction to Algorithms, 3rd Ed, the MIT Press, by Cormen, Leiserson, Rivest and Stein.
Office Hours
- 地點
- EC125B
- 時間
- Thuesday 1:30-3:30PM
- 聯絡方式
- email:chienchen@cs.nctu.edu.tw