| 09/19 (Mo) NO CLASSES |
09/21 (We)
Introduction. Graphs. Graph concepts. (Sec. 5.1, 5.2, 5.3). |
09/23 (Fri)
Graph models. Euler's theorems. (Sec. 5.3, 5.4, 5.5). |
|
09/26 (Mo)
Fleury's algorithm. Eulerizing graphs. (Sec. 5.6, 5.7). |
09/28 (We) Hamilton circuits and paths. Complete graphs. (Sec. 6.1, 6.2). | 09/30 (Fri) Traveling Salesman Problem. (Sec. 6.3, 6.4). |
| 10/03 (Mo) The brute-force algorithm. (Sec. 6.5). | 10/05 (We) The nearest-neighbor algorithm. (Sec. 6.6, 6.7). | 10/07 (Fri) The cheapest-link algorithm. (Sec. 6.8). |
| 10/10 (Mo) Trees. Minimal spanning trees (Sec. 7.1, 7.2). |
10/12 (We)
Kruskal's algorithm. (Sec. 7.3). |
10/14 (Fri)
The shotest network. (Sec. 7.4, 7.5). |
| 10/17 (Mo) Symmetry. Reflections. (Sec. 11.1-11.3). |
10/19 (We)
Rotations (Sec. 11.4). Review for midterm 1. |
10/21 (Fri) Midterm #1. |
|
10/24 (Mo)
Translations. Glide reflections. (Sec. 11.5, 11.6). |
10/26 (We) Groups. (Sec. 11.7). |
10/28 (Fri)
Groups and patterns. (Sec. 11.8). |
| 10/31 (Mo) Wallpaper symmetry types. (Sec. 11.8). |
11/02 (We)
Fibonnacci numbers. (Sec. 9.1). |
11/04 (Fri) Golden Ratio. (Sec. 9.2) |
|
11/07 (Mo)
Population growth. The linear growth model. (Sec. 10.1, 10.2) |
11/09 (We) The exponential growth model. (Sec. 10.3). | 11/11 (Fri) NO CLASSES |
| 11/14 (Mo) The logistic growth model. (Sec. 10.4). |
11/16 (We)
Sample spaces. (Sec. 15.1). Review for midterm 2. |
11/18 (Fri) Midterm #2. |
|
11/21 (Mo)
Counting. The multiplication rule. (Sec. 15.2). |
11/23 (We) Permutations and combinations. (Sec. 15.3). | 11/25 (Fri) NO CLASSES |
| 11/28 (Mo) Groups of permutations. |
11/30 (We)
Probability Spaces. (Sec. 15.4-15.7) |
12/02 (Fri) Review for the final. |