資料結構與物件導向程式設計
Data Structures and Object-oriented Programming
學期
108-2
學分
3
學分
當期課號
1279
永久課號
DCP1242
開課單位
資訊學院共同課程
授課教師
詹力韋
校區
光復
類別
必修
上課時間表
| 節 | 週一 | 週四 |
|---|---|---|
2 09:00–09:50 | 資料結構與物件導向程式設計 EC315 | |
5 13:20–14:10 | 資料結構與物件導向程式設計 EC315 2 節連堂 | |
6 14:20–15:10 | ||
A 18:30–19:20 | 資料結構與物件導向程式設計 EC315 3 節連堂 | |
B 19:30–20:20 | ||
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
概述
-Understand Object-Oriented Programming -Implement Data Structure and Algorithm
先修科目
Programming with C
週次計畫
| 週次 | 主題 |
|---|---|
| 第 1 週 | Course Introduction From C to C++ - C++ Basics - Flow of Control - Function Basics C++: Parameters and Overloading C++: Arrays C++: Structure and Classes C++: Constructor C++: Operator Overloading, Friends |
| 第 2 週 | C++: Strings C++: Pointers and Dynamic Arrays C++: Namespaces C++: Streams and File IO C++: Recursion C++: Inheritance |
| 第 3 週 | C++: Inheritance C++: Polymorphism and Virtual Functions |
| 第 4 週 | C++: Templates C++: Linked Data Structures (Stack, Queue, HashTable, Sets) |
| 第 5 週 | |
| 第 6 週 | |
| 第 7 週 | C++: Exception Handling |
| 第 8 週 | C++: Standard Template Library (STL) |
| 第 9 週 | Midterm Exam |
| 第 10 週 | The Big O Notation - O(1), O(n), O(n^2), O(log n), O(2^n) - Space Complexity Binary Trees - What are Trees - Traversing Trees - Depth First Traversals - Minimum Value in a Tree |
| 第 11 週 | AVL Trees - Balanced and Unbalanced Trees - Rotations - AVL Trees - AVL Rotations |
| 第 12 週 | Heaps - What are Heaps - Working with Heaps - Heap Sort - Priority Queues |
| 第 13 週 | Graphs - What are Graphs - Adjacency Matrix - Adjacency List - Traversal Algorithms - Depth-first Traversal - Breadth-first Traversal |
| 第 14 週 | Undirected Graphs - Weighted Graphs - Dijkstras Shortest Path Algorithm - Minimum Spanning Tree |
| 第 15 週 | Sorting Algorithms - Bubble Sort - Selection Sort - Insertion Sort - Merge Sort - Quick Sort - Counting Sort - Bucket Sort |
| 第 16 週 | Searching Algorithms - Linear Search - Binary Search - Jump Search - Exponential Search |
| 第 17 週 | Final-term Exam |