| 當期課號 |
2057 |
Course Number |
2057 |
| 授課教師 |
陳金鈴 |
Instructor |
CHEN,CHIN LING |
| 中文課名 |
演算法 |
Course Name |
Algorithms |
| 開課單位 |
資訊工程系(四日)三A |
Department |
|
| 修習別 |
必修 |
Required/Elective |
Required |
| 學分數 |
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
. |
| 教材 |
書名: Introduction to the design and analysis of algorithms. Fourth Edition
作者: R.C.T. Lee, R.C. Chang, S.S. Tseng and Y.T. Tsai
出版社: 旗標
書號: F7823
參考書籍:
T.H.Cormen,C.E.Leiserson,R.L.Rivest and C.Stein, Introduction to Algorithms, 2nd edition, 開發圖書代理. |
Teaching Materials |
|
| 成績評量方式 |
期中考30%，期末考30%，平時作業40% |
Grading |
Midterm exam 30%, Final exam 30%, exercise 40% |
| 教師網頁 |
|
| 教學內容 |
This course investigates several important algorithm topics. The covered issues in this course includes
Complexity of algorithms and lower bounds of problems
NP-complete
Greedy method
Divide-and-conquer
Tree searching strategies
Prune-and-search strategy
Dynamic programming
Approximation algorithms
Amortized analysis
Randomized algorithms |
Syllabus |
This course investigates several important algorithm topics. The covered issues in this course includes
Complexity of algorithms and lower bounds of problems
NP-complete
Greedy method
Divide-and-conquer
Tree searching strategies
Prune-and-search strategy
Dynamic programming
Approximation algorithms
Amortized analysis
Randomized algorithms |