skip to main | skip to sidebar

DISCRETE MATH

Saturday, January 9, 2010

(7) DEU: Wednesday, January 13

  • Read 5.3
  • Do: 5.3 ((5) and (7) using Dijkstra and (8))
  • Portfolio page for Traveling Salesman Problem -- Use ALL THREE methods!
Posted by MS. HESSNEY at 11:34 AM

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Contributors

  • MS. HESSNEY
  • Ms. Green

Blog Archive

  • ▼  2010 (81)
    • ►  August (8)
    • ►  May (9)
    • ►  April (15)
    • ►  March (14)
    • ►  February (19)
    • ▼  January (16)
      • (0) Due: Wednesday, February 3
      • (20) DUE: Tuesday, February 2
      • (19) DUE: Monday, February 1
      • (18) DUE: Friday, January 29
      • (17) DUE: Thursday, January 28
      • (16) DUE: Wednesday, January 27
      • (15) DUE: Tuesday, January 26
      • (14) DUE: Monday, January 25
      • (13) DUE: Friday, January 22
      • (12) DUE: Thursday, January 21
      • (11) DUE: Wednesday, January 20
      • (10) DUE: Tuesday, January 19
      • (9) DUE: Friday, January 15
      • (8) DUE: Thursday, January 14
      • (7) DEU: Wednesday, January 13
      • (6) DUE: Tuesday, January 12
  • ►  2009 (132)
    • ►  December (15)
    • ►  November (20)
    • ►  October (19)
    • ►  September (17)
    • ►  May (7)
    • ►  April (3)
    • ►  March (22)
    • ►  February (12)
    • ►  January (17)
  • ►  2008 (142)
    • ►  December (16)
    • ►  November (20)
    • ►  October (19)
    • ►  September (16)
    • ►  August (5)
    • ►  May (9)
    • ►  April (12)
    • ►  March (17)
    • ►  February (9)
    • ►  January (19)
  • ►  2007 (69)
    • ►  December (19)
    • ►  November (11)
    • ►  October (19)
    • ►  September (19)
    • ►  June (1)
 

DISCRETE MATH