主要內容:
The Role of the Algorithms in Computer
Growth of Functions
Recurrences
Sorting
Elementary data structures
Binary Search Tree
Dynamic program
Greed algorithm
Graph
NP CompletenessMain content:
The Role of the Algorithms in Computers
Growth of Functions
Recurrences
Sorting
Elementary data structures
Binary Search Tree
Dynamic program
Greed algorithm
Graph
NP Completeness
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.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd Edition, 2009 MIT (開發代理)
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd Edition, 2009 MIT (Development Agent)
| 評分項目 Grading Method | 配分比例 Grading percentage | 說明 Description |
|---|---|---|
| 期中考期中考 midterm exam |
20 | |
| 期末考期末考 final exam |
25 | |
| 作業與小考作業與小考 Assignments and quizzes |
50 | 原則上3次作業3次小考 |
| 平時分數平時分數 usual scores |
5 | 出席及上課表現 |
