CSCI 3104, Fall 2025 - Online Textbook
Lecture Notes
- Topic A: Big-O Notation and Complexity
- Topic B: Divide and Conquer
- Topic C: Graph Traversal
- Topic D: Greedy Algorithms
- Topic E: Max Flow
- Topic F: Dynamic Programming
- Topic G: Hash Tables and P vs NP
Standards
- Standard 0: Writing and Proofs
- Standard 1: Big-O and Complexity 1: Growth Rates
- Standard 2: Big-O and Complexity 2: Proofs
- Standard 3: Big-O and Complexity 3: Iterative Algorithms
- Standard 4: Divide and Conquer 1: Induction
- Standard 5: Divide and Conquer 2: Algorithms
- Standard 6: Divide and Conquer 3: Recurrences
- Standard 7: Graph Traversal 1: Graphs and Trees
- Standard 8: Graph Traversal 2: DFS and BFS
- Standard 9: Graph Traversal 3: Shortest Paths
- Standard 10: Greedy Algs 1: Algorithms
- Standard 11: Greedy Algs 2: Proofs
- Standard 12: Greedy Algs 3: Minimum Spanning Tree
- Standard 13: Max Flow 1: Definitions
- Standard 14: Max Flow 2: Ford-Fulkerson
- Standard 15: Max Flow 3: Reductions and Applications
- Standard 16: Dynamic Programming 1: Algorithms
- Standard 17: Dynamic Programming 2: Fill in
- Standard 18: Dynamic Programming 3: Solve From Scratch
- Standard 19: Hash Tables
- Standard 20: P and NP 1: Definitions
- Standard 21: P and NP 2: NP-Completeness
- Standard 22: Challenge A
- Standard 23: Challenge B
- Standard 24: Challenge C
- Standard 25: Challenge D
- Standard 26: Challenge E
- Standard 27: Challenge F
- Standard 28: Challenge G