CSSE 473: Session Notes - Day 6

Topics

  1. Brute force algorithms: Exhaustive search

Outline

  1. [10 min] Brute force string matching
  2. [10 min] Travelling salesman problem and exhaustive search solution
  3. [10 min] Knapsack problem and exhaustive search solution
  4. [10 min] Job assignment problem and exhaustive search solution
  5. [10 min] Review of graph implementations: adjacency matrix vs adjacency lists

Resources

Homework