演算法導論
Introduction to Algorithms
學期
114-2
學分
3
學分
當期課號
515132
永久課號
EEEC20046
開課單位
電機工程學系
授課教師
余俊宏
校區
光復
類別
選修
上課時間表
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 演算法導論 ED219 2 節連堂 | |
4 11:10–12:00 | ||
7 15:30–16:20 | 演算法導論 ED219 |
* 根據陽明交大上課時間表所列
概述
教授演算法之相關基礎知識、含基本資料結構與主題 Divide and Conquer、Dynamic programming、Graph algorithms
先修科目
計算機概論、C\C++
教學方式
使用上課講義
評分方式
Homework 40% Midterm exam 30% Final exam 30%
週次計畫
| 週次 | 主題 |
|---|---|
| 第 1 週 | Getting started、 introduction of the course. |
| 第 1 週 | Getting started、 introduction of the course. |
| 第 2 週 | Growth of Functions: Asymptotic notation. |
| 第 2 週 | Growth of Functions: Asymptotic notation. |
| 第 3 週 | Divide-and-Conquer: the maximum-subarray problem. |
| 第 3 週 | Divide-and-Conquer: the maximum-subarray problem. |
| 第 4 週 | Solving recurrences: the substitution method、the recursion-tree method、the master method |
| 第 4 週 | Solving recurrences: the substitution method、the recursion-tree method、the master method |
| 第 5 週 | Heaps and Heapsort |
| 第 5 週 | Heaps and Heapsort |
| 第 6 週 | Probabilistic Analysis and Randomized Algorithms |
| 第 6 週 | Probabilistic Analysis and Randomized Algorithms |
| 第 7 週 | Midterm、 Quicksort |
| 第 7 週 | Midterm、 Quicksort |
| 第 8 週 | Sorting in Linear Time |
| 第 8 週 | Sorting in Linear Time |
| 第 9 週 | Elementary Data Structures |
| 第 9 週 | Elementary Data Structures |
| 第 10 週 | Binary Search Trees |
| 第 10 週 | Binary Search Trees |
| 第 11 週 | Dynamic Programming: Rod cutting、Elements of dynamic programming |
| 第 11 週 | Dynamic Programming: Rod cutting、Elements of dynamic programming |
| 第 12 週 | Dynamic Programming: Longest common subsequence Greedy Algorithms |
| 第 12 週 | Dynamic Programming: Longest common subsequence Greedy Algorithms |
| 第 13 週 | Elementary Graph Algorithms: Breadth-first search、Depth-first search、Topological sort |
| 第 13 週 | Elementary Graph Algorithms: Breadth-first search、Depth-first search、Topological sort |
| 第 14 週 | Minimum Spanning Trees: The algorithms of Kruskal and Prim |
| 第 14 週 | Minimum Spanning Trees: The algorithms of Kruskal and Prim |
| 第 15 週 | Single-Source Shortest Paths: The Bellman-Ford algorithm、Dijkstra’s algorithm |
| 第 15 週 | Single-Source Shortest Paths: The Bellman-Ford algorithm、Dijkstra’s algorithm |
| 第 16 週 | Final exam |
| 第 16 週 | Final exam |
教科書
Introduction to Algorithms by Cormen et al., 3rd edition.
Office Hours
- 地點
- 工四703
- 時間
- By Appointment.
- 聯絡方式
- email: yuji@nycu.edu.tw