Course Syllabus

Course Information：

Year-Semester Course Number Course Name Phase Credits Hours Required/Elective Instructor Class Student NO. Withdraw Note

Spring Semester
Year 2021 287271 Computer Algorithms 1 3.0 3 ★ Meng-Shiuan Pan 4EN3C 23 9 日職合開

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2021	287271	Computer Algorithms	1	3.0	3	★	Meng-Shiuan Pan	4EN3C	23	9	日職合開

Course Plan：

Instructor Meng-Shiuan Pan

Email mspan@ntut.edu.tw

Last Updated 2021-07-01 00:36:26

Course Objective 瞭解常見之演算法及其分析，1.Complexity、Big-Oh符號，2.演算法之分析，3.集合、優先佇列，4.樹、平衡樹，5.排序演算法，6.搜尋演算法，7.圖形演算法，8.幾何演算法，9.NP-complete problems之理論及對策。

Course Schedule week 1: Complexity week 2: Data structures week 3: Divide and Conquer week 4: Divide and Conquer week 5: Divide and Conquer week 6: Greedy algorithm week 7: Greedy algorithm week 8: Dynamic programming week 9: Dynamic programming week 10: Dynamic programming week 11: Searching week 12: Searching week 13: Backtracking week 14: Backtracking week 15: Branch and bound week 16: Branch and bound week 17: NP week 18: NP

Evaluation and grading policy 2 exams: 60% homework and others: 40%

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:Yes
Computer Algorithms (2/E) by Horowitz, Sahni, & Rajasekaran

The access to curricular consultation

Note In response to COVID-19 pandemic, the ways in which teachers and students engage in their classes for this semester are based upon the updates on our school's website :
(https://oaa.ntut.edu.tw/p/404-1008-98622.php?Lang=zh-tw)

　

Instructor	Meng-Shiuan Pan
Email	mspan@ntut.edu.tw
Last Updated	2021-07-01 00:36:26
Course Objective	瞭解常見之演算法及其分析，1.Complexity、Big-Oh符號，2.演算法之分析，3.集合、優先佇列，4.樹、平衡樹，5.排序演算法，6.搜尋演算法，7.圖形演算法，8.幾何演算法，9.NP-complete problems之理論及對策。
Course Schedule	week 1: Complexity week 2: Data structures week 3: Divide and Conquer week 4: Divide and Conquer week 5: Divide and Conquer week 6: Greedy algorithm week 7: Greedy algorithm week 8: Dynamic programming week 9: Dynamic programming week 10: Dynamic programming week 11: Searching week 12: Searching week 13: Backtracking week 14: Backtracking week 15: Branch and bound week 16: Branch and bound week 17: NP week 18: NP
Evaluation and grading policy	2 exams: 60% homework and others: 40%
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes Computer Algorithms (2/E) by Horowitz, Sahni, & Rajasekaran
The access to curricular consultation
Note	In response to COVID-19 pandemic, the ways in which teachers and students engage in their classes for this semester are based upon the updates on our school's website : (https://oaa.ntut.edu.tw/p/404-1008-98622.php?Lang=zh-tw)