CSCI 1323 (Discrete Structures):
Lecture Summaries
(Numbers following topics reference chapter(s) and section(s)
in the textbook.)
- January 15: About the course.
- January 17: Propositional logic (1.1).
- January 22: Propositional logic (1.2).
- January 24: Propositional logic, continued (1.2).
- January 29: Predicate logic (1.3).
- January 31: Predicate logic (1.4).
- February 5: Predicate logic (1.4);
proofs of program correctness (1.6).
- February 7: Proofs of program correctness, part 1 (1.6).
- February 12: Exam 1.
- February 14: Proofs of program correctness, continued (1.6);
proof techniques (2.1).
- February 19: Proof techniques, continued (2.1);
mathematical induction (2.2).
- February 21: Mathematical induction, continued (2.2);
proofs of program correctness, part 2 (2.3).
- February 26: Review (1.6, 2.1, 2.2); recursive definitions (2.4).
- February 28: Recursive definitions (2.4), continued.
- March 5: Recurrence relations (2.4);
analysis of algorithms (2.5).
- March 7: Analysis of algorithms (2.5).
- March 19: No class.
- March 21: Sets (3.1).
- March 26: Counting (3.2, 3.3).
- March 28: Permutations and combinations (3.4).
- April 2: Permutations and combinations (3.4), continued;
review for exam 2.
- April 4: Exam 2.
- April 9: Review of sets and combinatorics (3.1, 3.2, 3.3, 3.4).
- April 11: Binary relations (4.1).
- April 16: Topological sorting (4.2);
functions (4.4), introduction.
- April 18: Functions (4.4).
- April 23: Order of magnitude of functions (4.4); graphs (5.1).
- April 25: Trees (5.2).
- April 30: Course wrap-up and evaluations.