MTH210 |
Handouts |
|
MTH210 |
Handouts |
|
| Section | Name | Size | Pages | ||
|---|---|---|---|---|---|
| Induction & Recursion | |||||
| 4 & 8 | Induction & Recursion | 120K | 8 | ||
| 8.1 | Fibonacci Sequence | 50K | 2 | ||
| 8.4 | Structural Induction | 66K | 2 | ||
| Graphs | |||||
| 11.1 | Introduction to Graphs | 107K | 7 | ||
| 11.2 | Hamiltonian and Eulerian Graphs | 77K | 4 | ||
| 11.4 | Graph Isomorphism | 64K | 2 | ||
| 11.5, 11.6 | Trees | 85K | 4 | ||
| Computability | |||||
| 12.1 | Regular Expressions | 100K | 7 | ||
| 12.2, 5.4, 7.5, + | Computability | 150K | 20 | ||
| Algebra | |||||
| 3.8 | The Euclidean Algorithm | 70K | 3 | (review) | |
| 10.4 | Prime Fields | 100K | 12 | ||
| 10.4 | Cryptography and RSA | 90K | 7 | ||
| Counting | |||||
| 6.1 - 6.3 | Counting | 100K | 6 | ||
| 6.4 - 6.7 | Combinations & Permutations | 100K | 5 | ||
| 6.8 - 6.9 | Probability | 260K | 12 | ||
Full notes for Computation here. Includes Sections not covered in the course: Nondeterminism, Grammars, the Chomsky Hierarchy, and an introduction to Complexity Theory (P = NP?).