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. 2.教學大綱: 配合台灣師範大學演算法開課之課綱增修至少包含 Introduction Lower Bounds (Complexity) Greedy Method Divide-&-Conquer Strategy Searching Method (Branch-&-Bound Strategy) Prune-&-Search Strategy Dynamic Programming Strategy
通過條件
成 績 :60 分
-
考古題
-
課程大綱(20190708更新)
-
課程介紹ppt (20190708更新)
-
投影片下載(全) 壓縮檔
-
課程錄影網頁版
-
最新課程錄影
-
++++++++++++++++++++++++
-
歷年課程錄影整理 (網頁版)
-
106 上課投影片
- 課程介紹
- 課程安排
- 評論