CS 180 - Data Structures and Algorithms

---

Table of contents

• 1 - Famous problem
• 1 - Practice Final 1
• 10 - Union Find (4.6)
• 11 - Divide and Conquer
• 12 - Dynamic Programming
• 13 - Flow Network (7.1)
• 15 - NP Completeness
• 2 - Practice Final 2
• 2 - Stable Matching
• 3 - Algorithm Analysis
• 4 - Intro to Graphs and Greedy Algos
• 5 - Graph Traversal (3.2, 3.3)
• 6 - Bipartite & Directed Graphs (3.4,3.5)
• 7 - Topological Sort (3.6)
• 8 - Shortest Path (4.4)
• 9 - Minimum Spanning Tree (4.5)