Assignment No: 1 Subject: Discrete Structure
Discrete mathematics is a core subject of theoretical
computer science. It is not a directly application
oriented subject, but it provides tolls and
mathematical models, which are applied to different
areas in computer science.
Will be asked in Interview for M. Tech, PhD or other
government jobs.
Q1: Consider a set A = {1}. Then | P(P(P(A))) | =______?
Q2: The cardinality of the power set of {1, 2,…,10} is
_________?
Q3: For a set A, the power set of A is denoted by 2A. If a set
A = {5, {6}, {7}} is. What will be the power set?
Q4: Let P(S) denotes the power set of set S = {a, b}. prove that
P(S) ∩P(P(S)) = {φ}, and S 𝞊 P(s)?
Q5: what will be the total number of elements in the power set
P(S) of the set S= {{∅},1, {2,3}} is, and also write down the
power set.
Q6: Solve the following using Venn diagram Set A = {1},
B = {1,2}.
a) A - B = A ⋂ Bc b) A - (A - B) = A ⋂ B
b) A - (A ⋂ B) = A – B
Q7: Solve the following using Venn diagram Set A ={1},
B={1,2}.
If A ⊂ B, then
a) A U B = B b) A ⋂ B = A c) BC ⊂ AC
Q8: let p, q and r be sets find the symmetric difference
using Venn diagram defined as.
P ⨁ q = (p U q) – (p ∩ q)?
Prove that it is equal or not.
a) p ⨁ (q ∩ r) = (p ⨁ q) ∩ (P ⨁ r)
b) p∩ (q ∩ r) = (p ∩ q) ⨁ (p ⨁r)
Q9: Consider two well-formed formulas in
propositional logic.
F1:P ¬P F2:(P⇒¬P) ∨ (¬P⇒P)
Prove that F1 is satisfiable and F2 is valid.
Q10: The statement (¬p) (¬q) is logically
equivalent to. (a) p q (b) (¬q) ∨ (p). prove that
Q11: Consider the following statements:
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good
Argument is valid or not
P1: P Q
P2: Q P
Q: P = Q
Q12: The following Boolean Expressions is tautology
or Not?
a) ((a → b) ∧ (b → c)) → (a → c)
b) (a ∧ b ∧ c) → (c ∨ a)
c) a → (b → a)
d) a ∧ b → b ∨ c
Q13: let in a set of all humans
L (x, y): x likes y
“there is someone, whom no one like”. Write the
statement using quantifiers.
Q14: Which one is the CORRECT formula for the
sentence, “not all rainy days are cold”
a) ∀d (Rainy(d) ∧ ~Cold(d))
b) ∃d (~Rainy(d) → Cold(d))
c) ∃d (Rainy(d) ∧ ~Cold(d))
Q15: What is the logical translation of the following
lowing statement?
"None of my friends are perfect."
a) ∃x(F(x) ∧ ¬P(x))
b) ∃x(¬F(x) ∧ ¬P(x))
c) ¬∃x(F(x) ∧ P(x))
I hope that you will complete this assignment by
yourselves. And if you attempt it on your own and
make the effort, then God willing, I am hopeful in fact,
I am sure that you will have no problem in future.
Thank you
Best Of Luck
By Muhammad Salman bin Karim