COM S 230: Discrete Computational Structures

Recitation Topics and Slides (Fall 2023)


week 1:  No recitations.  

week 2Latex, propositions, logical equivalences, functionally complete.

week 3Logic translations and proofs.  

week 4Proof methods (direct proofs, by cases, by contradiction, by contrapositives, etc.)  

week 5Sets definitions (union, intersection, negation, etc.) and proofs.

week 6Functions (one-to-one and onto) and proofs.  

week 7Midterm 1 Reviews.

week 8:  Relations (symmetric, anti-symmetric, transitive, reflexive, anti-reflexive), equivalence relations.

week 9:  Induction proofs (mathematical induction, strong induction).

week 10: State Machines, Stronger Induction Hypothesis and Structural Induction.

week 11: Inductive/Recursive Definition and Midterm 2 Reviews.

week 12: Set Cardinality (countable and uncountable sets) and proofs (dovetailing and diagonalization).

week 13: Diagonalization and Counting.

week 14: Counting - Pigeonhole Principle and Stars-and-Bars.

week 15: Balls-and-Bins problems and Graph Foundations.  

week 16: Final Exam Reviews.  

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]

[slides]