主要內容:
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
在資訊科學裡，演算法指的是解決一個特定計算問題的流程。這個流程清楚定義了一個可執行步驟的順序，依次計算問題的輸入，得到輸出結果。在這個課程裡面，同學們將透過範例問題的分析，學習到一些常見的演算法設計理念，與評估演算法優缺點的技巧。 1. 透過課堂講解，了解演算法的理論與應用。 2. 透過作業練習，掌握設計與分析演算法的技巧。
In information science, an algorithm refers to a process for solving a specific computational problem. This process clearly defines a sequence of executable steps that sequentially calculate the input to the problem and obtain the output. In this course, students will learn some common algorithm design concepts and techniques for evaluating the advantages and disadvantages of algorithms through the analysis of example problems. 1. Understand the theory and application of algorithms through classroom explanations. 2. Master the skills of designing and analyzing algorithms through homework exercises.
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 | 出席及上課表現 |
