| 當期課號 | 3697 | Course Number | 3697 |
|---|---|---|---|
| 授課教師 | 林芳昌 | Instructor | LIN,FANG CHANG |
| 中文課名 | 資料結構 | Course Name | Data Structure |
| 開課單位 | 資訊管理系(二進)四A | Department | |
| 修習別 | 必修 | Required/Elective | Required |
| 學分數 | 3 | Credits | 3 |
| 課程目標 | 本課程將探討抽象的資料組合觀念，進而說明如何以程式語言將這些觀念具體化，以模擬出電腦內部真正處理資料的方式，其所涵蓋的範圍包含陣列、鏈結串列、堆疊、佇列、二元樹、圖形結構、資料排序及資料搜尋等。 | Objectives | This course will focus on data structures for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks will be covered. Some basic graph, sorting and searching algorithms will also be discussed. |
| 教材 | "Fundamentals of Data Structures in C++," Second Edition, Ellis Horowitz, Sartaj Sahni, and Dinesh P. Mehta, Silicon Press, 2007. |
Teaching Materials | "Fundamentals of Data Structures in C++," Second Edition, Ellis Horowitz, Sartaj Sahni, and Dinesh P. Mehta, Silicon Press, 2007. |
| 成績評量方式 | 1. 作業與平時成績 40-60% 2. 期中考 20-30% 3. 期末考 20-30% |
Grading | 1. Exercises and Participation 40-60% 2. Midterm Exam. 20-30% 3. Final Exam. 20-30% |
| 教師網頁 | 上課時公告 | ||
| 教學內容 | 本課程介紹以下資料結構的主題: 1. Array 2. Stacks and Queues 3. Linked Lists 4. Trees 5. Graphs 6. Sorting 7. Searching |
Syllabus | This course will introduce the techniques used on data structures, including the following topics. 1. Array 2. Stacks and Queues 3. Linked Lists 4. Trees 5. Graphs 6. Sorting 7. Searching |