課程介紹
1. Study design, analysis, correctness proof, and implementation of algorithms for solving problems by computers.
2. Learn strategies for solving problems, techniques for designing and analyzing algorithms, and details for efficient implementations of algorithms in computers.
2. Learn strategies for solving problems, techniques for designing and analyzing algorithms, and details for efficient implementations of algorithms in computers.
============================================
FClass time: (一)3-4、(三)4
FClassroom: U517
FTA: 李承翰，Email: jonathan10000659@gmail.com
FOffice Hours: (一)8-9
教科書:
FTextbook
1.Introduction to Algorithms, Third Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. (CLS) (開發代理)
2.Foundations of Algorithms, Fifth Edition, Richard Neapolitan (R) (開發代理)
FReferences
1.Algorithms, 4th Edition, Robert Sedgewick and Kevin Wayne.
2.演算法(第五版)--使用C++虛擬碼,Foundations of Algorithms, Fifth Edition, 作者： Richard Neapolitan, 譯者：蔡宗翰, 2017 (碁峯資訊)
教學進度:
Week #1:Introduction to algorithm (the role of algorithm in computing)
Week #2-#4: Complexity Analysis
Week #4-#5: Sorting and Divide-and-Conquer
Week #5-#6: Sorting
Week #7-#8: Data structure (elementary data structure, hash table, binary search tree, B-tree, red-black tree)
Week #9-#10: midterm exam (report)
Week #11-#12:Graph Search and Connectivity
Week #12-#13: Minimum Spanning Trees、 Greedy algorithms
Week #14-#15: Shortest Paths、Dynamic programming
Week #16: NP-complete、 Genetic Algorithm
Week #17-#18: final-term exam (report)
Week #2-#4: Complexity Analysis
Week #4-#5: Sorting and Divide-and-Conquer
Week #5-#6: Sorting
Week #7-#8: Data structure (elementary data structure, hash table, binary search tree, B-tree, red-black tree)
Week #9-#10: midterm exam (report)
Week #11-#12:Graph Search and Connectivity
Week #12-#13: Minimum Spanning Trees、 Greedy algorithms
Week #14-#15: Shortest Paths、Dynamic programming
Week #16: NP-complete、 Genetic Algorithm
Week #17-#18: final-term exam (report)
本課程不開放報名
