資料結構

臺北科技大學 114-2 學期課程，課號 355457。

課程大綱

C語言、指標、結構、陣列、堆疊、佇列、串列、樹狀結構、排列、搜尋。 This course covers concepts of computation used in the 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-5: Algorithms: Analysis, complexity, and the lower bound of problems Week 6-8: Array, Linked List, Stacks, and Queues Week 9: Midterm Week 10-11: Trees Week 12-13: Graphs Week 14: Sorting Week 15: Hashing Week 16: Selected Topic (1) - Algorithm Strategies Week 17: Selected Topic (2) - Dynamic Programming Week 18: Final

評量方式

Grading - Homework 20% (Programming in C) Labs 15% Midterm 30% Final 35% 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.