演算法導論
Introduction to Algorithms
學期
110-1
學分
3
學分
當期課號
1048
永久課號
UEE2704
開課單位
電機工程學系
授課教師
陳宏明
校區
光復
類別
選修
上課時間表
| 節 | 週二 | 週四 |
|---|---|---|
3 10:10–11:00 | 演算法導論 ED116 2 節連堂 | |
4 11:10–12:00 | ||
5 13:20–14:10 | 演算法導論 ED116 |
* 根據陽明交大上課時間表所列
概述
This course will be focused on the construction and analysis of computer algorithms. The objectives include the introduction to the fundamental data structures and applications, and the introduction of problem solving paradigms. The complexity of functions and algorithms will also be depicted.
先修科目
Data Structures
評分方式
- Homework assignments + programming labs 60% - Two tests (Midterm: 20% + Final: 20%)
課程大綱
- 1. Review of data structures and algorithm basics 2. Algorithm design and analysis techniques 3. Graph algorithms (including network flow and matching) 4. Intro to NP-completeness
週次計畫
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction 9/14 https://meet.google.com/fbg-jxit-hag 9/16 https://meet.google.com/njh-oiui-pyh |
| 第 2 週 | Introduction https://meet.google.com/njh-oiui-pyh |
| 第 3 週 | Sorting |
| 第 4 週 | Trees |
| 第 5 週 | Trees and DP Meet physically and online |
| 第 6 週 | DP |
| 第 7 週 | DP and greedy algorithm |
| 第 8 週 | Graph |
| 第 9 週 | 11/9 Midterm 11/11 no class |
| 第 10 週 | Graph |
| 第 11 週 | Graph |
| 第 12 週 | Network flows |
| 第 13 週 | Network flows |
| 第 14 週 | NP-hardness |
| 第 15 週 | NP-hardness/selected topics |
| 第 16 週 | Final exam week |
教科書
Corman et.al, “Introduction to Algorithm,” MIT Press, 2003 References: 1. S. Dasgupta et.al, "Algorithms,"McGraw Hill, 2008
Office Hours
- 地點
- ED 407
- 時間
- Thurs 2:10-3pm (by appointment)
- 聯絡方式
- hmchen@mail.nctu.edu.tw