Course Schedule

Here is this semester's tentative schedule.

Readings are done from the Rosen textbook and an online note packet by Lenny Pitt.

The course note packet is available in both PDF and PS formats. Sometimes the descriptions are closer to what is actually covered in class.

The lecture slides are available as both PDF handouts and PPT slides. (* denotes an older version of handouts)

If you have the 4th Edition of Rosen, read this.

 

Date	Topic	Reading	Slides
Aug 25	Propositional Logic	Rosen 1.1-1.2	lec 1
Aug 30	Propositions, Quantifiers	Rosen 1.2-1.3 Notes: Ch 1	lec 2
Sep 01	Quanifiers and Predicates	Rosen 1.3-1.4 Notes: Ch 2	lec 3
Sep 06	Proof Techniques	Rosen 1.5 Notes: Ch 3	lec 4
Sep 08	Sets	Text: Ch 1.6 Notes: Ch 4	lec 5
Sep 13	More Sets	Text: Ch 1.7 Notes: Ch 4	lec 6
Sep 15	Functions	Text: Ch 1.8 Notes: Ch 4	lec 7
Sep 20	Algorithms	Text: Ch 2.1, 2.2 Notes: Ch 4.1 - 4.12	lec 8
Sep 27	big-O	Text: Ch 2.2-2.3 Notes: Ch 6	lec 9
Sep 29	Summations and Hotel Infinity	Text: Ch 3.2 Notes: Ch 4.15, 6.2-6.3	lec 10
Oct 04	Infinite Cardinality, Induction	Text: Ch 3.3 Notes: Ch 6	lec 11
Oct 06	Strong Induction and Recursive Definitions	Text: Ch 3.4 Notes: Ch 7	lec 12
Oct 11	Inductive definitions, Algorithms	Text: Ch 3.4-3.5 Notes: Ch 7	lec 13
Oct 13	Algorithms, Counting	Text: Ch 3.5, 4.1 Notes: Ch 8	lec 14
Oct 18	Permutations, Combinations, and PHP	Text: Ch 4.2-4.3	lec 15
Oct 20	Binomial Theorem, Generalized Permutations and Combinations	Text: Ch 4.4, 4.5	lec 16
Oct 25	more counting and Probability	Text: Ch 4.5, 5.1	lec 17
Oct 27	Probability	Text: 5.2	lec 18
Nov 01	Expectation and Variance	Text: Ch 5.3	lec 19
Nov 08	Recurrences	Text: 6.1	lec 20
Nov 10	Annihilators	Text: Ch 6.2	lec 21
Nov 15	Annihilators, etc.	recurrences handout	lec 22
Nov 17	Divide and Conquer Recurrences	recurrences handout	lec 23
Nov 29	Relations	Text: Ch 7.1	lec 24
Dec 01	Equivalence Relations	Text: Ch 7.4-7.5	lec 25
Dec 06	Partial Orders	Text: Ch 7.6	lec 26
Dec 08	Graphs	Text: Ch 8.1-8.2	lec 27