CSSE 230: Session Notes - Day 21

Topics

1. Lower bound on comparison based sorting
2. Relationship among classes implementing the Collections interface
3. File I/O of objects

Outline

1. [5 min] Contact before work
2. [10 min] The game of 20 questions
3. [15 min] Proof of lower bound on comparison based sorting.
4. [20 min] Relationship among classes implementing the Collections interface
5. [5 min] Break
6. [10 min] File I/O of objects
7. [40 min] Work on team project.

Resources

• A decision tree for comparison sorting
• Proof of lower bound of comparison based sorting
• Code demonstrated in class
• File I/O demo

Homework

• Day 21, BC: Read about A*
• Day 25, BC: Field Guide to data structures.