演算法概論
Introduction to Algorithms
學期
113-1
學分
0
學分
當期課號
515507
永久課號
CSCS10009
開課單位
資訊學院共同課程
授課教師
高孟駿
校區
光復
類別
必修
上課時間表
| 節 | 週二 | 週四 |
|---|---|---|
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 |
| 第 2 週 | Growth of functions, Recurrence |
| 第 3 週 | Median Selection, (Abstract) Binary Search |
| 第 4 週 | Amortized Analysis |
| 第 5 週 | Greedy Algorithms |
| 第 6 週 | Divide-and-Conquer |
| 第 7 週 | Fast Fourier Transform (FFT) |
| 第 8 週 | Dynamic Programming --------------------------- Optimal Substructure and Recurrence |
| 第 9 週 | Dynamic Programming ---------------------------- More Examples |
| 第 10 週 | Basic Graph Traversal ------------------------- Depth-first Search Breadth-first Search |
| 第 11 週 | Minimum Spanning Tree ----------------------------- Kruskal's Algorithm Prim's Algorithm |
| 第 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 |
| 第 13 週 | Network Flow Problem ---------------------------- Maximum Flow & Minimum Cut Ford-Fulkerson's algorithm Some efficient algorithms |
| 第 14 週 | Computation Hardness and Polynomial-Time Reduction, NP-completeness |
| 第 15 週 | String Algorithms |
| 第 16 週 | Geometric Algorithms |
教科書
Cormen, Leiserson, Rivest and Stein, ``Introduction to Algorithms'', 4th ed, 2022, MIT press.
Office Hours
- 地點
- 教師未提供此項資料
- 時間
- by appointment
- 聯絡方式
- mjkao@nycu.edu.tw