讓修課同學瞭解資料結構的意義，課堂中一項介紹各種不同的資料結構，包括：Arrays & Structures、Stacks and Queues、Linked Lists、Trees、Graphs、Sorting 、Hashing、Priority Queues、Efficient Binary Search Trees、Multiway Search Trees與Digital Search Structures等，及各種資料結構之應用。Let students in the class understand the meaning of data structures. A class introduces various data structures, including: Arrays & Structures, Stacks and Queues, Linked Lists, Trees, Graphs, Sorting, Hashing, Priority Queues, Efficient Binary Search Trees, Multiway Search Trees and Digital Search Structures, etc., as well as the application of various data structures.
Fundamentals of Data Structures in C, 2/e
by E. Horowitz、S. Sahni、D.P. Mehta
Silicon Press
Published in 2007,
ISBN:0929306406
Fundamentals of Data Structures in C, 2/e
by E. Horowitz, S. Sahni, D.P. Mehta
Silicon Press
Published in 2007,
ISBN:0929306406
| 評分項目 Grading Method | 配分比例 Grading percentage | 說明 Description |
|---|---|---|
| Mid-term ExaminationMid-term Examination Mid-term Examination |
30 | The score of Mid-term examination. |
| Final ExaminationFinal Examination Final Examination |
30 | The scope of Final examination includes the topics introduced in the last 8 weeks. |
| Homework, exercises and Quizzes Homework, exercises and Quizzes Homework, exercises and Quizzes |
5 | Every hour of our classes, students have to signed their names. Absent from the class for one hour, the total score of this item will reduced by 5 marks. |
