資料結構

臺北科技大學 115-1 學期課程，課號 366594。

課程大綱

瞭解程式語言所常用之各種資結構，１.抽象資料類別及運算複雜度之概念，２.靜態結構及其儲存法，３.遞迴、堆疊、前序、中序、後序運算式，４.佇列，５.串列、鏈結串列，６.樹、二元樹、平衡樹、堆積，７.圖形，８.排序，９.搜尋、雜湊。 This course is mainly aimed at introducing the data structures commonly used in programming, including: (1) the concept of ADT (abstract data type) and C++ programming language, (2) static structures and their storage representations, array and linked lists (3) computational complexity, (4) recursion, stacks, and prefix, infix, and postfix expressions, (5) queues, (6) lists and linked lists, (7) trees, tree traversal algorithms, and binary trees, (8) heaps and priority queues, (9) soring, searching and hashing, (10) graphs.

課程進度

1. Introduction 2. C++ and Object-Oriented Programming 3. No Class (中秋節) 4. Array and Linked Lists 5. No Class (國慶日補假) 6. Analysis of Algorithms 7. Stacks 8. Mid-term Exam 9. Queues 10. Vector, List and Sequence 11. Trees 12. Heaps and Priority Queues 13. Hash Tables, Search Trees 14. Sorting, Sets, and Selection 15. Final Exam 16. No Class (行憲紀念日)

評量方式

Grading: 10% Attendance and Quizzes 30% Assignments ( Flexible Learning and Term project ) 30% Mid-term Exam 30% Final Exam

教材

【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】 使用外文原文書：是 Reference books: 1. Michael T. Goodrich, Roberto Tamassia, and David M. Mount, Data Structures and Algorithms in C++, Second Edition, John Wiley & Sons, Inc, 2011. (ISBN-13 978-0-470-38327-8) 2. Robert Lafore, Teach Yourself Data Structures and Algorithms in 24 hours, Sams Publishing, 1999. (ISBN 0-67231-633-1) 3. Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed, Fundamentals of Data Structures in C, 2nd Edition, Silicon Press, 2008. (ISBN 9780929306407)