103年第1學期-1162 演算法則 課程資訊

課程分享

選課分析

本課程名額為 75人,已有94人選讀,尚餘名額-19人。

評分方式

評分項目 配分比例 說明
期中考 20
期末考 25
作業與小考 50 原則上3次作業3次小考
平時分數 5 出席及上課表現

授課教師

黃育仁

教育目標

主要內容: The Role of the Algorithms in Computer 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.

課程資訊

參考書目

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd Edition, 2009 MIT (開發代理)