1

CSE/IT Answer Key

Discrete Mathematics 1.
2.
(b)
(c)
4.
5.
(c)
(d)
Propositional Logic DPP-01 3. (a, b)

[MCQ] (d) Neither S1 nor S2 is valid

1. Which of the following is tautology?
[MCQ]
(a) ( p  (p  q))   q 5. Which of the following is not a tautology?
(b)  (p  q)   q (a) ((p  q)  r)  (p  (q  r))
(c) [( p  q) [q  (p  q)]]   r (b) ((p  (r v q)) ((p  r) v (p  q))
(d) None of these
[MCQ] (c) (p  (r  q))  ((p  r) v (p  q))
2. The statement [P V (p  Q) V Q] is equivalent to
(d) (p  (q  r))  ((p  q)  r)
(a) P (b) Q
(c) A tautology (d) (P  Q)
[MCQ]
3. Consider the following statement
S1: [(p  q)  (q  r)]  (r  p)
S2: [((p  q)  (q  r))  (p  r)]
Which of the following is/are correct?
(a) S1 is contingency
(b) S2 is tautology
(c) S1 and S2 both contingency
(d) S1 and S2 both Tautology
[MCQ]
4. Which of the following is valid ?
S1: p  (q V r)  (p  q) V (p  r)
S2: p  (q  r)  (p  q)  (p  r)
(a) S1 is valid and s2 is not valid
(b) S1 is not valid and s2 is valid
(c) Both S1 and S2 are valid
 4
3

Hints and solutions

1. (b) 4. (c)
 (p  q)   q
Statement S1 : valid
 [ (p  q)] V  q
(p  q) V  q p  (q V r)  (p  q) V (p  r)
pVqVq p + q + r  ( p + q) + ( p + r)
pV1  1
Hence, option B is tautology. p +q+r= p +q+r

Hence, statement S1 is valid

2. (c)
The statement : P V (P  Q) V Q Statement S2 : Valid
P V P’Q’ V PQ V Q
p  (q  r)  (p  q)  (p  r)
P V P’Q’ V (P V 1) Q
P V P’Q’ VQ p + qr  ( p + q) . ( p + r)
Apply absorption LAW
p + qr  p + qr
PVPQVQ
Hence, statement S2 is also valid.
PV Q VQ
PV1  1
5. (d)
Hence, the given statement is tautology.
Statement : (p  (q  r))  ((p  q)  r)
3. (a, b)
(p  ( q + r))  (( p + q)  r)
Statement S1 : Contingency
[(p  q)  (q  r)]  (r  p) ( p  q + r)  (  p  q  + r)
[( p + q)  ( q + r) ]  ( r + p)
 p  q  r   pq  r
 p  q  q  r   r  p
 pq  q r  r  p pq r  pq  r

 p  r [LAW of Absorption] p(q r  q)  r

Hence, S1 is contingency
Statement S2 : Tautology p( r  q)  r
For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab
[((p  q)  (q  r))  (p  r)] p r  pq  r For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
 pq  q r  p  r
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5
 pq  p  q r  r
 prp q
p(1  q)  r
 p  q q  r PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala

p+r1 For PW Website: https://www.physicswallah.live/contact-us

 p 1 r 1
Hence, option D is not tautology.
Hence, S2 is tautology
 1
2

CSE/IT Answer Key

Discrete Mathematics 1.
2.
(b, c)
(b, c)
4.
5.
(c)
(c)
Logical Equivalence DPP-02 3. (a, b, c)

[MSQ]
1. Which of the following is/are logical equivalence? [MCQ]
I. ~(p  q) 4. Consider the following statement
II. (p  q) ˄ (q  r) S1: ~ (p  q)
III. p ˄ ~ q S2: p  ~ q
IV. (p ˅ q)  r Which of the following is correct?
(a) I and II (b) I and III (a) S1 is tautology
(c) II and IV (d) II and III (b) S2 is contradiction
(c) S1 is equivalence to S2
[MSQ] (d) None of these
2. Consider the following statement
S1: (p  q) ˄ (p  r) [MCQ]
S2: p  (q ˄ r) 5. Consider the following statement
Which of the following is True? S1: ~ (p ˅ (~ p ˄ q))
(a) S1 is tautology S2: ~ p ˄ ~ q
(b) S1 is contingency Which of the following is correct?
(c) S1 is logically equivalence to S2 (a) S1 is tautology
(d) None of these (b) S2 is contradiction
(c) S1 is equivalence to S2
[MSQ]
(d) S1 is not equivalence to S2
3. Which of the following is logically equivalence?
(a) (p  r) ˅ (q  r)
(b) (p  q) ˅ (q  r)
(c) (p ˄ q) ˄ r
(d) (p  r) ˄ (q  r)
 4
3

Hints and solutions

1. (b, c,) Option B: (p  r) ˅ (q  r)

Two statements forms are logical equivalent if and  p r  pr  q  r
only if their resulting truth values are identical for  p r  q  pr  r
each variation of statement variables.  p r  qr
I. ~ (p  q)  p r  rq
= ~(~p ˅ q)
 p  rq
=p˄~q
 pqr
Hence, I is logically equivalent to III.
II. (p  r) ˄ (q  r)  ( p  q)  r  ( p  q)  r
 ( p  r )  (q  r ) So, option B is also logically equvalence to option
 p q  pr  qr  r A.
 p q | pr  r
 pqr
4. (c)
Statement S1: ~ (p  q)
 ( p  q)  r  ( p  q)  r
 ~ ( p q  pq )
Hence, II and IV are logically equivalence.
 ( p  q) ( p  q )
 pq  q p
2. (b, c)
Statement S1: (p  q) ˄ (p  r) Statement S2: p  ~q
 ( p  q)  ( p  r )  pq  pq
 p  p r  p q  qr Hence, S1 and S2 are equivalence to each other. For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab

 p  p q  qr For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
5. (c)
 p  qr Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5
Statement S1: ~ (p ˅ (~ p ˄ q))
 p  (q  r )  1
= ~ p ˄ [~ (~p ˄ q)] PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala
Hence, S1 is not tautology and S1 is logically = ~ p ˄ [~ (~p) ˅ ~q]
equivalent to S2. For PW Website: https://www.physicswallah.live/contact-us
= ~ p ˄ [p ˅ ~q]
Statement S2: p  (q ˄ r) = (~ p ˄ p) ˅ (~ p ˄ ~q)
 p  (q  r ) = F ˅ (~ p ˄ ~q)
 p  qr  1 or 0 = (~ p ˄ ~q)
Hence, statement S2 is contingency. = ~ p ˄ ~q)
Hence, S1 is equivalence to S2.
3. (a, b, c)
Option A: (p  r) ˅ (q  r)
 ( p  r )  (q  r )
 prqr
 p qr
 pq  r  ( p  q )  r
 ( p  q)  r
So, option A is logically equvalence to option C.
 1
2

CSE/IT
Answer Key
Discrete Mathematics DPP NO: 3
1. (b) 4. (b)
Inference Rule 2.
3.
(a, c, d)
(b)
5. (b)

[MCQ]
1. A logically binary relation  is defined as follows: [MCQ]
5. P1: If it rains; the match will not be played
A B AB P2: The match was played
True True True which of the following is valid inference?
(a) It rains
True False True (b) It did not rain
False True True (c) It either rain or did not rain
False False False (d) None of these
Let  be the unary negation (NOT) operator with
higher precedence than , which one of the following
is equivalent to A  B?
(a)  A   B (b)  [ A   B]
(c)  [ A  B] (d) None of these

[MSQ]
2. Consider the following propositional logic
statements. which of the following is contingency?
(a) ( p  (p  q))   p
(b) (q  (p  q))   p
(c) ((p  q)  (q  r))  (p  r)
(d) ((p  q)   p)  q

[MCQ]
3. Let p be “I will study discrete math”.
Let q be “I will study English literature”.
Now, consider the logical statement
“I will study discrete math or I will study English
literature”
“I will not study discrete math”
from the given premises, which of the following can
be conclusion?
(a) Therefore, I will not study English literature
(b) Therefore, I will study English literature.
(c) Both A and B
(d) None of these.

[MCQ]
4. Which of the following can be the conclusion for the
given hypothesis?
Hypothesis:  p  q, r  p,  r  s, s  t
(a) r  p (b) t
(c) s (d) r  s
 3 4

Hints and Solutions

1. (b) Step Reason
From the truth table we can conclude that 1.  p  q premise
A  B  A  B. 2. ~ p Simplification using (1)
Now, 3. r  p premise
option (a): Incorrect 4. ~ r Modus tollens using (2), (3)
AB~AB 5. ~ r  s Premise
option (b): Correct 6. s Modus ponens using (4) and (5)
~ [ A   B]  ~ [~ A   B] 7. s  t Premise
=AB 8. t Modus ponens using (6) and (7)
Hence, option (b) is the correct answer. Hence, ‘t’ will be the conclusion for the given
hypothesis.
2. (a, c, d)
I: we can use the logical properties or truth table 5. b
to find the truth value of the given logical Now for the given problem:
statement. p = It rains
II: If we have learned the inference rule then we q = the match will not be played
can identify that  ((p  q)  ~ q)  ~ p
Statement (a): modus tollens Hence, inference “It did not rain” is valid using
Statement (c): Hypothetical Syllogism modus tollens.
Statement (d): Disjunctive Syllogism
Hence, all the options (a), (c) and (d) are
tautology.
III: Option (b): Contingency
(q  (p  q))  p
= (q  p  q)  p
= qpq  p
= q p p  q  p
Hence, option (b) is contingency.

3. (b)
By applying disjunctive syllogism
pq
p
q
Therefore, I will study English literature.
For more questions, kindly visit the library section: Link for app: https://links.physicswallah.live/vyJw
For more questions, kindly visit the library section: Link for web: https://physicswallah.live/tabs/tabs/library-tab
4. (b)
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

PW Mobile APP: https://physicswala.page.link/?type=contact-us&data=open

For PW Website: https://www.physicswallah.live/contact-us
 1
2

CSE/IT Answer Key

Discrete Mathematics 1.
2.
(a, c)
(d)
4.
5.
(a, c)
(c)
Predicate Logic DPP-04 3. (3)

[MSQ] [MSQ]
1. Let R(x, y, z) denote the statement 4. Consider the english sentence
“x + y = z” “You can not ride the roller coaster if you are under 4
Which of the following proposition will evaluate truth feet tall unless you are older than 16 years old”.
value True? Which of the following correctly respresent the
(a) R(1, 2, 3) (b) R(0, 0, 1) logical expression for the sentence?
(c) R(1, 1, 2) (d) R(2, 3, 4) (a) q → ~(r  ~S)
(b) (r  ~S) → q
[MCQ] (c) (r  ~S) → ~q
2. Let p(x), q(x) denote the following open statements. (d) None of these
p(x): x  3 q(x): x + 1 is odd
If the universe consists of all integers, what are the truth [MCQ]
values of the following statements? 5. Let p(x) be the statement
S1: ~(p (–4)  q (–3)) “x + 1 > x”
S1: ~(p (–4)  ~q (–3)) Now, consider the truth value of quantification, where
(a) S1 : True, S2 : False the domain consists of all real number.
(b) S1 : False, S2 : True L1 = x p( x)
(c) S1 : True, S2 : True L2 = x p( x)
(d) S1 : False, S2 : False
Which of the following evaluate to True?
[NAT] (a) L1 only
3. Let p(x), q(x) denote the following open statements. (b) L2 only
p( x) : x + 1  x q( x) : x2  0 (c) Both L1 and L2 are True
(d) Neither L1 nor L2
How many expressions evaluate to True?
I. p(3)  [q(3)  ~p(3)]
II. p(2) → [q(2) → p(2)]
III. [p(2) → q(2)]  p(–3)]
 1
3
CSE/IT
Hints and Solutions
DISCRETE MATHEMATICS DPP NO: 05

1. (a, c) II. Qunatifier Part - 1

I. The proposition R(1, 2, 3) is obtained by setting p(2) → [q(2) → p(2)]
x =1, y = 2 and z = 3 in the statement R(x, y, z)    [MCQ]
So, R(1, 2, 3)  1 + 2 = 3  True True True True 1. Let p(x) and q(x) denote the following open (c) y ~ P(y) (d) y ~ P(y)
II. R(1, 1, 2)  1 + 1 = 2  True statements.
 True → [True → True]  True p(x): x2 > 0 [MCQ]
Hence, option a and c is correct.
III. q(x): x is odd 4. Which of the following is not valid logical
[ p(2) → q(2)]  p(−3) for the universe of all integers, determine the truth expression?
2. (d)
   or falsity of each of the statement. (a) x [P(x)  Q(x)]  [x P(x)]  [x Q(x)]
Statement S1: S1: x [p(x)q(x)] (b) x [P(x)  Q(x)]  [x P(x)]  [x Q(x)]
~ ( p(−4)  q(−3)) True True True S2: x [p(x)q(x)] (c) x [P(x)  Q(x)]  [x P(x)]  [x Q(x)]
   [True → True] ˄ True  True which of the following is true? (d) x [P(x)  Q(x)]  [x P(x)]  [x Q(x)]
−4  3 − 3 + 1 = −2 is not odd (a) S1 only (b) S2 only
 4. (a, c) (c) Both S1 and S2 (d) Neither S1 nor S2 [MCQ]
I. Let q, r, and s represents: 5. Consider following logical expressions:
 ~ (True  False)
q: you can ride the roller coaster
[MCQ] I: y[P(y) Q] [y P(y)] Q
 ~ (True)  False 2. Consider following two First Order Logic
r: you are under 4 feet tall II: y[P(y) Q]  [y P(y)] Q
Statement S2: Statements: which of the following logical expression is valid?
~ p(−4)  ~ q(−3) s: you are older than 16 years old. S1: [x(~P(x)Q(x))]  [x P(x)]  [x Q(x)] (a) I only (b) II only
  The sentence can be translated to S2: [x P(x)]  [x Q(x)]  [x (P(x)Q(x))] (c) Both I and II (d) None of these
~ (True)  ~ (False) (r ˄ ~s) → ~q Which of the following is valid?
II. An implication and its contrapositive always have (a) S1 only (b) S2 only
 False  True = False
the same truth value. (c) Both S1 and S2 (d) None of these
Hence, option d is correct
So, q → ~ (r ˄ ~s) also represent the sentence.
[MSQ]
3. (3) 3. P(y) = y is real in the domain of Z+ , then which
I. 5. (c)
L1 = x p( x) : True of the following is / are correct?
p(3)  [q(3)  ~ p(3)] I.
(a) y P(y) (b) y P(y)
   Here p(x) is true for all real number x, so, the
quantification x p( x) is True.
3 + 1  3 32  0 True
II. L2 = x p( x) : True
 
Here p(x) is true for all real number
True True
Thus, it will also true for same.
 True  [True  ~True]
 True  True = True

For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab
For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala

For PW Website: https://www.physicswallah.live/contact-us
 2 3

Hints and Solutions

1. (b) domain = positive integers (z+)
Answer Key (a) y P(y) True
Statement S1: x[p(x)q(x)]

1. (b) 4. (b) As we know the x connected through ‘’ operator. For every values of y, y is real because domain is
2. (c) So, check the statement for x = 3 positive integer
5. (d)
3. (a, b)  [p(3)  q(3)] = [(32 > 0)(3 is odd)] (b) y P(y) True
 [True  True]  True For some values of y, y is real
Now, check the statement for x = 2 (c) y ~ P(y) False
 [p(2)  q(2)] = [(22 > 0)(2 is odd)] (d) y ~ P(y) False
 [True  False]  False
Here S1 is false.
Statement S2: True 4. (b)
If x is true for one value then the overall the truth (P1  Q1)  (P2  Q2)  (P1  P2)  (Q1  Q2)
value of the statement will be true. (P1 + Q1)  (P2 + Q2)  P1P2 + Q1Q2
So, Check the statement for x = 3 P1' Q1' + P2 ' Q 2 ' + P1P2 + Q1Q2
 [p(3)  q(3)] = [(32 > 0)  (3 is odd)]
P1P2 + Q1Q2 + P1' Q1' + P2 ' Q 2 ' (Invalid)
 [True  True]  True
Remaining all are valid.
Hence, S2 is True.

5. d
2. (c)
I: y[P(y)Q]  [yP(y)]  Q
S1: x (P(x)  Q(x)  x P(x)  x Q(x)
(P1Q)  (P2Q)  (P1  P2)  Q
(Property of Predicate Logic)
( P1' + Q)  ( P2 ' + Q)  P1' + P2 ' + Q
x (~ P(x)  Q(x)  x P(x)  x Q(x)
P1' P2 ' + P1' Q + P2 ' Q + Q  P1' + P2 ' + Q
S2: x P(x)  x Q(x)  x (P(x)  Q(x) P1' P2 ' + Q  P1' + P2 ' + Q (invalid)
Proof: II: y [P(y) Q]  [y P(y)]  Q
 P1  P2    Q1  Q2    P1  Q1    P2  Q2  (P1Q)  (P2Q)  (P1 P2)  Q
 P1P2  Q1  Q2    P1 + Q1    P2 + Q2  P1' + P2 ' + Q  P1' P2 ' + Q

 P1  P2    Q1 Q2   P1  Q1  P2 Q2

P1 P2 Q ' + P1' P2 ' + Q
P1P2 + P1' P2 ' + Q (Invalid)
P1Q1Q2  P2Q1Q2  P1  Q1  P2  Q2 Hence, option (d) is correct
AB  A  A  B

P1  P2  P1  Q1  P2  Q2
P1  P1  1 and 1  anyting  1
1  P1  P2  Q1  Q2  P2
1 True
Hence both are valid.

3. (a, b)
P(y) = y is real
 1
4

CSE/IT
DISCRETE MATHEMATICS
For more questions, kindly visit the library section: Link for app: https://links.physicswallah.live/vyJw
DPP NO: 06
For more questions, kindly visit the library section: Link for web: https://physicswallah.live/tabs/tabs/library-tab

Qunatifier Part - 2
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

PW Mobile APP: https://physicswala.page.link/?type=contact-us&data=open

For PW Website: https://www.physicswallah.live/contact-us
[MCQ] (b) [xP(x)]  Q  x[P(x)  Q]
1. Consider a function, P(x, y, z) = x + y + z = 15 and (c) x[P(x)  Q]  [x P(x)]  Q
domain = z, then which of the following is correct? (d) x[P(x)  Q]  [x P(x)]  Q
(a) xyz P(x, y, z) (b) zxy P(x, y, z) Total invalid expressions are ___?
(c) xzy P(x, y, z) (d) z yx P(x, y, z)
[MCQ]
[MCQ] 5. Consider the following statements
2. Consider an asymmetric function P(x, y) = x2 + y2 = S1: There is someone who is loved by everyone.
10.0 on domain integer, then which of the following S2: Every real number has its corresponding
is correct? negative.
(a) xy P(x, y) (b) xy P(x, y) Here L(x, y) denotes “x loves y”
(c) yx P(x, y) (d) None of these P(x, y) denotes “x + y = 0”
Which of the following represent the correct
[MSQ] predicate logic of the given statement?
3. Which of the following is/ are negation of (a) S1:xy L(x, y), S2: yx p(x, y)
[xyz(P(x, y, z)  Q(x, y, z))] (b) S1:xy L(x, y), S2: xy p(x, y)
(a) xyz (~P(x, y, z)  ~ Q(x, y, z)) (c) S1: yx L(x, y), S2: xy p(x, y)
(b) xyz (P(x, y, z)  ~ Q(x, y, z)) (d) None of these.
(c) xyz (P(x, y, z)  Q(x, y, z))
(d) xyz (~ P(x, y, z)  ~ Q(x, y, z))

[NAT]
4. Consider the following logical expressions
(a) xy P(x, y)  yx P(x, y)
 2 3

Answer Key
Hints and Solutions
1. (a) 4. (2)
2. (d) 5. (c) 1. (a) P’Q’ + PQ  P’Q’ + PQ
3. (c, d) (a) xyz P(x, y, z) ~ [xyz(P(x, y, z)Q(x, y, z))]
z + y = 15 – x [xyz (~P(x, y, z)  ~ Q(x, y, z))] True
15 – integer = integer True Hence, option (c, d) are correct.
(b) z = 15 – x – y False
z must be independent, here z depends on x 4. (2)
and y. (a): Invalid
(c) z = 15 – x – y False xyP(x, y)  yx P(x, y) (One way true)
z should not depend on y. yxP(x, y)  yx P(x, y)
(d) y + z = 15 – x False (b): [xP(x)]  Q  [xP(x)  Q]
the value of (y + z) is depending on x, (y + z) (P1P2) + Q  (P1 Q)  (P2Q)
must be independent, so this expression is also
P1P2 + Q  P1P2 + P1Q + P2Q +Q
False.
P1P2 + Q  P1P2 + Q (valid)
(c): ∀x[P(x) ∧ Q] ↔ [∀x P(x)] ∧ Q
2. (d)
(P1 ∧ Q) ∧ (P2 ∧ Q) ≡ (P1 ∧ P2) ∧ Q
(a) xy P(x, y) False
P1QP2 Q ≡ P1 P2 Q
x2 + y2 = 10.0
P1 P2Q ≡ P1 P2Q
F(1, 3) = 1 + 9 = 10
Valid
Here, 10 is integer but output must be 10.0, it
(d): ∃x(P(x) ∨ Q) ↔ [∃x P(x)] ∧ Q
will never come because 10.0 is not an integer.
(P1 ∨ Q) ∨ (P2 ∨ Q) ≡ (P1 ∨ P2) ∧ Q
(b) xy P(x, y) False
P1 + Q + P2 + Q ≡ (P1 + P2) Q
10.0 will never come.
P1 + P2 + Q  (P1 + P2) Q Invalid
(c) yx P(x, y) False
Total 2 expressions are invalid
Hence, option (d) is correct
5. (c)
3. (c, d)
Statement S1: There is someone who is loved by
Negation of XOR operator is biconditional. everyone.
p q pq p↔q  Assume, variables x and y denote people
 A predicate L(x, y): denotes “x loves y”
0 0 0 1
yx L(x, y) there is someone who is loved by
0 1 1 0 everyone.
Statement S2: Every real number has its
1 0 1 0 corresponding negative.
 Assume, a real number is denoted as x and its
1 1 0 1
negative as y.
(c) ~ [xyz(P(x, y, z)Q(x, y, z))]  A predicate p(x, y) denotes “x + y = 0”
[xyz ~ (P(x, y, z) Q(x, y, z))]
 xy p(x, y)
[xyz (P(x, y, z) Q(x, y, z))] True Hence, option c is correct answer.
(d) Property:
P  Q  ~P  ~Q
 1
4

CSE/IT
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

For more questions, kindly visit the library section: Link for app: https://links.physicswallah.live/vyJw

For more questions, kindly visit the library section: Link for web: https://physicswallah.live/tabs/tabs/library-tab
Discrete Mathematics
PW Mobile APP: https://physicswala.page.link/?type=contact-us&data=open Nested Quantifiers DPP-07

For PW Website: https://www.physicswallah.live/contact-us

[MCQ] 3. Consider the following statements:
1. Consider I : x {p(x)  { x P(x)  fx Q(x)}
Actor (x) = x is an actor II. x y P (x, y)  y x P (x, y)]
Smart (x) = x is smart The number of valid statements is/are __________.
and the well-formed formula:
fx (Actor(x)  Smart (x)) [MSQ]
Choose the correct representation of above in 4. Choose among the following that are not equivalent to
english sentence. the given first order logic statement:
(x) (y) [p(x, y)  q(x, y)  r(x, y)]
(a) Some Actor is smart.
(b) Some Actor is not smart. (a) (x) (y) [p(x, y)  q(x, y)  r(x, y)]
(c) All actors are smart. (b) (x) (y) [p(x, y)  q(x, y)   r(x, y)]
(d) All smart are actors. (c)  (x) (y) [p(x, y)  q(x, y) r(x, y)]
(d)  (x) (y) [p(x, y)  q(x, y) r(x, y)]
[MCQ]
2. Consider the following statement
“There is exactly one apple”.
[MCQ]
Let G(x) : x is an apple.
5. Choose the correct representation for the below
Now consider the predicate logic statements:
statement:
I. x apple (x)  y (apple (y))  x = y) “Every player is liked by some coach”
II. x apple (x) (a)(x) [player (x)  y [coach (y)  likes (y, x) ] ]
The correct representation in predicate logic is ?
(b) (x) [player (x)  y [coach (y)  likes (y, x) ] ]
(a) Only I
(c)  (x) [player (x)  y [coach (y)  likes (y, x) ] ]
(b) Only II
(d)  (x) [player (x)  y [coach (y)  likes (y, x) ] ]
(c) Both I and II
(d) Neither I and II
[NAT]
 2
3

Answer Key
1. (a) 4. (a, b, c)
Hints and Solutions
2. (a) 5. (a)
3. (2) 1. (a) 4. (a, b, c,)
• f(x) represents some/any/atleast one:
Two points/rules to solve the question:
• Actor (x)  Smart (x) means x is an actor and smart.
I. x f(x)  (x) f(x)
• Therefore fx (Actor (x)  smart (x)) represents some
II. x f(x)   (x ) f(x)
actor is smart.
The given statement:
(x) (y) [p(x, y)  q(x, y)  r(x, y)]
2. (a)
Can be written as: -
I is the correct representation as it reads “there exist
an apple x and there exist an apple y and if apple y  (x) (y) [p(x, y)  q(x, y)  r(x, y)]
exists then it is equal to x” that means there is only NOTE: [ (xy)  3  xy3 ]
one apple (exactly one).
II is absolutely incorrect as it says “some apple or at 5. (a)
least one apple” instead of exactly one apple. We write “Every player” as x[player (x) ]
‘There is some coach who likes x” as y [coach (y)
p(x)]
3. (2) Where P is the property.
I: x {P(x)  Q(x)} = x { (P(x))  Q(x)} Therefore we can write the first order logic for the
= {x  (P(x))  x Q(x)} given statement as
= x P(x)  x Q(x)}  True. (x) [player (x)  y [coach (y)  likes (y, x) ] ]
II. x y P (n, y)
y P (a, y) for same a
P (a, b) is true for b = x P(x, b)
y x P (x, y) is ture.

For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab
For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala

For PW Website: https://www.physicswallah.live/contact-us
 1
2

CSE/IT Answer Key

Discrete Mathematics 1.
2.
(a, b, c)
(a)
4.
5.
(b)
(a, c)
Quantifier With Inference Rule DPP-08 3. (b)

[MSQ] [MCQ]
1. Consider the given logical statement. 4. Consider the given premises
S: “There is exactly one apple on the table” P1: A student in this class has not read the book
Domain is all objects on the table and A(x): x is an P2: Everyone in this class passed the first exam.
apple. Which of the following is conclusion of the given
Which of the following is/are correct predicate logic premises?
represent the statement? (a) Someone who passed the first exam has read the
(a) x[A(x)  y(y  x → ~A(y))] book.
(b) x[A(x)  y(A(y) → y = x)] (b) Someone who passed the first exam has not read
(c) x A(x)  x y ((A(x)  A(y) → x = y)) the book.
(d) y x (A(x)  (y) → x = y) (c) Everyone read the book.
(d) None of the above
[MCQ]
2. Which of the following is true about below predicate [MSQ]
logic p? 5. Let the premises are as follows:
p: ~z [p(z) → (~Q(z) → p(z)] P: x p(x)   ( y (P(y)  Q(y)))
(a) p is contradiction Which of the following can be concluded?
(b) p is tautology (a)  x Q(x)
(c) p is satisfiable (b)  x Q(x)
(d) none (c) x  Q(x)
(d) None of these
[MCQ]
3. Consider the given premises:
P1: Everyone in this discrete mathematics class has
taken a course in computer science.
P2: Madhu is a student in this class.
Which of the following is conclusion of the given
premises?
(a) Madhu has not taken a course in computer
science.
(b) Madhu has taken a course in computer science.
(c) Madhu has not studied discrete mathematics.
(d) None of these
 4
3
5. (a, c)
These steps can be used to establish the conclusion
Hints and Solutions from the premises.

Steps Reason
1. (a, b, c) Step Reason 1. x p(x)   ( y (P(y)  Premise
Option a: correct 1. x(D(x) → C(x)) Premise Q(y)))
The given predicate logic can be stated that there 2. D(Madhu) → C(Madhu) Universal 2. x p(x) Specialization (1)
exists x which is an apple and all other object y on instantiation (1) 3.  (y (P(y)  Q(y)) Specialization (1)
the table can not be the apple. 3. D(Madhu) Premise
Option b: correct 4. y  (P(y)  Q(y)) Negation of  (3)
4. C(Madhu) Modus ponens
x [A(x)  y (A(y) → y = x) 5. y ( P(y)   Q(y)) De Morgan (4)
from (2) and (3)
Appleon other apple(y) on the
6. P(x) E.I (2)
table table are apple (x)only. Hence, option B is correct. 7.  P(x)   Q (x) U.I (5)
Option c: correct 8.  Q (x) Elimination ()
xA(x)  yy ((A(x)  A(y) → x = y)) 4. (b)
9. x  Q(x) U.G (8)
I: Let C(x) be “x is in this class”.
Atleast one Atmost one apple 10. ~x Q(x) Negation of  (9)
apple B(x) denotes “x has read the book”.
Hence, the correct options are a, b and c. P(x) denotes “x passed the first exam”.
Hence, option a and c are equivalent.
Then:
2. (a) P1: x (C (x)   B (x))
I: The given predicate logic P: P2: x (C (x) → B (x))
~z[P(z) → (~Q(z) → P(z))]
This evaluate to there exists a z for which ~(P(z) II: Now, these steps can be used to establish the
→ (~Q(z) → P(z)) is true. conclusion from the premises.
II: Now, ~(P(z) → (~Q(z) → P(z))) Steps Reason
Q(z) : False 1. x (C(x)   B(x)) Premise

p(z) : False 2. C(a)   B(a) Existential
 ~(False → (~False → False)) instantiation (1)
 ~(False → (True → False)) 3. C(a) Simplification form (2)
 ~(False → False)  ~ (True)  False 4. x (C(x) → P(x)) Premise
III: Therefore, the predicate:
5. C(a) → P(a) Universal instantiation
z ~ [P(z) → (~Q(z) → P(z))] (4)
is false for all cases. Therefore this is a 6. P(a) Modus ponens from (3)
contradiction. and (5)
7.  B(a) Simplification from (2)
3. (b)
8. P(a)   B(a) Conjunction from (6)
I. Let D(x) denotes “x is in this discrete
and (7)
mathematic class”.
9. x (P(x)   Existential
C(x) denotes “x has taken a course in computer
B(x)) generalization from (8)
science.
Then: For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab
P1: x(D(x) → C(x)) Hence, the conclusion “someone who passed the first For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
P2: D(Madhu) exam has not read the book.” Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5
II: Now, following steps can be used to establish the
conclusion from the premises.
PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala
For PW Website: https://www.physicswallah.live/contact-us