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