CSCE 222: Discrete Structures for Computing

Note: Dates and topics are approximate and subject to change.

Date	Topics	Homework
Week 1
08/30	Course Introduction, Algorithms	HW 1
09/01	The Growth of Functions
Week 2
09/06	Complexity of Algorithms	HW 2
09/08	Propositional Logic, Applications of Propositional Logic, Propositional Equivalences
Week 3
09/13	Predicates and Quantifiers, Nested Quantifiers	HW 3
09/15	Rules of Inference, Introduction to Proofs, Proof Methods and Strategies
Week 4
09/20	Exam I	HW 4
09/22	Sets, Set Operations
Week 5
09/27	Functions	HW 5
09/29	Sequences and Summations
Week 6
10/04	Languages and Grammars	HW 6
10/06	Finite State Machines
Week 7
10/11	Finite State Machines	HW 7
10/13	Exam II
Week 8
10/18	Language Recognition, Turing Machines	HW 8
10/20	Relations and their Properties, n-ary Relations and the Applications, Equivalence Relations, Partial Orderings
Week 9
10/25	Mathematical Induction	HW 9
10/27	Mathematical Induction, Strong Induction and Well-Ordering
Week 10
11/01	Recursive Definitions and Structural Induction	HW 10
11/03	Program Correctness
Week 11
11/08	Exam III	HW 11
11/10	The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations
Week 12
11/15	Permutations and Combinations, Binomial Coefficients and Identities, Generalized Permutations and Combinations	HW 12
11/17	Applications of Recurrence Relations, Solving Linear Recurrence Relations, Divide and Conquer Algorithms and Recurrence Relations
Week 13
11/22	Divide and Conquer Algorithms and Recurrence Relations, Generating Functions, Inclusion-Exclusion	HW 13 SMBC #2425
11/24	No Class.
Week 14
11/29	Divisibility and Modular Arithmetic, Integer Representations and Algorithms	HW 14
12/01	Primes and Greatest Common Divisors, Solving Congruences, Applications of Congruences
Week 15
12/06	Cryptography	Listen
Final Exam
12/13	Final Exam: 1:00pm - 3:00pm, ETB 2005