資料結構與演算法
Data Structures and Algorithms
| 節 | 週二 |
|---|---|
7 15:30–16:20 | 資料結構與演算法 SC158 3 節連堂 |
8 16:30–17:20 | |
9 17:30–18:20 |
* 根據陽明交大上課時間表所列
- Understand basic data structures like arrays, linked lists, trees and graphs. - Learn basic algorithms like sorting, searching and traversal. - Analyze the performance of algorithms using time complexity. - Implement solutions upon appropriate data structure and algorithm by Python.
Python programming skill.
1. This course requires all examples, assignments, and exams to be implemented in Python. 2. Students are required to bring a laptop for course-related practical sessions. 3. Overdue assignments will not be accepted. 4. The project would be conducted by individual and the topic would be assigned in class.
Mid-term exam (20%) Final-term exam (20%) Project (20%) Homework (30%) Attendance(10%)
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction |
| 第 2 週 | Python syntax Class and recursion |
| 第 3 週 | Big-O notation |
| 第 4 週 | Array |
| 第 5 週 | Linked list |
| 第 6 週 | Abstracted data types |
| 第 7 週 | Stacks |
| 第 8 週 | Midterm Exam |
| 第 9 週 | Queues |
| 第 10 週 | General trees |
| 第 11 週 | Binary tress |
| 第 12 週 | Graphs |
| 第 13 週 | Search |
| 第 14 週 | Sort |
| 第 15 週 | Project presentation |
| 第 16 週 | Final Exam |
Grokking Data Structure, Marcello La Rocca, Manning, 2024 Python 資料結構 X 演算法 刷題鍛鍊班, 旗標出版社, 2022
- 地點
- SC314
- 時間
- By appointment
- 聯絡方式
- jacky.jw.lin@nycu.edu.tw