Transcription of Discrete Mathematics Problems
{{id}} {{{paragraph}}}
Discrete Mathematics ProblemsWilliam F. KlostermeyerSchool of ComputingUniversity of North FloridaJacksonville, FL 32224E-mail: Preface31 Basics .. truth Tables and Logical Equivalences .. Quantifiers .. Circuits .. 112 Sets133 Functions174 Integers and Matrices215 Direct Proofs .. Proofs by Contradiction .. Proofs by Induction .. 276 Basic Problems .. Graphs .. Directed Graphs .. Problems Requiring Proofs .. 357 Counting398 Other Relations .. Algorithm Analysis .. Recurrence Relations .. Generating Functions .. Boolean Algebra .. 47 Chapter 0 PrefaceThis booklet consists of problem sets for a typical undergraduate discretemathematics course aimed at computer science students.
1.2 Truth Tables and Logical Equivalences Give truth tables for each of the following: 1. p∨q ∧r 2. ¬p → q 3. (p∨q)⊕p 4. (p∧q)∨(q → p) 5. (p → q) → …
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}