| 當期課號 | 7471 | Course Number | 7471 |
|---|---|---|---|
| 授課教師 | 李朱慧 | Instructor | LEE,CHU HUI |
| 中文課名 | 演算法 | 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.動態規劃. 8.逼近演算法. |
Objectives | This course investigates several important algorithm topics. 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 Algorithm, a strategic approach R.C.T. Lee, S.S. Tseng, R.C. Chang and Y.T. Tsai |
Teaching Materials | Introduction to the Design and Analysis of Algorithm, a strategic approach R.C.T. Lee, S.S. Tseng, R.C. Chang and Y.T. Tsai |
| 成績評量方式 | 期中考: 30 分 期末考: 30 分 作業與平時成績: 40 分 |
Grading | Midterm Examination: 30% Final Examination: 30% Homework and Class participation : 30% |
| 教師網頁 | www.cyut.edu.tw/~chlee | ||
| 教學內容 | 1.Introduction 2.The complexity of algorithms and the lower bounds of problems 3.The greedy method 4.The divide-and-conquer strategy 5.Tree searching strategies 6.Prune-and-search 7.Dynamic programming 8.The theory of NP-Completeness |
Syllabus | 1.Introduction 2.The complexity of algorithms and the lower bounds of problems 3.The greedy method 4.The divide-and-conquer strategy 5.Tree searching strategies 6.Prune-and-search 7.Dynamic programming 8.The theory of NP-Completeness |