




| |
Date |
Date Due |
Assignment |
Solutions |
Oct. 5,
2005 |
Oct. 12.
2005 |
9.3-1, 9.3-3, 9.3-4, 9.3-6, 9.4-2, 9.4-3
Dijkstra's algorithm can be used for solving the shortest
path problems. |
Solutions |
Oct. 17,
2005 |
Oct. 24.
2005 |
9.5-1, 9.5-3, 9.5-5, 9.6-2, 9.6-4, 9.7-1, 9.7-3
|
Solutions |
Nov. 30,
2005 |
Dec. 7,
2005 |
11.1-2, 11.1-6, 11.3-1, 11.3-4, 11.4-6, 11.5-1, 11.6-1
|
Solutions |
Dec. 29,
2005 |
Jan. 7,
2006 |
10.2-2, 10.3-1, 10.3-6, 10.3-8, 10.3-17,
10.4-2 |
|
Jan. 4,
2006 |
Jan. 16,
2006 |
12.1-3, 12.2-5, 12.2-7, 12.3-4,
12.4-1,12.4-6, 12.5-6, 12.6-5,12.7-4 |
|
|