演算法導論
Introduction to Algorithms
| 節 | 週一 | 週三 |
|---|---|---|
2 09:00–09:50 | 演算法導論 ED116（光復） | |
5 13:20–14:10 | 演算法導論 ED116（光復） 2 節連堂 | |
6 14:20–15:10 |
* 根據陽明交大上課時間表所列
This course will be focused on the construction and analysis of computer algorithms. The objectives include the introduction to the fundamental data structures and applications, and the introduction of problem solving paradigms. The complexity of functions and algorithms will also be depicted.
Data Structures
無備註
教師未提供此項資料
TBD
1. Review of data structures and algorithm basics 2. Algorithm design and analysis techniques 3. Graph algorithms (including network flow and matching) 4. Intro to NP-completeness
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction 2025-09-01(一),2025-09-03(三) |
| 第 2 週 | Sorting 2025-09-08(一),2025-09-10(三) |
| 第 3 週 | Sorting 2025-09-15(一),2025-09-17(三) |
| 第 4 週 | Trees 2025-09-22(一),2025-09-24(三) |
| 第 5 週 | 9/29 no class (holiday) 10/1 SOCC Trees and DP 2025-09-29(一),2025-10-01(三) |
| 第 6 週 | 10/6 no class (holiday) 10/8 SASIMI DP 2025-10-06(一),2025-10-08(三) |
| 第 7 週 | 10/13 SASIMI Greedy algorithm 2025-10-13(一),2025-10-15(三) |
| 第 8 週 | Greedy algorithm 2025-10-20(一),2025-10-22(三) |
| 第 9 週 | 10/27 no class 10/29 Midterm 2025-10-27(一),2025-10-29(三) |
| 第 10 週 | 11/3 midterm discussion Graph 2025-11-03(一),2025-11-05(三) |
| 第 11 週 | Graph 2025-11-10(一),2025-11-12(三) |
| 第 12 週 | Network flows 2025-11-17(一),2025-11-19(三) |
| 第 13 週 | Network flows 2025-11-24(一),2025-11-26(三) |
| 第 14 週 | NP-hardness 2025-12-01(一),2025-12-03(三) |
| 第 15 週 | NP-hardness/selected topics 2025-12-08(一),2025-12-10(三) |
| 第 16 週 | Final exam week 2025-12-15(一),2025-12-17(三) |
Corman et.al, “Introduction to Algorithm,” MIT Press, 2022 References: 1. S. Dasgupta et.al, "Algorithms,"McGraw Hill, 2008
- 地點
- ED 407
- 時間
- TBD
- 聯絡方式
- hmchen@nycu.edu.tw