計算機概論
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
第1行: | 第1行: | ||
- | === '''資料結構 (2020 Fall, Fri 9:00AM~12:00AM)''' === | + | === '''資料結構 (2020 Fall, Fri 9:00AM~12:00AM)''' === |
+ | [http://wmi.ee.nsysu.edu.tw/enter/images/4/4a/DSch0Introduction.pdf Chapter 0. Introduction] | ||
+ | [http://wmi.ee.nsysu.edu.tw/enter/images/c/cb/DSch1.rar Chapter 1. Quick Review of C++] | ||
- | Chapter | + | Chapter 2. Arrays, Time Complexity, and Recursion |
- | Chapter | + | Chapter 3. Vectors |
- | Chapter | + | Chapter 4. Circular Lists and Iterators |
- | Chapter | + | Chapter 5. Stacks and Queues |
- | Chapter | + | Chapter 6. Trees |
- | Chapter | + | Chapter 7. Priority Queues: Heaps |
- | Chapter | + | Chapter 8: Unorder Maps: Hash Tables |
- | Chapter | + | Chapter 9: Self-Balancing Search Trees |
- | + | Chapter 10. Sorting | |
- | + | ||
- | + | ||
- | + | ||
- | Chapter 10. Sorting | + | |
Chapter 11. Graphs'''<br><br><br><br><br><br><br><br><br><br>大學部課程, 停開, 2019 Fall, Fri 1:10~4:00 PM, EC1001'''<br> | Chapter 11. Graphs'''<br><br><br><br><br><br><br><br><br><br>大學部課程, 停開, 2019 Fall, Fri 1:10~4:00 PM, EC1001'''<br> |
在2020年9月10日 (四) 03:39所做的修訂版本
資料結構 (2020 Fall, Fri 9:00AM~12:00AM)
Chapter 1. Quick Review of C++
Chapter 2. Arrays, Time Complexity, and Recursion
Chapter 3. Vectors
Chapter 4. Circular Lists and Iterators
Chapter 5. Stacks and Queues
Chapter 6. Trees
Chapter 7. Priority Queues: Heaps
Chapter 8: Unorder Maps: Hash Tables
Chapter 9: Self-Balancing Search Trees
Chapter 10. Sorting
Chapter 11. Graphs
大學部課程, 停開, 2019 Fall, Fri 1:10~4:00 PM, EC1001
Chapter 5. Computer Organization
Chapter 9. Programming Languages