詳細課綱請以此為主,網址:https://class-qry.acad.ncku.edu.tw/crm/course_map/course.php?dept=P7&cono=P75J700
證明演算法的正確性及利用數學技巧分析演算法的時間複雜度。
教學目標
認識各種重要的進階演算法。
訓練學生充分瞭解進階演算法的知識。
能夠運用進階演算法解決資訊工程各領域的問題。
介紹進階演算法的分析與設計。
課程大綱
Week1:The Role of Algorithms in Computing
Week2:Dynamic Programming(1)
Week3:Dynamic Programming(2)
Week4:Greedy Algorithms
Week5:Elementary Graph Algorithms(1)
Week6:Elementary Graph Algorithms(2)
Week7:Minimum Spanning Trees
Week8:期中考週
Week9:Single-Source Shortest Paths
Week10:All-Pairs Shortest Paths
Week11:Matrix Operations
Week12:Number-Theoretic Algorithms
Week13:Computational Geometry
Week14:NP-Completeness(1)
Week15:NP-Completeness(2)
Week16:Approximation algorithms(1)
Week17:Approximation algorithms(2)
Week18:期末考週