Outline:

0. Questions?
1. Recap: inheritance
   • Exercise 1 from last class
2. Bin Packing
   • problem statement
   • “hard” problems and algorithmic complexity
3. The Knapsack Problem
   • problem statement
   • “greedy” solutions
   • algorithmic complexity, revisited

Explore after class:

4. Review for Quiz 4
   • another bin packing example: Exercise 1
   • implementing+testing a class:
     • writing the Activity class: Exercise 2a-c
     • combining activities: Exercise 2d

Want more practice?

5. Runestone
   • classes:
     • defining our own classes
     • classes vs instances
   • dictionaries:
     • dictionary exercises
     • nested dictionaries

What’s next

Upcoming events/assessments:

• CS Bits and Bytes tomorrow at 3:30pm in Anderson 329: Meditech
• Homework assignment 7 is due tomorrow
• Quiz #4 will be on Friday (in Olin 149)

What you should do now:

• The readings (see below)
• Finish Assignment 7

Reading assignment (to be completed by the next class):

• https://en.wikipedia.org/wiki/Bin_packing_problem
• https://en.wikipedia.org/wiki/Knapsack_problem