查詢教學大綱與進度

教學大綱與進度

課程基本資料：

學年期課號課程名稱階段學分時數修教師班級人撤備註

110-1 294326 演算法分析與設計 1 3.0 3 ★ 劉傳銘資工四 33 3 ◎電資外生四及所和資工四及所合開

學年期	課號	課程名稱	階段	學分	時數	修	教師	班級	人	撤	備註
110-1	294326	演算法分析與設計	1	3.0	3	★	劉傳銘	資工四	33	3	◎電資外生四及所和資工四及所合開

教學大綱與進度：

教師姓名劉傳銘

Email cmliu@ntut.edu.tw

最後更新時間 2021-08-30 15:12:14

課程大綱 The course gives a broad introduction about the design and analysis of computer algorithms. General topics to be covered include: growth of functions, recurrences, sorting and order statistics, fundamental and advanced data structures, dynamic programming, greedy algorithms, graph algorithms, and NP-completeness.

課程進度 1. Introduction (0.5 week) 2. Asymptotic analysis (1.5 weeks) 3. Recurrence Relations (1 week) 4. Advanced Data Structures (2 weeks) 5. Average and worst analysis (1 weeks) 6. Lower Bounds (1 week) 7. Dynamic Programming (2 weeks) 8. Graph algorithms (1.5 weeks) 9. Search and Traversal Techniques (1.5 week) 10. NP-Completeness (2 weeks) 11. Approximation Algorithms (1 week) 12. New Trends in Algorithms (2 weeks) (* 1 week for exams, including midterm and final)

評量方式與標準 Assignments (40%): 7-9 homework sets. Midterm (25%) Final exam (35%)

使用教材、參考書目或其他 【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】

使用外文原文書：是
Textbook: Introduction to Algorithms, 3nd edition. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. MIT Press Edition, 2009. References: 1. Computer Algorithms /C++, 2nd Edition. E. Horowitz, S. Sahni, and S. Rajasekaran, W.H. Freeman and Company, 1998. 2. Computer Algorithms, 3rd edition. S. Baase and A. V. Gelder. Addison-Wesley, 2000. 3. Algorithms in C++, 3rd. R. Sedgewick. Addison-Wesley, 1998. 4. Algorithms, R. Johnsonbaugh and M. Schaefer, Pearson Prentice Hall, 2004. 5. Algorithm Design, Jon Kleinberg and ?va Tardos, Pearson/Addison-Wesley, 2006. 6. Algorithms, Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw-Hill, 2008. ISBN:978-007-125975-0.

課程諮詢管道 Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams)
Line ID: mobile.prof
FB: facebook.com/howard.liu.5
Phone: 4251 (in school)

備註因應疫情發展，本學期教學及授課方式請依照學校網頁所公布之訊息為準：
(https://oaa.ntut.edu.tw/p/404-1008-98622.php?Lang=zh-tw)

●上課方式：遠距上課

●評量方式：
For evaluation, in this course, a problem set will be given for midterm exam and the final exam will be a report on some specific topics for students to explore instead.
●補充說明資訊：

教師姓名	劉傳銘
Email	cmliu@ntut.edu.tw
最後更新時間	2021-08-30 15:12:14
課程大綱	The course gives a broad introduction about the design and analysis of computer algorithms. General topics to be covered include: growth of functions, recurrences, sorting and order statistics, fundamental and advanced data structures, dynamic programming, greedy algorithms, graph algorithms, and NP-completeness.
課程進度	1. Introduction (0.5 week) 2. Asymptotic analysis (1.5 weeks) 3. Recurrence Relations (1 week) 4. Advanced Data Structures (2 weeks) 5. Average and worst analysis (1 weeks) 6. Lower Bounds (1 week) 7. Dynamic Programming (2 weeks) 8. Graph algorithms (1.5 weeks) 9. Search and Traversal Techniques (1.5 week) 10. NP-Completeness (2 weeks) 11. Approximation Algorithms (1 week) 12. New Trends in Algorithms (2 weeks) (* 1 week for exams, including midterm and final)
評量方式與標準	Assignments (40%): 7-9 homework sets. Midterm (25%) Final exam (35%)
使用教材、參考書目或其他	【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】使用外文原文書：是 Textbook: Introduction to Algorithms, 3nd edition. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. MIT Press Edition, 2009. References: 1. Computer Algorithms /C++, 2nd Edition. E. Horowitz, S. Sahni, and S. Rajasekaran, W.H. Freeman and Company, 1998. 2. Computer Algorithms, 3rd edition. S. Baase and A. V. Gelder. Addison-Wesley, 2000. 3. Algorithms in C++, 3rd. R. Sedgewick. Addison-Wesley, 1998. 4. Algorithms, R. Johnsonbaugh and M. Schaefer, Pearson Prentice Hall, 2004. 5. Algorithm Design, Jon Kleinberg and ?va Tardos, Pearson/Addison-Wesley, 2006. 6. Algorithms, Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw-Hill, 2008. ISBN:978-007-125975-0.
課程諮詢管道	Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)
備註	因應疫情發展，本學期教學及授課方式請依照學校網頁所公布之訊息為準： (https://oaa.ntut.edu.tw/p/404-1008-98622.php?Lang=zh-tw) ●上課方式：遠距上課 ●評量方式： For evaluation, in this course, a problem set will be given for midterm exam and the final exam will be a report on some specific topics for students to explore instead. ●補充說明資訊：