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