{"course":{"id":"107125803501","name":"演算法設計與分析","enroll_type":"選修","general_type":"","dept":"工管系碩士班","grade":1,"class_group":"甲","teacher":"白恭瑞","credit":3,"hour":3,"time":[{"day":2,"section":[2,3,4]}],"classroom":"","max":25,"min":5,"remark":"","alt_for":"","courses":""},"detail":[["課程大綱","課程概述與目標：讓學生獲得以下的知識\n1. 以演算法技巧來研究問題(解決問題)的能力。\n2. 解決問題的技巧的分類、並分析其複雜度。"],["指定教材","戴顯權，演算法，二版，滄海，台中市，100年"],["參考教材","李家同等人，Introduction to the Design and Analysis of Algorithm，初版，Mc Graw Hill(旗標出版股份有限公司代理)，台北市，97年(英文版)"],["成績評量標準","4次小考,每次25%"]],"office_time":[],"schedule":[["9/18","","","","","介紹","","課程介紹，演算法介紹",""],["9/25","","","","","演算法與問題之分析","","演算法與問題之分析、時間(空間)複雜度",""],["10/2","","","","","貪婪演算法1","","貪婪演算法的精神與技巧,最小花費成本樹-Kruskal、Prim演算法",""],["10/9","","","","","貪婪演算法2","","單一起點之最短路徑 、霍夫曼樹",""],["10/16","","","","","貪婪演算法3","作業1","單一起點之最短路徑 、霍夫曼樹",""],["10/23","","","","","淘汰與搜尋法1","","淘汰與搜尋法的精神與技巧、找劣幣問題、二元搜尋","小考1"],["10/30","","","","","淘汰與搜尋法2","作業2","選出第 k 小的元素 、queue layout",""],["11/6","","","","","分與治之法1","","分與治之法的精神與技巧、合併排序",""],["11/13","","","","","分與治之法2","作業3","快速排序，矩陣相乘",""],["11/20","","","","","動態規劃1","","動態規劃的精神與技巧、多階圖","小考2"],["11/27","","","","","動態規劃2","","資源分配、最長遞增子數列",""],["12/4","","","","","動態規劃3","作業4","最長共同子序列、所有對之最短路徑",""],["12/11","","","","","NP-完備理論1","","簡單問題與困難問題、一些常見的困難問題",""],["12/18","","","","","NP-完備理論2","作業5","NP-完備、NP與多項式時間驗證、轉換、NP-完備性",""],["12/25","","","","","處理NP-完備1","","解NP-完備問題 、回溯法與分支設限法","小考3"],["1/1","","","","","處理NP-完備2","","TSP 問題 、0/1 打包問題",""],["1/8","","","","","處理NP-完備3","","TSP 問題 、0/1 打包問題",""],["1/15","","","","","期末考","","",""]]}