| 當期課號 | 2412 | Course Number | 2412 |
|---|---|---|---|
| 授課教師 | 姚志佳 | Instructor | YAO,CHIH CHIA |
| 中文課名 | 資料結構 | Course Name | Data Structure |
| 開課單位 | 資訊工程系(四日)二C | Department | |
| 修習別 | 必修 | Required/Elective | Required |
| 學分數 | 3 | Credits | 3 |
| 課程目標 | 本課程主要講述有關資料的處理及儲存方式。學生在本課程中，將可學到以下幾個主題：1.陣列 2. 堆疊 3. 串列 4. 樹 5. 圖形理論 6. 排序。學生學完本課程後可利用本課程內的知識對資料進行更有效率的處理。 | Objectives | "The goal of this course is to provide the students how to store data with how to process data. The covered issues in this course includes 1. array 2. stack 3. link list 4. tree 5. graph theory 6. sorting. After this course, the students can process the data more efficient. " |
| 教材 | Fundamentals of Data Structures in C/C++, Horowitz, 2nd Edition, Silicon Press. | Teaching Materials | Fundamentals of Data Structures in C/C++, Horowitz, 2nd Edition, Silicon Press. |
| 成績評量方式 | 1. 作業: 30% 2. 期中考: 30% 3. 期末: 30% 4. 課堂參與: 10% |
Grading | 1. Homework: 30% 2. Midterm Exam.:30% 3. Final Project: 30% 4. Class Participation: 10% |
| 教師網頁 | http://www.cyut.edu.tw/~ccyao | ||
| 教學內容 | 1.Review algorithms and arrays 2.Stacks and Queues 3.Linked Lists 4.Trees 5.Graphs 6.Internal Sorting 7.External Sorting 8.Hashing |
Syllabus | 1.Review algorithms and arrays 2.Stacks and Queues 3.Linked Lists 4.Trees 5.Graphs 6.Internal Sorting 7.External Sorting 8.Hashing |