天主教輔仁大學課程大綱天主教輔仁大學課程大綱

(1)

請尊重智慧財產權及著作權，不得非法影印任何有版權的著作請尊重智慧財產權及著作權，不得非法影印任何有版權的著作

Please respect the intellectual property rights and use the materials legally.

課程名稱

Course Title ^演算法

授課教師

Instructor ^范姜永益學年度

Academic year

97 ^學期

Semester 2

課程大綱

Objective

(1) Asymptotic notation is introduced to analyze the complexity of algorithms.

(2) Different approaches are discussed to solve computing problems, including divide-and-conquer, dynamic programming, greedy algorithms.

(3) P, NP, and NP-complete problems

教科書暨參考書籍: (尊重與保護智慧財產權，請使用正版教科書，勿非法影印書籍或教材，以免侵害他人著作權。)

reference books:

1. Cormen, Leiserson, Rivest. Introduction to Algorithms, 2001, MIT.（開發）

2. Introduction to the Design and Analysis of Algorithms - 第2版.

3. Foundations of Algorithms Using Java Psuedocode by Richard Neapolitan and kumarss Naimipour

課程進度參考章節

Introduction to algorithms/ Algorithm design Getting started/ Growth of functions

Recurrences/ Heapsort

Quicksort/Sort in linear time

Hash tables/binary search tree/ Red-black tree Binomial heaps/Fibonacci heaps

Midterm exam

Divide and conquer Dynamic programming Greedy algorithms

Elementary graph algorithms/Minimum spanning tree Single-source shortest paths/All-pairs shortest paths Introduction to NP-Completeness

Final exam 評分方式:

• Homework exercise: 10%

• Programming assignment: 15%

• Quiz: 10%

• Midterm exam: (30%)

• Final exam: (35%)'