You are on page 1of 3

MAD111 - Review Chapter 1 + 2 1. How many tuples of (p, q, r) are there that make the compound proposition ( p ⊕ q) → r true? A. 2 B. 4 C. 6 D.

None

D. None

2. Compute (11011 ∨ 01101) ⊕ (01010 ∧ 11011) . A. 10101 B. 01010 C. 11111 D. None

7. Given the hypotheses - If Quang does every exercise in this book then Quang gets an A in this class. - If Quang gets an A in this class then Quang gets an A on the final exam. - Quang gets an A in this class. What conclusion can be drawn ? A. Quang does every exercise in this book, Quang gets an A in this class and Quang gets an A in this class. B. Quang does every exercise in this book and Quang gets an A on the final exam. C. Quang gets an A on the final exam and Quang gets an A in this class. D. Quang gets an A in this class and Quang gets an A on the final exam. E. None 8. Which statements are false ? A. ∅ ∈ {∅} C. ∅ ∈ {1} B. ∅ ∈ P({1}) D. None

3. The compound propositions ( p → r ) ∧ (q → r ) and ( p ∧ q ) → r are logically equavalent ? A. Yes B. No

4. Given the propositional function P(x) on the domain { -1, 0, 1}. Express the statement ∃x(( x ≥ 0) ∧ P ( x )) without using quantifiers. A. P(−1) ∨ P (0) ∨ P (1) C. P (−1) ∧ ( P(0) ∨ P(1)) B. P (0) ∨ P(1) D. None

5. Let L(x,y) be the statement “x loves y”. Translate the statement “An loves anybody except one person” into logical expression.
x (¬ L( An, x )) A. ∃ B.

∃x(¬L( An, x) ∧ ∀y (( y ≠ x ) → L( An, y ))) ∃x( L( An, x) ∧ ∀ y (( y ≠ x ) →¬L( An, y )))

C.

9. Find the cardinality of the set P ({∅, {∅}, 1, {1, 2}}) ×{x,{a, b}, x} A. 32 B. 12 C. 48 D. None

D.

∀ x ( L( An, x) ∧ ∃y (( y ≠ x) →¬L( An, y )))

6. Express the negation of ∃x(∀y ¬P( x, y ) ∨ ∃y (Q( x, y ) → R( x, y ))) so that no negation precedes a quantifier. A. ∀ x(∃ y P( x, y ) ∧ ∀ y (¬ Q( x, y ) → ¬ R( x, y ))) B. ∀x(∃y P ( x, y ) ∧ ∀y (Q ( x, y ) ∧ ¬ R( x, y ))) C. ∀x(∃y P( x, y) ∧ ∀y (¬ Q( x, y ) ∧ R( x, y )))

10. Let U = {1, 2, …, 10} be an universal set. Represent the subset A={2, 3, 5, 7} as a bit string of length 10, where the i-th bit is 1 if i belongs to A and is 0 if i does not belong to A. A. 1111000000 C. 0101011000. B. 0110110000 D. None

3. None ∑2 i =1 10 + (−1)i B. Find: B.2 B. 1 − (−2) 14. 3. 3. A. Compute   2. 0 D. -1 C. 211-2 D. f ( n) =  D. 3. 2. f(n) = n3 n / 2 + n / 2  B. 20 C.n C. None n / 2  . 2. … Find the 100th term of the sequence. f ( n) =  D. g(x) = x + 2. 211-1 1 − (−2)11 −1 C.5 × 3. f ( n) =  A. A. Which functions from the set of integers to itself are not one-to-one? A. 3. 21 i n / 2  . x2 + 4x D. None 15. Let f(x) = x2 – 4. f ( n) =  D.5 . Find the composition f og ( x) . 50 13. x2 – 2 C. None A.11. Given the sequence: 1. x2 + x . f(n) = n3 n / 2 + n / 2  B. -2 B. None 12. . 10 16.5  3.5  − 2.n C. 2. Which functions from the set of integers to itself are onto? A.

13B. 8C. 5B. 15A. 3B. 6B. 10D. 14C. 4B. 2A. 11A. 9A. 7D. 12C.Key: 1C. 16B .