本課程旨在帶領同學進入演算法的研習。演算法是程式設計方法的探討，學習過演算法才能設計出好的程式。這門課當中將教導同學各種演算法的設計方法、演算法的複雜度觀念與分析、NP-完備理論、以及如何設計演算法解NP-完備問題等。學習這門課後，學生將在程式設計、演算法的設計與選擇上有明顯的專業素養。This course aims to lead students into the study of algorithms. Algorithms are the discussion of programming methods. Only by learning algorithms can you design good programs. This course will teach students the design methods of various algorithms, the concept and analysis of complexity of algorithms, NP-complete theory, and how to design algorithms to solve NP-complete problems, etc. After studying this course, students will have obvious professional qualities in programming and algorithm design and selection.
1.R.C.T. Lee, S.S. Tseng, R.C. Chang, Y.T.Tsai, Introduction to the Design and Analysis of Algorithms: a strategic approach, 東華書局代理
2.演算法(第四版), 滄海書局, 戴顯權著
1.R.C.T. Lee, S.S. Tseng, R.C. Chang, Y.T.Tsai, Introduction to the Design and Analysis of Algorithms: a strategic approach, agent of Donghua Book Company
2. Algorithm (4th edition), Canghai Bookstore, written by Dai Xianquan
| 評分項目 Grading Method | 配分比例 Grading percentage | 說明 Description |
|---|
