演算法 李朱慧
演算法的課程目的 學習已知常用的演算法 分析程式複雜度 複雜度 vs 執行時間 學習思考過程方式
演算法的用途 在資源有限的平台下發展程式時 手機 android 程式 嵌入式系統 IC 設計 處理大量資料時 PC 程式
Textbook Introduction to algorithms, second edition Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, 開發圖書有限公司, (02)
Course Outline: 1.Foundations 1.The Role of Algorithms in ComputingThe Role of Algorithms in Computing 2.Getting Started.Getting Started 3.Growth of FunctionsGrowth of Functions 4.RecurrencesRecurrences
Course Outline: II Sorting and Order Statistics 6.Heapsort.Heapsort 7.QuicksortQuicksort 8.Sorting in Linear TimeSorting in Linear Time
Course Outline: III Data Structures 9.Medians and Order StatisticMedians and Order Statistic 11.Hash TablesHash Tables 12.Binary Search TreesBinary Search Trees Red-Black Trees
Course Outline: IV Advanced Design and Analysis Techniques 15.Dynamic ProgrammingDynamic Programming 16.Greedy AlgorithmGreedy Algorithm 17.NP-CompletenessNP-Completeness
評分方式 Grading Policy: Midterm Examination: 35% Final Examination: 35% Class participation and Homework: 30%
上課請假 如果有發燒,請同學代為請假即可,不需證明。
老師聯絡方式 msn: 研究室 : T2-938 Homepage: 會面時間