| 當期課號 |
2183 |
Course Number |
2183 |
| 授課教師 |
陳青文 |
Instructor |
CHEN,CHING WEN |
| 中文課名 |
演算法 |
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
. |
| 教材 |
slides and lecture notes |
Teaching Materials |
slides and lecture notes |
| 成績評量方式 |
期中考30%,<br>
期末考30%,<br>
報告30%, <br>
點名與平常分數10%<br> |
Grading |
Middle term:30%
Final term: 30%
Presentation: 30%
Others: 10% |
| 教師網頁 |
|
| 教學內容 |
This course investigates several important algorithm topics. The covered issues in this course includes
<ol>
<li> Complexity of algorithms and lower bounds of problems
<li> NP-complete
<li> Greedy method
<li> Divide-and-conquer
<li> Tree searching strategies
<li> Prune-and-search strategy
<li> Dynamic programming
<li> Approximation algorithms
<li> Amortized analysis
<li> Randomized algorithms
</ol> |
Syllabus |
This course investigates several important algorithm topics. The covered issues in this course includes
<ol>
<li> Complexity of algorithms and lower bounds of problems
<li> NP-complete
<li> Greedy method
<li> Divide-and-conquer
<li> Tree searching strategies
<li> Prune-and-search strategy
<li> Dynamic programming
<li> Approximation algorithms
<li> Amortized analysis
<li> Randomized algorithms
</ol> |