「資料結構」這門課主要是探討如何將資料更有組織地存放到電腦中,以提昇程式之執行效率的一門學問,有良好的資料結構及有效率的演算法將可以提昇程式的執行效率。在本門課程中,包含有陣列(Array)、堆疊(Stack)、佇列(Queue)、串列(Link list)、樹狀(Tree)、圖形(Graph)、排序(Sort)及搜尋(Search)等單元,教導同學了解何謂資料結構, 資料如何在電腦中表示、儲存、與運用,並經由本課程,訓練與奠基同學解決問題的能力與程式設計的技術。
The purpose of this course will focus on the issues that how is data stored in the computer in order to increase the efficiency of program. Various topics will be introduced which include array, stack, queue, link list, tree, graph, sort and search. Students will have practical assignments utilizing the topics described, and have a final project.
先修科目Prerequisites
教學方式Teaching Methods
講課
Lecturing
學生實作
Student hands-on practice
習題練習
Exercise
1. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, “Fundamentals of Data Structures in C,” Computer Science Press, New York, 1993.
2. 戴顯權, 資料結構 滄海圖書