教學大綱與進度
課程基本資料:
學年期
課號
課程名稱
階段
學分
時數
修
教師
班級
人
撤
備註
102-1
186216
電腦演算法
1
3.0
3
★
吳建文
資管所
19
0
教學大綱與進度:
教師姓名
吳建文
Email
xcwwu@ntut.edu.tw
最後更新時間
2013-06-03 12:44:53
課程大綱
The primary focus of the Computer Algorithm course is to enable students to use computers efficiently. This course teaches students how to design and analyze algorithms and how to apply algorithms to solve real world problems.
課程進度
Week 1: Introduction to computer algorithms Week 2: The complexity of algorithms Week 3: The greedy method Week 4: The divide and conquer strategy Week 5: The search strategies Week 6: Prune and search Week 7: Dyanmic programming Week 8: Midterm Week 9: NP-completeness Week 10: Approximation algorithms Week 11: Amortized analysis Week 12: Randomized algorithms Week 13: On-line algorithms Week 14: Topics on discrete optimization Week 15: Topics on existing NP-hard problems Week 16: Paper readings Week 17: Project presentation Week 18: Final
評量方式與標準
Homeworks: 20% Midterm: 30% Final: 30% Project: 20%
使用教材、參考書目或其他
【遵守智慧財產權觀念,請使用正版教科書,不得使用非法影印教科書】
使用外文原文書:
1. Introduction to algorithms, 2nd edition, Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., 2003, MIT press. 2. Introduction to desing and analysis of algorithms: a strategic approach, Lee, R.C.T., Tseng, S.S., Chang, R.C., Tsai, Y.T., 2005, Mc Graw Hill.
課程諮詢管道
備註