- Do 5.2 (1, 3, and 7)
- Answer in back for 1. Check before doing 3 and 7.
- Use Brute Force and Nearest Neighbor algorithms.
Saturday, December 12, 2009
(5) DUE: Monday, January 11
(4) DUE: Friday, January 8
- Utility Problem portfolio page
- Why is the 3 house - 3 utility not possible?
(3) DUE: Thursday, January 7
- Do 5.1 (1 - 4, 8, 10, 12,13, 18) Show work.
- Do Utility Problem portfolio page
(1) DUE: Tuesday, January 5
- Snowplow problem
- Complete Fleury's and Pseudotree algorithms for Snowplow problem
(16) DUE: Tuesday, December 22
- SIT FOR A SPELL graph word fine.
- How many can you find?
- Add up your points: 1 point for 1 letter, 2 points for 2 letters, 3 points for 3 letters, etc.
Saturday, December 5, 2009
(13) DUE: Thursday, Decembe 17
- Chapter review:
- 6: Scheduling
- 7: Graph
- 14: Matrices
- 13: Euler
- 12: Hamilton
- 18: Coloring
- 19: Digraph
(10) DUE: Monday, December 14
- Color Icasian Game
- SPROUTS investigation: both pages
(9) DUE: Friday, December 11
- Quiz on Euler & Hamilton graphs
- Portfolio page: Hamilton graphs & Tournaments
- Do: 4.5 (6, 7, and 12)
(7) DUE: Wednesday, December 9
- Euler's formula: both sides of handout
- What's the formula based on your investigation
- Read Chapter Extension on Eulerizing Graphs
- Portfolio page on Eulerizing graphs
Subscribe to:
Posts (Atom)