CSCI 1323 (Discrete Structures):
Lecture Summaries

• January 9: About the course.
• January 11: Propositional logic -- statements, wffs, tautologies.
• January 16: Propositional logic -- valid arguments, derivation rules.
• January 18: Propositional logic -- derivation rules, proof examples from homework.
• January 23: Predicate logic -- predicates, quantifiers, wffs, valid wffs.
• January 25: Predicate logic -- valid arguments, derivation rules.
• January 30: Predicate logic proof examples, program correctness.
• February 1: Proof techniques -- direct proof, contraposition, proof by contradiction.
• February 6: Proof techniques, continued, including proof by induction.
• February 8: Proof by induction, continued.
• February 13: Program correctness, continued (loops).
• February 15: Recursive definitions.
• February 20: Review for exam 1 (mostly formal logic).
• February 22: Exam 1.
• February 27: No class.
• March 1: Recursive definitions, recurrence relations.
• March 6: Recursive definitions, recurrence relations.
• March 8: Recurrence relations, analysis of algorithms.
• March 13, 15: Spring break.
• March 20: Analysis of algorithms, introduction to sets.
• March 22: Operations on sets, countable sets.
• March 27: Counting.
• March 29: Counting, continued.
• April 3: Counting, continued.
• April 5: Exam 2.
• April 10: No class.
• April 12: Relations and functions.
• April 17: Relations and functions, continued; order of magnitude of functions.
• April 19: Order of magnitude of functions, continued; graphs.
• April 24: No class.
• April 26: Graphs; trees.
• May 1: Review for final; evaluations.