當期課號 |
2617 |
Course Number |
2617 |
授課教師 |
曾育民 |
Instructor |
TSENG,YUH MIN |
中文課名 |
演算法 |
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
. |
教材 |
Class room 投影片(Slides) |
Teaching Materials |
Class room 投影片(Slides) |
成績評量方式 |
1.作業與程式作業或隨堂小考(Assignments or Quizzes): 30% 2.期中考(Midterm): 30% 3.期末考(Final exam): 30% 4.課堂參與(Participation):10% 5.程式競賽作業(Programming contest Assignment): Optional bonus 0~15% |
Grading |
1.作業與程式作業或隨堂小考(Assignments or Quizzes): 30% 2.期中考(Midterm): 30% 3.期末考(Final exam): 30% 4.課堂參與(Participation):10% 5.程式競賽作業(Programming contest Assignment): Optional bonus 0~15% |
教師網頁 |
|
教學內容 |
課程目標(Course Description): The aim of this course is to have a more detailed study of efficient algorithms and data structures for computational problems. The idea is to cover a number of different methods for construction of efficient algorithms through studying efficient algorithms for a number of basic computational problems. Each problem will be described in detail, an algorithm presented and analyzed. The plan is to cover the problems listed below. The list is preliminary and might be changed depending on the interest of the participants of the course |
Syllabus |
課程目標(Course Description): The aim of this course is to have a more detailed study of efficient algorithms and data structures for computational problems. The idea is to cover a number of different methods for construction of efficient algorithms through studying efficient algorithms for a number of basic computational problems. Each problem will be described in detail, an algorithm presented and analyzed. The plan is to cover the problems listed below. The list is preliminary and might be changed depending on the interest of the participants of the course |