一、課程說明(Course Desc<x>ription)
<br>
<br>
<br>
<br>先修：計算機程式語言設計(一)及(二)、資料結構
<br>
<br>
<br>
<br>目的：讓學生具有發現問題、定義問題、設計程式以解決問題的能力，並加強學生的邏輯思考能力。
<br>
<br>
<br>
<br>課程大網：
<br>
<br>           
<br>
<br>I. Foundations
<br>
<br>
<br>
<br>     1. The Role of Algorithms in Computing
<br>
<br>　   2. Getting Started
<br>
<br>     3. Growth of Functions
<br>
<br>     4. Divide and Conquer
<br>
<br>     
<br>
<br> II. Sorting and Order Statistics
<br>
<br>
<br>
<br>     6. Heapsort
<br>
<br>     7. Quicksort
<br>
<br>     8. Sorting In Linear Time
<br>
<br>     9. Medians and Order Statistics
<br>
<br>
<br>
<br>IV. Advanced Design and Analysis Techniques
<br>
<br>       
<br>
<br>    15. Dynamic Programming
<br>
<br>    16. Greedy Algorithms + Branch-and-Bound Algorithm
<br>
<br>    17. Amortized Analysis
<br>
<br>    
<br>
<br>VI. Graph Algorithms
<br>
<br>          
<br>
<br>    22. Elementary Graph Algorithms
<br>
<br>    23. Minimum Spanning Trees
<br>
<br>    24. Single-Source Shortest Paths
<br>
<br>    25. All-Pairs Shortest Paths
<br>
<br>    26. Maximum Flow  (option)   
<br>
<br>           
<br>
<br>VII. Selected Topics
<br>
<br>          
<br>
<br>    34. NP-Completeness
<br>
<br>    35. Approximation Algorithms     
<br>
<br>
<br>
<br> 二、指定用書(Text Books)
<br>
<br>
<br>
<br>T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 3rd 
<br>
<br>edition, the MIT press, 2009.
<br>
<br>
<br>
<br>
<br>
<br>三、參考書籍(References)
<br>
<br>
<br>
<br>Richard Neapolitan and Kumarss Naimipour, Foundations of Algorithms, 4th 
<br>
<br>edition, Jones and Bartlett, 2010
<br>
<br>
<br>
<br>
<br>
<br>四、教學方式(Teaching Method)
<br>
<br>
<br>
<br>課堂投影片教學。
<br>
<br>
<br>
<br>五、成績考核(Evaluation)
<br>
<br>
<br>
<br>1. 課堂表現 (含隨堂考)
<br>
<br>2. 作業 (紙本及程式)
<br>
<br>3. 小考
<br>
<br>4. 期中考 
<br>
<br>5. 期末考
<br>
<br>(以上成績百分比，將視課堂狀況決定) 
<br>
<br>