Discrete Structures & Algorithms

Category: Uncategorized (Page 2 of 2)

Class #6 Agenda (Wed Feb 16)

Topics

  • Review & examples from Sec 1.4 (Predicates and Quantifiers)
    • quantifiers: universal quantifier ∀, existential quantifier ∃
      • x P(x)
      • x P(x)
    • HW#2 exercises
  • Sec 1.5: Nested Quantifiers
  • Quiz #1

Notes/To-Do After Class

  • No class next week:
    • College is closed Monday (Feb 21)
    • Our class won’t meet Wednesday (Feb 23)
    • So our next meeting will be Monday Feb 28
  • Work on HW#2! Due Wed March 2
  • Read textbook (examples) and slides:
    • Sec 1.4 & Sec 1.5
    • Chapter1 (Part 2) Slides

Class 4 Agenda (Wed Feb 9)

Topics

  • Sec 1.3: Propositional Equivalences
    • definitions of tautology, contradiction, logical equivalence
    • important logical equivalences (Tables 1-8): De Morgan’s Laws, distributive/associative/commutative laws, implication
    • satisfiability (considered as an algorithmic question)

To-Do After Class

  • Continue reading the textbook(s) and slides:
    • Rosen: Section 1.3
    • Levin: Section 3.1 (“Propositional Logic”)
  • Finish HW1 (updated with Sec 1.3 exercises)
    • due Monday (Feb 14) – hand in written solutions
    • see Files (“Rosen exercises” folder) for pdf extracts with textbook exercises
Newer posts »