|
| Lecture | Date | Class Topic | Reading (to be read before class) | Details | Homework Assigned | Homework Due |
|---|---|---|---|---|---|---|
| Wed Oct 6: No Discussion meeting | ||||||
| Lecture 1 | Th Sept 7 | Introduction and course overview; Propositional Logic | 1.1, 1.2 | Everything in these sections. | Ex. Set 1 | |
| Lecture 2 | Tu Sept 12 | Predicates and Quantifiers | 1.3, 1.4 | Everything in these sections. | ||
| Lecture 3 | Th Sept 14 | Proof Methods: a start | 1.5 | Everything except you don't need to memorize the entire Table 1. However, know how to use these rules and know what Modus Ponens and Resolution are. | ||
| Lecture 4 | Tu Sept 19 | More on Proofs | 3.1 | Get as much as you can from this section, but you probably won't be prepared for the details of some of the examples. | ||
| Sept 19: Last day to drop with no record | ||||||
| Lecture 5 | Th Sept 21 | Sets and Functions | 1.6, 1.7 | Everything in these sections. | Ex. Set 2 | Ex. Set 1 |
| Lecture 6 | Tu Sept 26 | More Functions and Relations | 1.8, 7.1 | Everything in these sections. | ||
| Lecture 7 | Th Sept 28 | Equivalence Relations and Partial Orderings | 7.5, 7.6 | Example 4 on p. 509 is something we will get to later. | ||
| Lecture 8 | Tu Oct 3 | Divisibility and Primes | 2.4, 2.5, skip pp. 172-175 up to Modular Exponentiation | This and the next lecture touch on number theory. It is hard going, but we'll end up with understanding public key cryptography. Hang in there. With luck, I will explain all! | Ex. Set 3 | Ex. Set 2 |
| Lecture 9 | Th Oct 5 | More Number Theory | 2.6 | Everything in this section. | ||
| Oct 5: Evening Midterm. This will cover everything from Lecture 1 up to and including Lecture 6. Closed book. 6:00 to 7:30 PM ELAB 303. | ||||||
| Mon Oct 9: Columbus Day. No Discussion meeting | ||||||
| Lecture 10 | Tu Oct 10 | More Number Theory: The division algorithm and modular arithmetic | 2.6 | |||
| Wed Oct 11: Monday's schedule but no Discussion meeting | ||||||
| Lecture 11 | Th Oct 12 | More Number Theory: Euclidean Algorithm, Modular Inverses, and Intro to Cryptosystems | 2.6 | I will present some material not in the book on breaking affine cyphers | ||
| Lecture 12 | Tu Oct 17 | Sequences and Summations and start of Mathematical Induction | 3.2, 3.3 | Everything in these sections | ||
| Lecture 13 | Th Oct 19 | Induction continued | 3.3 | Everything in this section. | Ex. Set 4 | Ex. Set 3 |
| Lecture 14 | Tu Oct 24 | Public Key Cryptography: RSA algorithm | See RSA on Wikipedia | |||
| Lecture 15 | Th Oct 26 | More induction | 3.3 | Everything in this section. | ||
| Oct 30: Mid Semester; Last day to drop with W | ||||||
| Lecture 16 | Tu Oct 31 | Structural Induction | 3.4 | Everything in this section. | Ex. Set 5 | Ex. Set 4 |
| Lecture 17 | Th Nov 2 | Combinatorics: Sum and Product Rules; Pigeonhole Principle | 4.1, 4.2 | Everything in these section. | ||
| Lecture 18 | Tu Nov 7 | Permutations, Combinations, and very basic Probability Theory | 4.3, 4.4, 5.1 | Everything in these sections. You need to memorize the binomial theorem but not the corollaries. But you should know how to generate them. | Ex. Set 6 | Ex. Set 5 |
| Lecture 19 | Th Nov 9 | Generalized Permutations and Combinations | 4.5 | Just when you thought you knew how to count! | ||
| Nov 9: Evening Midterm. This will cover everything from Lecture 8 up to and including Lecture 16, i.e., basically number theory (including the cryptography examples) and induction. Closed book. 6:00 to 7:30 PM ELAB 303. | ||||||
| Lecture 20 | Tu Nov 14 | Introduction to Graphs | 8.1, 8.2, 8.3 | Everything in these sections. | ||
| Lecture 21 | Th Nov 16 | Graph Connectivity | 8.4, 8.5 | Everything in these sections. | Ex. Set 7 | Ex. Set 6 |
| Mon Nov 20: No Discussion meeting | ||||||
| Lecture 22 | Tu Nov 21 | Shortest Path Problems | 8.6 | Everything in this section. | ||
| Wed Nov 22: No Discussion meeting | ||||||
| Thanksgiving Vacation | ||||||
| Lecture 23 | Tu Nov 28 | Planar Graphs and Graph Coloring | 8.7, 8.8 | Everything in these sections. | ||
| Lecture 24 | Th Nov 30 | Introduction to Trees | 9.1, 9.2 | You will see a lot more about trees in CMPSCI 383. | Ex. Set 8 | Ex. Set 7 |
| Lecture 25 | Tu Dec 5 | Tree Traversal | 9.3 | Everything in this section. | ||
| Lecture 26 | Th Dec 7 | Spanning Trees | 9.4, 9.5 | Everything in these sections. | ||
| Mon Dec 11: No Discussion meeting | ||||||
| Lecture 27 | Tu Dec 12 | Review and Discussion | Bring your questions about anything covered from the beginning of the course. | Ex. Set 8 | ||
| Final Exam. Two-hour closed-book during exam period. Covering everything in the course. Tuesday 19 Dec 8:00 AM, AEBN119. | ||||||