{"course":{"id":"113225803501","name":"演算法設計與分析","enroll_type":"選修","general_type":"","dept":"工管系碩士班","grade":1,"class_group":"甲","teacher":"白恭瑞","credit":3,"hour":3,"time":[{"day":1,"section":[2,3,4]}],"classroom":"","max":25,"min":5,"remark":"English-taught course","alt_for":"","courses":""},"detail":[["指定教材","R.C.T. Lee, S.S. Tseng, R.C. Chang, Y.T.Tsai, Introduction to the Design and Analysis of Algorithm,  McGraw-Hill Education, 2006"],["參考教材","Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford, Introduction to Algorithms, Mit Press, 2009"],["成績評量標準","4 exams (22% each)\nSome homework (12%)"],["教學方法","理論講授,實務講授,個案分析,個人實驗(實作)"],["教學目標","Students can acquire the following knowledge:\n1. The ability of problems studing(problem solving) with algorithmic skills.\n2. Classification of problem-solving skills and analysis of their complexity."]],"office_time":[["白恭瑞","Monday 14:00~17:00,\nThursday 14:00~17:00,"]],"schedule":[["2025/01/13","2","4","3","白恭瑞","Introduction of algorithm","","Course introduction, Introduction to algorithms",""],["2025/01/20","2","4","3","白恭瑞","The complexity of algorithms","Homework 1","Analysis of algorithms, Analysis of problems, Time complexity",""],["2025/02/10","2","4","3","白恭瑞","The complexity of algorithms","","Analysis of algorithms, Analysis of problems, Time complexity",""],["2025/02/17","2","4","3","白恭瑞","Greedy methods","","The shortest path with a single sorce, Huffman tree",""],["2025/02/24","2","4","3","白恭瑞","Greedy methods","Homework 2","The shortest path with a single sorce, Huffman tree",""],["2025/03/03","2","4","3","白恭瑞","Prune-and-search","","The spirit and skills of prune-and-search, finding fake coins, the binary search method","exam 1"],["2025/03/10","2","4","3","白恭瑞","Prune-and-search","Homework 3","The spirit and skills of prune-and-search, finding fake coins, the binary search method",""],["2025/03/17","2","4","3","白恭瑞","Divide-and-conquer","","The spirit and skills of divide and conquer, merge sort",""],["2025/03/24","2","4","3","白恭瑞","Divide-and-conquer","Homework 4","Quick sort, matrix multiplication",""],["2025/03/31","2","4","3","白恭瑞","Dynamic programming","","The spirit and skills of dynamic programming, multi-level graphs","exam 2"],["2025/04/07","2","4","3","白恭瑞","Dynamic programming","","Resource allocation, longest common subsequence",""],["2025/04/14","2","4","3","白恭瑞","Dynamic programming","Homework 5","longest common subsequence, shortest path to all pairs",""],["2025/04/21","2","4","3","白恭瑞","The theory of NP-completeness","","NP-complete, NP and polynomial time verification, reduce method",""],["2025/04/28","2","4","3","白恭瑞","The theory of NP-completeness","Homework 6","NP-complete, NP and polynomial time verification, reduce method","exam 3"],["2025/05/05","2","4","3","白恭瑞","Heuristic algorithms","","Solving NP-complete problems, backtracking and branch-and-limit method",""],["2025/05/12","2","4","3","白恭瑞","Heuristic algorithms","Homework 7","Solving NP-complete problems, backtracking and branch-and-limit method",""],["2025/05/19","2","4","3","白恭瑞","Approximation algorithms","","Approximation algorithms, traveling salesman problem",""],["2025/05/26","2","4","3","白恭瑞","Final exam","","",""]]}