資料結構

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

課程大綱

C語言，指標，結構，陣列，堆疊，佇列，串列，樹狀結構 ，排列，搜尋。 This course is mainly aimed at introducing the data structures commonly used in programming languages,include (1)ADT (abstract data type) and complexity ,(2)static structures and their storage representation ,(3)recursion, stacks,and prefix,infix,and posfix expressions (4)queues (5)lists,linked lists,(6)trees,binary trees,height balanced trees,heaps,(7)graph,(8)soring,and(9)searching,hashing.

課程進度

Week 1: Course Introduction Week 2: Algorithms and Data Organization Week 3: Algorithms and Data Organization Week 4: Arrays Week 5: Stacks and Queues Week 6: Stacks and Queues Week 7: Linked Lists Week 8: Linked Lists Week 9: Midterm Exam Week 10: Trees Week 11: Trees Week 12: Graphs Week 13: Graphs Week 14: Sorting Week 15: Sorting Week 16: Hashing Week 17: Hashing Week 18: Final Exam

評量方式

Homework and In-Class Labs: 40% Midterm Exam: 30% Final Exam: 30%

教材

【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】 使用外文原文書：否 E. Horowitz, S. Sahni, and S. Anderson-Freed. Fundamentals of Data Structures in C 2/e, Silicon Press 蔡明志，資料結構：使用C語言(第六版)，全華圖書，2020。