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