| Lecture | Date | Topics Covered | Textbook Reading | Handouts, Links |
| 1 | Apr 3 |
Intro, Propositions, Truth Tables Basic Logical Connectives, Equivalences |
Ch. 4.1-4.6 |
Handout 1: Propositional Logic Math Symbols Truth Tables for Logic Operators |
| 2 | 5 | Algebra of Propositions, Arguments, Conditional, Biconditional, Predicates, Quantifiers | CH. 4.6-4.11 | Propositional Calculus |
| 3 | 10 |
Rules of Inference, Methods of Proof |
Handout
2: Methods of Proof Existence Proof: Tic-tac-toe |
|
| 4 | 12 | Mathematical Induction | Ch. 1.8 | Handout 3: Mathematical Induction |
| 5 | 17 |
Set Theory |
Ch. 1 | Handout 4: Set Theory |
| 6 | 19 | Relations and Functions | Ch. 2, 3.1-3.3 | Handout 5: Functions and Algorithms |
| 7 | 24 |
Functions and Sequences, Recursive Functions, Cardinality of Sets |
Ch. 3.4-3.7 | Sloane's Online Encyclopedia |
| 8 | 26 | Functions and Algorithms, Rate of Growth (Big-Oh) | Ch. 3.8, 3.9 | Big-Oh notation |
| 9 | May 1 |
Integers and Integer Properties |
Ch. 11 | Handout 6: Integers and Integer Algorithms |
| 10 | 3 |
Integer Algorithms: Division algorithm, GCD (Euclidean Alg) |
Ch. 11 |
Division
Algorithm Euclidean Algorithm |
| 8 |
MIDTERM |
|||
| 11 | 10 | Basic Counting: Permutations | Ch. 5 |
Handout 7: Basic Counting Counting Problems |
| 12 | 15 |
Counting: Combinations, Pigeonhole |
Ch. 5, 6 | |
| 13 | 17 | Recurrence Relations and Solutions | Ch. 6 |
Handout 8: Advanced Counting Fibonacci Numbers |
| 14 | 22 | Basic Probability | Ch. 7 | Handout 9: Probability |
| 15 | 24 | Probability II | Ch. 7 | |
| 16 | 29 |
Graph Theory |
Ch. 8 | Handout 10: Graphs |
| 17 | 31 | Graph Theory II: Algorithms | Ch. 9 | |
| 18 | June 5 |
Languages, Automata, Regular Expressions |
Ch. 12 | Handout 11: Automata |
| 19 | 7 | Review |
|
|
| June 13 | Final Exam |
The handouts are courtesy of Sean Davis, and Zhojun Bai.