| Cycle |
Topic |
Lab |
Reading |
| 1 |
Boolean Logic; Truth Tables;
Circuits |
Truth Tables |
Chapter 12 |
| Truth Tables and Circuits |
Circuits |
||
| Simplification & Karnaugh
Maps |
HW 1 due |
||
| 2 |
Predicate Logic, Quantifiers |
Regular Expressions |
1.3-1.4 |
| Proof methods |
Regular Expressions II |
1.5 |
|
| Sets, Functions, and Relations |
1.6-1.7 |
||
| 3 |
Sequences and Sums |
Introduction to Haskell and Sets |
Handout |
| Algorithms, Big-O, Complexity |
Haskell 2 |
2.1-2.3 |
|
| Matrices |
2.4 |
||
| 4 |
Matrices, Continued |
Infinite Sequences in Haskell |
3.1-3.2 |
| Interpolation, Splines |
Matrices |
3.3 |
|
| Quadrature |
3.8 |
||
| 5 |
Induction and Recursion |
Interpolation |
5.1-5.5 |
| Structural Recursion |
Sets in Haskell |
||
| Program Correctness |
6.1-6.2 |
||
| 6 |
Counting & The Pigeonhole
Principle |
6.3 |
|
| Permutations and Combinations |
6.4-6.5 |
||
| Midterm |
|||
| 7 |
Binomial Theorem & More Permutations and Combinations |
Box Experiment |
7.1-7.3 |
| Finite Probability & Bayes'
Theorem |
Bayes' Theorem |
7.4 |
|
| Expected Value and Variance |
8.1 |
||
| 8 |
Recurrence Relations/Solutions | Checking Recurrence Solutions |
8.2 |
| Divide and Conquer and The Master Theorem |
Solving Recurrence Relations
with Mathematica |
8.3 |
|
| Solving Linear Recurrences |
8.4 |
||
| 9 |
Inclusion-Exclusion |
More Recurrence Relations |
9.1-9.3 |
| Relations/Tables/Databases |
Relations |
9.4-9.6 |
|
| Equivalence Relations and Partial Orderings |
10.1-10.3 |
||
| 10 |
Graphs |
Networks |
10.4-10.6 |
| Special Graphs, Isomorphism, and Connectivity |
Graphs and Maps |
10.7-10.8 |
|
| Special Graphs, Paths, and Searches |
11.1-11.3 |
||
| 11 |
Trees |
Depth-first and Breadth First
Search |
11.4-11.5 |
| Traversals and Spanning Trees |
Trees |
||
| Spare |
13.1-13.3 |
||
| 12 |
Languages and Grammars |
Dags |
13.4 |
| Parsing |
Languages and Haskell |
||