演算法
Computer Algorithms
| 節 | 週一 |
|---|---|
5 13:20–14:10 | 演算法 MB312（光復） 3 節連堂 |
6 14:20–15:10 | |
7 15:30–16:20 |
* 根據陽明交大上課時間表所列
The course is intended as a first undergraduate course in the design and analysis of algorithms. The main focus is on known and well-established results in the literature. The course will give an overview of common techniques and applications of these techniques in different settings.
Data structures (optional)
無備註
教師未提供此項資料
- Homework assignments (5 assignments, including written problem solving and/or coding): 30% - Midterm: 40% - Final project and presentation: 30%
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Preliminaries: mathematical proofs, in particular induction and contradiction big-O notation (Big-O, Omega, Theta), how to apply them 2026-09-07(一) |
| 第 2 週 | Preliminaries: mathematical proofs, in particular induction and contradiction big-O notation (Big-O, Omega, Theta), how to apply them 2026-09-14(一) |
| 第 3 週 | Preliminaries: basic discrete math such as evaluating sums and simple recurrences basic algorithms such as binary search, sorting basic graph algorithms such as connected components, BFS, DFS 2026-09-21(一) |
| 第 4 週 | Preliminaries: basic discrete math such as evaluating sums and simple recurrences basic algorithms such as binary search, sorting basic graph algorithms such as connected components, BFS, DFS 2026-09-28(一) |
| 第 5 週 | Intro to Theory of Computation: Autamata, Turing machines and algorithms, decidability and complexity Greedy algorithms 2026-10-05(一) |
| 第 6 週 | Greedy algorithms 2026-10-12(一) |
| 第 7 週 | Greedy algorithms 2026-10-19(一) |
| 第 8 週 | Divide and Conquer 2026-10-26(一) |
| 第 9 週 | Dynamic programming 2026-11-02(一) |
| 第 10 週 | (Mid)term exam 2026-11-09(一) |
| 第 11 週 | Dynamic programming 2026-11-16(一) |
| 第 12 週 | Max-Flow/Min-Cut 2026-11-23(一) |
| 第 13 週 | NP-hardness and reduction Approximation Linear programming 2026-11-30(一) |
| 第 14 週 | Randomization PAC Learnability and learning 2026-12-07(一) |
| 第 15 週 | Final presentation 2026-12-14(一) |
| 第 16 週 | Final presentation 2026-12-21(一) |
Algorithm Design by Jon Kleinberg and Éva Tardos. 2005 References: Introduction to Algorithms (any available edition) by Cormen, Leiserson, Rivest, and Stein Approximation Algorithms by Vazirani. 2001 Introduction to the Theory of Computation 3rd edition, Michael Sipser. 2012 Understanding Machine Learning: From Theory to Algorithms, Shai Shalev-Shwartz and Shai Ben-David. 2014
- 地點
- 313C, Management Building 2
- 時間
- Office hours: Mon 4:20-5:20pm
- 聯絡方式
- poanchen@nycu.edu.tw (instructor) suy535628@gmail.com (TAs)