- Make up your own matrix problem.
- Question very neat on front on TOP 1/4 of page. Answer very neat on back.
Sunday, December 16, 2007
(6) DUE: Monday, Jan. 14
(5) DUE: Friday, Jan. 11
- Do portfolio except Leslie and Keyword matrices
- Quiz on multiplication of matrices
Sunday, December 9, 2007
(10) DUE: Tuesday, Dec. 18
- Do review questions:
- 3: Planar
- 5: Bipartite
- 8: TSP
- 12: Shortest path
- 17: Spanning Tree (use all 3 algorithms, even though it only asks for one)
- 21, 22, 23: Binary trees
(9) DUE: Monday, Dec. 17
- Read Steiner Trees (extension) (pg. 286 - 288). Take some notes.
- Portfolio page(s) for Spanning Trees.
- Include algorithms for Breadth, Kruskal, and Prim with an example.
- Quiz on spanning trees. May use portfolio pages.
(8) DUE: Friday, Dec. 14
- Do: page 261 - # 6
- Write up your findings. Typed greatly appreciated.
- Explain the trick.
- What you did to solve it.
- What was the result?
- Why does it work? ----This is the MOST IMPORTANT part.
(6) DUE: Wednesday, Dec. 12
- Outline 5.5
- BIG suggestion: type Breadth, Kruskal, and Prim (in problems) algorithms. Give an example. this can be used on next Monday's quiz and maybe the chapter test.
PS this is really not due until Thursday.
Sunday, December 2, 2007
(5) DUE: Tuesday, December 11
- 5.4 read and outline
- 5.4 (2 - 4, 7 - 9, 11 - 14)
- Quiz on TSP and Shortest Path (plus planarity & bipartite graphs)
(4) DUE: Monday, Dec. 10
- 5.4 (16) Card game
- WRITE UP your findings:
- What's the problem?
- What did you do?
- What did you discover?
- Relate this to graph theory
- QUIZ on planarity, TSP, and Shortest path
(0) DUE: Tuesday, Dec. 4
- 4- (and 3-, and 5-, and 6-) letter word puzzle
- See how many points you can find.
Subscribe to:
Posts (Atom)