| 當期課號 |
7801 |
Course Number |
7801 |
| 授課教師 |
徐豐明 |
Instructor |
SHYU,FONG MING |
| 中文課名 |
演算法 |
Course Name |
Algorithms |
| 開課單位 |
資訊工程系碩士在職專班一A |
Department |
|
| 修習別 |
選修 |
Required/Elective |
Elective |
| 學分數 |
3 |
Credits |
3 |
| 課程目標 |
本課程主要介紹演算法的基本設計與觀念，學生在完成本課程後，將可了解關於演算法的基本設計理念，其主要涵蓋的範圍有：
1. 演算法的複雜度與計算下限的方法
2. NP-Complete的問題
3. 貪婪方法的介紹
4. Divide-and-conquer的方法
5. 搜尋的方法
6. Prune-and-search的策略
7. 動態規劃 |
Objectives |
The goal of this course is to provide the students with a basic knowledge of computer algorithm. The covered issues in this course includes
1. Complexity of algorithms and lower bounds of problems
2. NP-complete
3. Greedy method
4. Divide-and-conquer
5. Tree searching strategies
6. Prune-and-search strategy
7. Dynamic programming
. |
| 教材 |
R. C. Lee, R. C. Chang, S. S. Tseng and Y. T. Tsai, Introduction to the Design and Analysis of Algorithm, 2005. (旗標出版)
Thomas H. Cormen and Charles E. Leiserson, Introduction to Algorithms, 2/e ,McGraw-Hill, 2001. |
Teaching Materials |
|
| 成績評量方式 |
期中 30%
期末報告 40%
平時成績 30% |
Grading |
Mid-Term 30%
Final Report 40%
Homework and Others 30% |
| 教師網頁 |
|
| 教學內容 |
1. 簡介
2. 演算法複雜度
3. NP-Completeness 理論
4. 貪婪法
5. 各各擊破策略
6. 搜尋策略
7. 刪除與搜尋
8. 動態規劃
9. 趨近法
10. 分期攤還分析
11. 亂數演算法
12. 線上演算法 |
Syllabus |
1. Introduction
2. The Complexity of Algorithms and the Lower Bounds of Problems
3. The Theory of NP-Completeness
4. The Greedy Method
5. The Divide-and-Conquer Strategy
6. Tree Searching Strategies
7. Prune-and-Search
8. Dynamic Programming
9. Approximation Algorithms
10. Amortized Analysis
11. Randomized Algorithm
12. On-Line Algorithm |