1. Make the truth table for the following statements.
(i) ¬ p ∧ ¬q (ii) ¬ (p ∧ ¬q) (iii) (p ∨ q) ∧ ¬q (iv) (¬ p → r) ∧ (p ↔ q) 2. If a set A has n elements, then what is the total number of subsets of A. Explain. 3. If X and y are the two finite sets, such that n(X U Y) = 36, n(X) = 20, n(Y) = 28, then Explain n(X ∩ Y). 4. Illustrate a truth table to show that (p ∧ q) → p is a tautology. 5. Illustrate the different arrangements of the word PARRAMATTA are possible. 6. Draw a Hasse diagram for (A,) (divisibility relation), were (i) A = {1, 2, 4, 8, 16, 32, 64} (ii) A = {1, 2, 3, 5, 11, 13} 7. Identify the set R= {(1,2), (2,3), (3,4)} (a) Identify reflexive closure of R. (b) Identify the symmetric closure of R. (c) Identify the transitive closure of R. 8. Describe the logical expression (p → q) ↔ (¬ p V q) is a tautology. 9. Let R= {[1,1] [2,2] [3,3] [4,4] [5,5] [1,2] [2,1] [5,4] [4,5]} on A = {1,2,3,4,5}. Check given relation is equivalence relation or not. 10. Represent The following as Venn diagram: (i) A’ ∩ (B ∪ C) (ii) (ii) A’ ∩ (C – B)