演算法概論
Introduction to Algorithms
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 演算法概論 EC022（光復） 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 演算法概論 EC022（光復） |
* 根據陽明交大上課時間表所列
This undergraduate course is designed to provide an introduction on the design and analysis of computer algorithms with hands-on implementations for standard textbook computation problems.
Programming, Data Structure, Probability
無備註
教師未提供此項資料
Mid-term Exam 30% Final Exam 30% Programming Assignments & Hand-written Exercises 40%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Sorting Algorithms ------------------------ Optimal sorting algorithms, Lower-bounds 2024-09-03(二),2024-09-05(四) |
| 第 2 週 | Growth of functions, Recurrence 2024-09-10(二),2024-09-12(四) |
| 第 3 週 | Median Selection, (Abstract) Binary Search 2024-09-17(二),2024-09-19(四) |
| 第 4 週 | Amortized Analysis 2024-09-24(二),2024-09-26(四) |
| 第 5 週 | Greedy Algorithms 2024-10-01(二),2024-10-03(四) |
| 第 6 週 | Divide-and-Conquer 2024-10-08(二),2024-10-10(四) |
| 第 7 週 | Fast Fourier Transform (FFT) 2024-10-15(二),2024-10-17(四) |
| 第 8 週 | Dynamic Programming --------------------------- Optimal Substructure and Recurrence 2024-10-22(二),2024-10-24(四) |
| 第 9 週 | Dynamic Programming ---------------------------- More Examples 2024-10-29(二),2024-10-31(四) |
| 第 10 週 | Basic Graph Traversal ------------------------- Depth-first Search Breadth-first Search 2024-11-05(二),2024-11-07(四) |
| 第 11 週 | Minimum Spanning Tree ----------------------------- Kruskal's Algorithm Prim's Algorithm 2024-11-12(二),2024-11-14(四) |
| 第 12 週 | Shortest Path Problem --------------------------- Dijkstra's algorithm for single-source shortest paths, Floyd-Warshall's algorithm for all-pair shortest paths, Bellman-Ford's algorithm for directed graphs 2024-11-19(二),2024-11-21(四) |
| 第 13 週 | Network Flow Problem ---------------------------- Maximum Flow & Minimum Cut Ford-Fulkerson's algorithm Some efficient algorithms 2024-11-26(二),2024-11-28(四) |
| 第 14 週 | Computation Hardness and Polynomial-Time Reduction, NP-completeness 2024-12-03(二),2024-12-05(四) |
| 第 15 週 | String Algorithms 2024-12-10(二),2024-12-12(四) |
| 第 16 週 | Geometric Algorithms 2024-12-17(二),2024-12-19(四) |
Cormen, Leiserson, Rivest and Stein, ``Introduction to Algorithms'', 4th ed, 2022, MIT press.
- 地點
- 教師未提供此項資料
- 時間
- by appointment
- 聯絡方式
- mjkao@nycu.edu.tw