| 當期課號 |
2195 |
Course Number |
2195 |
| 授課教師 |
楊朝成 |
Instructor |
YANG,CHOU CHEN |
| 中文課名 |
演算法 |
Course Name |
Algorithms |
| 開課單位 |
資訊工程系(四日)二B |
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
. |
| 教材 |
1.Lecture
2.Programming Projects |
Teaching Materials |
1.Lecture
2.Programming Projects |
| 成績評量方式 |
期中考: 30％
期末考: 40％
平常考及作業: 30％
一次缺課扣1分,遲到扣0.5分,全勤加5分 |
Grading |
期中考: 30％
期末考: 40％
平常考及作業: 30％
一次缺課扣1分,遲到扣0.5分,全勤加5分 |
| 教師網頁 |
|
| 教學內容 |
1.Introduction to Algorithms 2.Mathematical Foundations 3.Divide and Conquer Algorithms 4.Greedy Algorithms 5.Dynamic Programming Algorithms |
Syllabus |
1.Introduction to Algorithms 2.Mathematical Foundations 3.Divide and Conquer Algorithms 4.Greedy Algorithms 5.Dynamic Programming Algorithms |