1081-Computer Algorithms-54022

Registration：Now ~ Any Time
Course Period：2019-08-01 ~ 2020-01-31
Credit(s)：3

課程目標：

This course introduces techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: Randomized algorithms, Divide-and-Conquer; Greedy method, Dynamic programming, Backtracking, Branch-and-bound; graph algorithms; NP-complete problems. The aim of this course is to have a more detailed study of efficient algorithms for computational problems. 

教學大綱：
	Introduction
	Lower Bounds (Complexity)
	Greedy Method
	Divide-&-Conquer Strategy
	Searching Method (Branch-&-Bound Strategy)
	Prune-&-Search Strategy
	Dynamic Programming Strategy
	NP-Completeness
	Branch-&-Bound Strategy

先備課程：
離散數學、資料結構、程式設計

適用對象：
資工系大三、大四同學

評分標準：
期中考 (書面 ) 30% 
期末考 (書面 ) 30% 
程式作業 (6題 線上繳交) 30% 
教材閱讀 (超過30小時者獲5分，不足者依比率計算) 5% 
討論區發問與討論 5% (發問或回答同學提問至少五次(含)，不足者依比率計算)