| 1/11 (Mon) Introduction. Graphs. (Sec. 5.1) | 1/13 (Wed) Graph concepts. (Sec. 5.2, 5.3) | 1/15 (Fri) Graph models. (Sec. 5.3) |
| 1/18 (Mon) NO CLASSES |
1/20 (Wed)
Euler's theorems. (Sec. 5.4, 5.5) |
1/22 (Fri)
Fleury's algorithm. (Sec. 5.6) |
|
1/25 (Mon)
Eulerizing graphs. (Sec. 5.7) |
1/27 (Wed)
Hamilton circuits and paths. Complete graphs. (Sec. 6.1, 6.2) |
1/29 (Fri) Traveling Salesman Problem. (Sec. 6.3, 6.4) |
| 2/01 (Mon) The brute-force algorithm. (Sec. 6.5) | 2/03 (Wed) Review for midterm 1. | 2/05 (Fri) Midterm #1. |
| 2/08 (Mon) The nearest-neighbor algorithm. (Sec. 6.6, 6.7) | 2/10 (Wed) The cheapest-link algorithm. (Sec. 6.8) | 2/12 (Fri) The cheapest-link algorithm. (Sec. 6.8) |
| 2/15 (Mon) Trees. Minimal spanning trees (Sec. 7.1, 7.2) | 2/17 (Wed) Trees. Minimal spanning trees (Sec. 7.1, 7.2) |
2/19 (Fri)
Kruskal's algorithm. (Sec. 7.3) |
|
2/22 (Mon)
Kruskal's algorithm. (Sec. 7.3) |
2/24 (Wed)
Symmetry. Reflections. (Sec. 11.2) |
2/26 (Fri) Rotations. (Sec. 11.3) |
|
2/29 (Mon)
Translations. Glide reflections. (Sec. 11.4, 11.5) |
3/02 (Wed)
Translations. Glide reflections. (Sec. 11.4, 11.5) |
3/05 (Fri) Symmetry type. (Sec. 11.6) |
| 3/07 (Mon) Symmetry type. (Sec. 11.6) | 3/09 (Wed) Review for midterm 2. | 3/11 (Fri) Midterm #2. |
|
3/21 (Mon)
Fibonnacci numbers. (Sec. 9.2) |
3/23 (Wed) Golden Ratio. (Sec. 9.3) |
3/25 (Fri)
Arithmetic sequences. (Mini-excursion 3) |
|
3/28 (Mon)
Compound interest. (Sec. 10.3) |
3/30 (Wed)
Geometric sequences. (Sec. 10.4). |
4/01 (Fri)
Geometric sequences. (Sec. 10.4). |
| 4/04 (Mon) Sample spaces. (Sec. 15.1) | 4/06 (Wed) Counting. The multiplication rule. (Sec. 15.2) |
4/08 (Fri)
The multiplication rule. (Sec. 15.2) |
| 4/11 (Mon) Permutations and combinations. (Sec. 15.3) | 4/13 (We) Review for midterm 3. | 4/15 (Fri) Midterm #3. |
|
4/18 (Mon)
Probability Spaces. (Sec. 15.4) |
4/20 (Wed)
Equiprobable spaces. (Sec. 15.5) |
4/22 (Fri) Odds. (Sec. 15.6) |
| 4/25 (Mo) Review for the final. | 4/27 (Wed) FINAL, 3:30-5:15 PM |