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