| 8/20 (Mon) | 8/22 (Wed) Introduction. Graphs. (Sec. 5.1) | 8/24 (Fri) Graph concepts. (Sec. 5.2) |
| 8/27 (Mon) Graph models. (Sec. 5.2) |
8/29 (Wed)
Euler's theorems. (Sec. 5.3) |
8/31 (Fri)
Fleury's algorithm. (Sec. 5.3) |
| 9/03 (Mon) NO CLASSES |
9/05 (Wed)
Hamilton circuits and paths. Complete graphs. (Sec. 6.2) |
9/07 (Fri)
Hamilton circuits and paths. Complete graphs. (Sec. 6.2) |
| 9/10 (Mon) Traveling Salesman Problem. (Sec. 6.1) | 9/12 (Wed) Review for midterm 1. | 9/14 (Fri) Midterm #1. |
| 9/17 (Mon) The brute-force algorithm. (Sec. 6.3) | 9/19 (Wed) The nearest-neighbor algorithm. (Sec. 6.4) | 9/21 (Fri) Repetitive nearest-neighbor algorithm. (Sec. 6.4) |
| 9/24 (Mon) The cheapest-link algorithm. (Sec. 6.5) | 9/26 (Wed) The cheapest-link algorithm. (Sec. 6.5) | 9/28 (Fri) Trees. (Sec. 7.1) |
| 10/01 (Mon) Minimal spanning trees (Sec. 7.2) |
10/03 (Wed)
Kruskal's algorithm. (Sec. 7.3) |
10/05 (Fri)
Kruskal's algorithm. (Sec. 7.3) |
| 10/08 (Mon) Symmetry. (Sec. 11.1) |
10/10 (Wed)
Reflections. (Sec. 11.2) |
10/12 (Fri) NO CLASSES |
| 10/15 (Mon) Rotations. (Sec. 11.3) | 10/17 (Wed) Review for midterm 2. | 10/19 (Fri) Midterm #2. |
| 10/22 (Mon) Translations. (Sec. 11.4) |
10/24 (Wed)
Glide reflections. (Sec. 11.5) |
10/26 (Fri) Symmetry type. (Sec. 11.6) |
| 10/29 (Mon) Symmetry type. (Sec. 11.6) |
10/31 (Wed)
Fibonnacci numbers. (Sec. 13.1) |
11/02 (Fri)
Fibonnacci numbers. (Sec. 13.1) |
| 11/05 (Mon) Golden Ratio. (Sec. 13.2) | 11/07 (Wed) Golden Ratio. (Sec. 13.2) | 11/09 (Fri) Percentages. (Sec. 10.1) |
| 11/12 (Mon) NO CLASSES | 11/14 (We) Review for midterm 3. | 11/16 (Fri) Midterm #3. |
|
11/19 (Mon)
Simple interest. (Sec. 10.2) |
11/21 (Wed) NO CLASSES | 11/23 (Fri) NO CLASSES |
|
11/26 (Mon)
Compound interest. (Sec. 10.3) |
11/28 (Wed)
Compound interest. (Sec. 10.3) |
11/30 (Fri)
Retirement Savings. (Sec. 10.4) |
|
12/03 (Mo)
Consumer debt. (Sec. 10.5) |
12/05 (Wed) Review for the final. | 12/10 (Mo) FINAL, 10:30 AM - 12:15 PM |