資料結構
Data Structures
| 節 | 週二 | 週四 |
|---|---|---|
5 13:20–14:10 | 資料結構 EDB27（光復） 2 節連堂 | |
6 14:20–15:10 | ||
8 16:30–17:20 | 資料結構 EDB27（光復） |
* 根據陽明交大上課時間表所列
1. Understand the fundamental concepts of data structures 2. Learn algorithms to solve most common classical problems 3. Know the underlying principles of C++ Standard Template Library 4. Be able to construct efficient computer programs
Computer programming Familiar with basic C++ constructs
無備註
1. Lectures are available on the course webpage. 2. All course related information can also be found on the course webpage.
1. Midterm: 30% 2. Final Exam : 30% 3. Programming Assignments: 30% 4. Attendance: 10%
1. Introduction to Abstract Data Type (ADT)
2. Arrays
3. Stacks and Queues
4. Linked Lists
5. Trees
6. Graphs
7. Sorting
8. Hashing
教師未提供此項資料
E. Horowitz, S. Sahni, and D. P. Mehta, “Fundamentals of Data Structures in C++,” 2nd Ed., 2007, Silicon Press, ISBN: 0-929306-37-6.
- 地點
- ED621
- 時間
- 4CD, by appointment first
- 聯絡方式
- ext. 31372 jdhuang@mail.nctu.edu.tw