資料結構與物件導向程式設計

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

C++: Strings C++: Pointers and Dynamic Arrays C++: Namespaces C++: Streams and File IO C++: Recursion C++: Inheritance

C++: Inheritance C++: Polymorphism and Virtual Functions

C++: Templates C++: Linked Data Structures (Stack, Queue, HashTable, Sets)

C++: Exception Handling

C++: Standard Template Library (STL)

Midterm Exam

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

AVL Trees - Balanced and Unbalanced Trees - Rotations - AVL Trees - AVL Rotations

Heaps - What are Heaps - Working with Heaps - Heap Sort - Priority Queues

Graphs - What are Graphs - Adjacency Matrix - Adjacency List - Traversal Algorithms - Depth-first Traversal - Breadth-first Traversal

Undirected Graphs - Weighted Graphs - Dijkstras Shortest Path Algorithm - Minimum Spanning Tree

Sorting Algorithms - Bubble Sort - Selection Sort - Insertion Sort - Merge Sort - Quick Sort - Counting Sort - Bucket Sort

Searching Algorithms - Linear Search - Binary Search - Jump Search - Exponential Search

Final-term Exam