競技程式設計(二)
Competitive Programming (II)
| 節 | 週五 |
|---|---|
A 18:30–19:20 | 競技程式設計(二) EC115 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
This is a second course in competitive programming. It will cover topics in Graph theory, Computational Geometry, Linear Programming, Advanced Data Structures, String Processing, Number theory, Combinatorics and so on.
Competitive Programming (I) is required if you are not qualified to represent NYCU in any collegiate programming contest. You must be capable to participate the training (doing problem sets supposed to be 5 hours each. If you don't meet the prerequisites, the instructor will cancel your registration if you study in NYCU. 未獲得代表陽明交大參加大學程式競賽者,必須先修完競技程式設計(一)才可修習此課程,且能參與每次五小時長度的練習。未滿足前述條件者,授課老師會在選課系統上退課。
Register https://codeforces.com/
Pass: Able to compete with descent Taiwanese teams (Top 6 of NTU teams, top 4 of NTHU teams) or able to convince the lecturer that you can pass Fail: Otherwise
| 週次 | 主題 |
|---|---|
| 第 1 週 | Orientation |
| 第 2 週 | Graph theory: Traversal |
| 第 3 週 | Graph theory: Connected Component and Spanning Trees |
| 第 4 週 | Graph theory: Shortest paths |
| 第 5 週 | Graphy theory: Flow networks |
| 第 6 週 | Advanced Data Structures: Balanced BST |
| 第 7 週 | Advanced Data Structures: Augmentation |
| 第 8 週 | Computational Geometry |
| 第 9 週 | Practice Contest 1 |
| 第 10 週 | String Processing: AC automaton, Z-algorithm |
| 第 11 週 | Practice Contest 2 |
| 第 12 週 | String Processing: Suffix Arrays |
| 第 13 週 | Number Theory |
| 第 14 週 | Practice Contest 3 |
| 第 15 週 | Combinatorics |
| 第 16 週 | Linear Programming |
| 第 17 週 | Selected Topics |
| 第 18 週 | Final |
Competitive Programming 4, written by Steven Halim, Felix Halim and Suhendry Effendy, published by LuLu Enterprises, 2020. Introduction to Algorithms: A Creative Approach by Udi Manber Handouts
- 地點
- By appointment
- 時間
- By appointment
- 聯絡方式
- mzshieh@nycu.edu.tw