教學大綱與進度

課程基本資料：

學年期	課號	課程名稱	階段	學分	時數	修	教師	班級	人	撤	備註
110-2	297236	資料結構	1	3.0	3	★	李曉祺	電機一丙	55	17	◎計中教室,新聘

教學大綱與進度：

教師姓名	李曉祺
Email	hcli@mail.ntut.edu.tw
最後更新時間	2022-02-16 11:31:15
課程大綱	C語言，指標，結構，陣列，堆疊，佇列，串列，樹狀結構，排列，搜尋。 This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized.
課程進度	Week 1-2: Course Overview; Fundamental Mathematical Tools Week 3-4: Algorithms: Analysis, complexity, and the lower bound of problems Week 5-7: Stacks, Queues, Trees, Dictionaries Week 8: Graphs Week 9: Midterm Week 10: Heaps, Sets Week 11: Sorting Week 12: The greedy Method Week 13: The Divide-and-Conquer Strategy Week 14: Tree Searching Strategies; Prune and Search Week 15: Dynamic programming Week 16: Shortest Paths Week 17: The theory of NP-Completeness Week 18: Final
評量方式與標準	Grading - Homework 15% Quiz 10% Midterm 30% Final 35% Attendance 10% Policy on Copying - Copying is not acceptable. Do your own work.
使用教材、參考書目或其他	【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】 使用外文原文書：是 Textbook - Horowitz, Fundamentals of Data Structures in C 2/e, Silicon Press Reference - Horowitz, Ellis, S. Sahni, and S. Rajasekaran, Computer Algorithms / C++. Summit, NJ: Silicon Press, 2007. M.T, Goodrich and R. Tamassia, Algorithm Design, John Wiley & Sons. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Edition, The MIT Press, 2009.
課程諮詢管道
課程對應SDGs指標
課程是否導入AI
備註	1. 相關課程公告與相關事項將會發布於 google classroom (開學後建立)。 2. 若因COVID-19疫情影響將提供 Microsoft teams 線上同步教學。