本課程旨在帶領同學進入演算法的研習。演算法是資料結構的延續。學習過演算法才能設計出好的程式。我們在這門課當中將教導同學各種演算法的設計方法、演算法的複雜度觀念與分析、NP-完備理論、以及如何設計演算法解NP-完備問題等。學習這門課後，學生將在程式設計、演算法的設計與選擇上有明顯的專業素養。This course is designed to lead students into the study of algorithms. Algorithms are a continuation of data structures. Only by learning algorithms can you design good programs. In this course, we 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.
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and divide-and-conquer; dynamic programming; graph algorithms; shortest paths. To show not only how to solve particular problems, but also how to solve new problems when they arise in the future.
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and divide-and-conquer; dynamic programming; graph algorithms; shortest paths. To show not only how to solve particular problems, but also how to solve new problems when they arise in the future.
演算法(Algorithms)第二版,戴顯權著,滄海書局
Algorithms (Second Edition), written by Dai Xianquan, Canghai Book Company
| 評分項目 Grading Method | 配分比例 Grading percentage | 說明 Description |
|---|---|---|
| 小考一小考一 Quiz 1 |
15 | |
| 期中考期中考 midterm exam |
30 | |
| 小考一小考一 Quiz 1 |
15 | |
| 期末考期末考 final exam |
30 | |
| 出席與作業出席與作業 Attendance and homework |
10 |
