| 當期課號 | 2689 | Course Number | 2689 |
|---|---|---|---|
| 授課教師 | 王經篤 | Instructor | WANG,JING DOO |
| 中文課名 | 演算法概論 | Course Name | Introduction to Algorithm |
| 開課單位 | 資訊工程系(四日)三C | 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 students will realize the following important algorithm topics after finishing this course: 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 |
| 教材 | http://asia.edu.tw/~jdwang/TeachingCourses/Algorithm/algorithm_97_2_Outline.htm | Teaching Materials | http://asia.edu.tw/~jdwang/TeachingCourses/Algorithm/algorithm_97_2_Outline.htm |
| 成績評量方式 | 平時成績(40%) 期中考(30% 期末考(30%) |
Grading | |
| 教師網頁 | http://asia.edu.tw/~jdwang | ||
| 教學內容 | Introduction Fundamentals of the Analysis of Algorithm Efficiency Brute Force Divide-and-Conquer Decrease-and-Conquer Middle Exam(期中考) Space and Time Tradeoffs Dynamic Programming Greedy Technique Limitations of Algorithm Power Coping with the Limitations of Algorithm Power Final Exam(期末考) |
Syllabus | Introduction Fundamentals of the Analysis of Algorithm Efficiency Brute Force Divide-and-Conquer Decrease-and-Conquer Middle Exam(期中考) Space and Time Tradeoffs Dynamic Programming Greedy Technique Limitations of Algorithm Power Coping with the Limitations of Algorithm Power Final Exam(期末考) |