1 / 3

演算法課程簡介

演算法課程簡介. 許智舜 cshsu@cc.shu.edu.tw Office: S515 Tel:3351. 課程目標與要求. 目標：使學生學會如何分析與設計演算法。 成績評定：期中考 (35%) 、期末考 (35%) 、出席 (15%) 、作業 (15%) 。 先修課程：程式設計、資料結構、離散數學 教科書： Anany Levitin, "The Design and Analysis of Algorithms", Addison Wesley, second edition, 2007. 課程大綱. 重要問題型態與資料結構 演算法效率分析的基礎

sela
Download Presentation

演算法課程簡介

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 演算法課程簡介 許智舜 cshsu@cc.shu.edu.tw Office: S515 Tel:3351

  2. 課程目標與要求 • 目標：使學生學會如何分析與設計演算法。 • 成績評定：期中考(35%)、期末考(35%)、出席(15%)、作業(15%)。 • 先修課程：程式設計、資料結構、離散數學 • 教科書：Anany Levitin, "The Design and Analysis of Algorithms", Addison Wesley, second edition, 2007

  3. 課程大綱 • 重要問題型態與資料結構 • 演算法效率分析的基礎 • 演算法效率分析的方法 • 暴力法(Brute Force) • 分化征服法(Divide and Conquer) • 減少征服法(Decrease and Conquer) • 轉換征服法(Transform and Conquer) • 空間與時間的取捨 • 動態規劃(Dynamic Programming) • 貪婪的技巧(Greedy Techniques) • 反覆的改進(Iterative Improvement) • 演算法的限制 • 對付演算法限制的方法

More Related