競技程式設計(一)
Competitive Programming(I)
| 節 | 週五 |
|---|---|
A 18:30–19:20 | 競技程式設計(一) ED117（光復） 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
This is an introductory course in competitive programming. It will cover implementation skills on data structures and fundamental problem solving approaches such as incremental algorithms, divide and conquer, greedy algorithms, dynamic programming, state space search and etc. Some topics in data structures, graph theory and computational geometry will be taught if everything goes smoothly. This course aims to encourage students to participate programming contests, and it provides the basic training to contestants.
Basic programming ability in C or C++ or Java or Python Knowing arithmetics, binary representation and call stack Solve qualification problem set by 23:59, Mar 1, 2018.
無備註
Online Judge System: https://oj.nctu.me/ Course materials: https://github.com/mzshieh/cp1_2018/
Assignments: 10% Midterm: 45% Final: 45% Both the midterm and the final will consist of 8 problems and last 5 hours.
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Course Orientation and Introduction to Programming Contest Qualification Problem Set |
| 第 2 週 | Input Parsing Output Formatting |
| 第 3 週 | Fundamental data structures Built-in Library |
| 第 4 週 | Simulation |
| 第 5 週 | Incremental Algorithms |
| 第 6 週 | Divide and Conquer |
| 第 7 週 | Recursive Enumeration |
| 第 8 週 | Sorting and Binary Search |
| 第 9 週 | Midterm |
| 第 10 週 | Data Structures Related to Static Trees |
| 第 11 週 | Data Structures Related to Static Trees |
| 第 12 週 | Dynamic Programming |
| 第 13 週 | Dynamic Programming |
| 第 14 週 | Greedy Algorithms |
| 第 15 週 | State Space Search |
| 第 16 週 | State Space Search |
| 第 17 週 | Selected Topics |
| 第 18 週 | Final |
Competitive Programming 3, written by Steven Halim and Felix Halim, published by LuLu Enterprises, 2013. Handouts
- 地點
- CS337
- 時間
- 3GH
- 聯絡方式
- mzshieh@nctu.edu.tw