CSSE 473: Session Notes - Day 6
Topics
- Brute force algorithms: Exhaustive search
Outline
- [10 min] Brute force string matching
- [10 min] Travelling salesman problem and exhaustive search solution
- [10 min] Knapsack problem and exhaustive search solution
- [10 min] Job assignment problem and exhaustive search solution
- [10 min] Review of graph implementations: adjacency matrix vs
adjacency lists
Resources
Homework
- Day 7, BC: Read sections 3.5, 4.1-4.2