Data Structures and Algorithms
- Course Logistics
- Multiplication Algorithm
Runtime Analysis
- Insertion Sort and Merge Sort
Master Theorem
- Quick Sort
Quiz 1
- Lower Limit for Sorting and Linear Sorting
Lists (Stack and Queue)
- Stack and Queue Applications
Heap and Heapsort
- Graph (definition and representation)
Quiz 2
- Trees
Tree Traversal
- Binary Search Tree
Balanced Trees (Red-black tree)
- Midterm Exam Review
Midterm Exam
- Breadth First Search (BFS)
Depth First Search (DFS)
- Hashing
Introduction to dynamic programming (Matrix Multiplication)
- Knapsack Problem (Unbounded)
Quiz 3
- Knapsack Problem (0/1)
Introduction to greedy algorithms (Fractional knapsack)
- Scheduling problem and Huffman coding
Disjoint :union: Set
- Augmented Data Structure
Final Exam Review