資料結構
Data Structure
| 節 | 週一 | 週三 |
|---|---|---|
2 09:00–09:50 | 資料結構 ED220 | |
3 10:10–11:00 | 資料結構 ED220 2 節連堂 | |
4 11:10–12:00 |
* 根據陽明交大上課時間表所列
- Study how to represent data, how to manipulate them, and how to analyze the efficiency - Understand the fundamental concepts of data structures - Learn algorithms to solve most common classical problems - Know the underlying principles of C++ Standard Template Library - Be able to construct efficient computer programs
Computer programming (C/C++)
All course information and lecture notes will be posted on https://e3.nycu.edu.tw/. 本課程將採實體線上同步,線上Webex連結: https://tinyurl.com/nycueeds2022
Tentative grading policy: - Programming assignments (40%) - Midterm (30%) - Final (30%) The exact grading policy will be announced in class.
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction |
| 第 2 週 | Arrays |
| 第 3 週 | Stacks and Queues |
| 第 4 週 | Stacks and Queues |
| 第 5 週 | Linked Lists |
| 第 6 週 | Trees |
| 第 7 週 | Trees |
| 第 8 週 | Midterm |
| 第 9 週 | Graphs |
| 第 10 週 | Graphs |
| 第 11 週 | Sorting |
| 第 12 週 | Sorting |
| 第 13 週 | Hashing |
| 第 14 週 | Hashing |
| 第 15 週 | Other Advanced Topics |
| 第 16 週 | Final |
E. Horowitz, S. Sahni, and D. P. Mehta, “Fundamentals of Data Structures in C++,” 2nd Ed., 2007, Silicon Press, ISBN: 0-929306-37-6.
- 地點
- Online
- 時間
- By appointment
- 聯絡方式
- mphlin@nycu.edu.tw