Mathematical Reasoning

Question1
The compound statement (∼(P ∧ Q)) ∨ ((∼P) ∧ Q) ⇒ ((∼P) ∧ (∼Q)) is
equivalent to
[24-Jan-2023 Shift 1]
Options:

A. ((∼P) ∨ Q) ∧ ((∼Q) ∨ P)

B. (∼Q) ∨ P

C. ((∼P) ∨ Q) ∧ (∼Q)

D. (∼P) ∨ Q

Answer: A

Solution:

Solution:
Let r = (∼(P ∧ Q)) ∨ ((∼P) ∧ Q); s =
((∼P) ∧ (∼Q))
Option (A) : ((∼P) ∨ Q) ∧ ((∼Q) ∨ P)
is equivalent to (not of only P ) ∧ ( not of only Q )
= ( Both P, Q) and (neither P nor Q)

-------------------------------------------------------------------------------------------------

Question2
Let p and q be two statements.
Then ∼(p ∧ (p⇒ ∼ q)) is equivalent to
[24-Jan-2023 Shift 2]
Options:

A. p ∨ (p ∧ (∼q))

B. p ∨ ((∼p) ∧ q)

C. (∼p) ∨ q

D. p ∨ (p ∧ q)

Answer: C

Solution:

Solution:
∼ (p ∧ (p→ ∼ q))
 ≡ ∼ p ∨ ∼(∼p ∨ ∼q)
≡ ∼ p ∨ (p ∧ q)
≡ (∼p ∨ p) ∧ (∼p ∨ q)
≡ t ∧ (∼p ∨ q)
≡∼p∨q

-------------------------------------------------------------------------------------------------

Question3
The statement (p ∧ (∼q)) ⇒ (p ⇒ (∼q)) is
[25-Jan-2023 Shift 1]
Options:

A. equivalent to (∼p) ∨ (∼q)

B. a tautology

C. equivalent to p ∨ q

D. a contradiction

Answer: B

Solution:

Solution:
(p ∧ ∼q) → (p→ ∼ q)
≡ (∼(p ∧ ∼q)) ∨ (∼p ∨ ∼q)
≡ (∼p ∨ q) ∨ (∼p ∨ ∼q)
≡∼p∨t≡t

-------------------------------------------------------------------------------------------------

Question4
The statement (p ∧ (∼q)) ⇒ (p ⇒ (∼q)) is
[25-Jan-2023 Shift 1]
Options:

A. equivalent to (∼p) ∨ (∼q)

B. a tautology

C. equivalent to p ∨ q

D. a contradiction

Answer: B

Solution:

Solution:
(p ∧ ∼q) → (p→ ∼ q)
≡ (∼(p ∧ ∼q)) ∨ (∼p ∨ ∼q)
≡ (∼p ∨ q) ∨ (∼p ∨ ∼q)
≡∼p∨t≡t
-------------------------------------------------------------------------------------------------

Question5
Let ∆, ∇ ∈ {∧, ∨} be such that (p → q) ∆ (p∇q) is a tautology. Then
[25-Jan-2023 Shift 2]
Options:

A. ∆ = ∧, ∇ = ∨

B. ∆ = ∨, ∇ = ∧

C. ∆ = ∨, ∇ = ∨

D. ∆ = ∧, ∇ = ∧

Answer: C

Solution:

Solution:
Given(p → q) ∆ (p∇q)
Option I ∆ = ∧, ∇ = ∨
Option 2 ∆ = ∨, ∇ = ∧
Option 3 ∆ = ∨, ∇ = ∨
Hence, it is tautology.
Option 4 ∆ = ∧, ∇ = ∧

-------------------------------------------------------------------------------------------------

Question6
If p, q and r are three propositions, then which of the following
combination of truth values of p, q and r makes the logical expression
{(p ∨ q) ∧ ((∼p) ∨ r)} → ((∼q) ∨ r) false ?
[29-Jan-2023 Shift 1]
Options:

A. p = T, q = F, r = T

B. p = T, q = T, r = F

C. p = F, q = T, r = F

D. p = T, q = F, r = F

Answer: C

Solution:

Solution:
Option (3) (p ∨ q) ∧ (∼q ∨ r) → (∼p ∨ r) will be False.

-------------------------------------------------------------------------------------------------
Question7
The statement B ⇒ ((∼A) ∨ B) is equivalent to :
[29-Jan-2023 Shift 2]
Options:

A. B ⇒ (A ⇒ B)

B. A ⇒ (A ⇔ B)

C. A ⇒ ((∼A) ⇒ B)

D. B ⇒ ((∼A) ⇒ B)

Answer: 0

Solution:

Solution:
Question8
Among the statements:
(S1) ((p ∨ q) ⇒ r) ⇔ (p ⇒ r)
(S2) ((p ∨ q) ⇒ r) ⇔ ((p ⇒ r) ∨ (q ⇒ r))
[30-Jan-2023 Shift 1]
Options:

A. Only ( S1 ) is a tautology

B. Neither (S1) nor (S2) is a tautology

C. Only ( S2 ) is a tautology

D. Both (S1) and (S2) are tautologies

Answer: B

Solution:

Solution:
S1 ≡ ((p ∨ q) ⇒ r) ⇔ (p ⇒ r)
S2 ≡ (p ∨ q) ⇒ r ⇔ ((p ⇒ r) ∨ (q ⇒ r))
S2 → not a tautology

-------------------------------------------------------------------------------------------------

Question9
Consider the following statements:
P : I have fever
Q : I will not take medicine
R : I will take rest
The statement "If I have fever, then I will take medicine and I will take
rest" is equivalent to:
[30-Jan-2023 Shift 2]
Options:

A. ((∼P) ∨ ∼Q) ∧ ((∼P) ∨ R)

B. ((∼P) ∨ ∼Q) ∧ ((∼P) ∨ ∼R)

C. (P ∨ Q) ∧ ((∼P) ∨ R)

D. (P ∨ ∼Q) ∧ (P ∨ ∼R)

Answer: A

Solution:

Solution:
P → (∼Q ∧ R)
 ∼ P ∨ (∼Q ∧ R)
(∼P ∨ ∼Q) ∧ (∼P ∨ R)

-------------------------------------------------------------------------------------------------

Question10
(S1)(p ⇒ q) ∨ (p ∧ (∼q)) is a tautology
(S2)((∼p) ⇒ (∼q)) ∧ ((∼p) ∨ q) is a
Contradiction. Then
[31-Jan-2023 Shift 1]
Options:

A. only (S2) is correct

B. both (S1) and (S2) are correct

C. both (S1) and (S2) are wrong

D. only (S1) is correct

Answer: D

Solution:

Question11
The number of values of r ∈ {p, q, ∼p, ∼q} for which
((p ∧ q) ⇒ (r ∨ q)) ∧ ((p ∧ r) ⇒ q) is a tautology, is:
[31-Jan-2023 Shift 2]
Options:

A. 3

B. 2

C. 1
D. 4

Answer: B

Solution:
((p ∧ q) ⇒ (r ∨ q)) ∧ ((p ∧ r) ⇒ q)
We know, p ⇒ q is equivalent to
∼p∨q
(∼(p ∧ q) ∨ (r ∨ q)) ∧ (∼(p ∧ r)) ∨ q ) )
⇒ (∼p ∨ ∼q ∨ r ∨ q) ∧ (∼p ∨ ∼r ∨ q)
⇒ (∼p ∨ r ∨ t) ∧ (∼p ∨ ∼r ∨ q)
⇒ (t) ∧ (∼p ∨ ∼r ∨ q)
For this to be tautology, (∼p ∨ ∼r ∨ q) must be always true which follows for r = ∼ p or r = q.
-------------------------------------------------------------------------------------------------

Question12
The negation of the expression q ∨ ((∼q) ∧ p) is equivalent to
[1-Feb-2023 Shift 1]
Options:

A. (∼p) ∧ (∼q)

B. p ∧ (∼q)

C. (∼p) ∨ (∼q)

D. (∼p) ∨ q

Answer: A

Solution:
∼ (q ∨ ((∼q) ∧ p))
= ∼ q ∧ ∼((∼q) ∧ p)
= ∼ q ∧ (q ∨ ∼p)
= (∼q ∧ q) ∨ (∼q ∧ ∼p)
= (∼q ∧ ∼p)

Question13
Which of the following statements is a tautology ?
[1-Feb-2023 Shift 2]
Options:

A. p → (pΛ(p → q))

B. (pΛq) → (∼(p) → q) )

C. (pΛ(p → q))→ ∼ q

D. pV(pΛq)
Answer: B

Solution:

Solution:
(i)p → (pΛ(p → q))
(∼p)V(pΛ(∼pVq))
(∼p)V(fV(pΛq))
∼ pV(pΛq) = (∼pVp)Λ(∼pVq)
= ∼ pVq
(ii) (pΛq) → (∼p → q)
∼(pΛq)V(p ∨ q) = t
{a, b, d }V {a, b, c} = V
Tautology
(iii) (pΛ(p → q))→ ∼ q
∼(pΛ(∼pVq))V ∼ q = ∼ (pΛq)V ∼ q = ∼ pV ∼ q
Not tantology
(iv) pV (pΛq) = p
Not tautology.

-------------------------------------------------------------------------------------------------

Question14
Statement (P ⇒ Q) ∧ (R ⇒ Q) is logically equivalent to:
[6-Apr-2023 shift 1]
Options:

A. (P ∨ R) ⇒ Q

B. (P ⇒ R) ∨ (Q ⇒ R)

C. (P ⇒ R) ∧ (Q ⇒ R)

D. (P ∧ R) ⇒ Q

Answer: A

Solution:

Solution:
(P ⇒ Q) ∧ (R ⇒ Q)
We known that P ⇒ Q≡ ∼ P ∨ Q
⇒ (∼P ∨ Q) ∧ (∼R ∨ Q)
⇒ (∼P ∧ ∼R) ∨ Q
⇒ ∼ (P ∨ R) ∨ Q
⇒ (P ∨ R) ⇒ Q

-------------------------------------------------------------------------------------------------

Question15
Among the statements :
(S1) : (p ⇒ q) ∨ ((∼p) ∧ q) is a tautology
(S2) : (q ⇒ p) ⇒ ((∼p) ∧ q) is a contradiction
[6-Apr-2023 shift 2]
Options:
A. only (S2) is True

B. only (S1) is True

C. neigher (S1) and (S2) is True

D. both (S1) and (S2) are True

Answer: C

Solution:
Question16
Negation of (p → q) → (q → p) is
[8-Apr-2023 shift 1]
Options:

A. (−q) ∧ p

B. p ∨ (∼q)

C. (∼p) ∨ q

D. q ∧ (∼p)

Answer: D

Solution:

Solution:
(p → q) → (q → p)
∼ [∼p → q ∧ q → p]
⇒ p → q ∧ ∼q → p
⇒ ∼ p ∨ q ∧ q ∧ ∼p
⇒ q ∧ ∼p.

-------------------------------------------------------------------------------------------------

Question17
The negation of (p ∧ (∼q)) ∨ (∼p) is equivalent to
[8-Apr-2023 shift 2]
Options:

A. p ∧ (∼q)

B. p ∧ (q ∧ (∼p))

C. p ∨ (q ∨ (∼p))

D. p ∧ q

Answer: D

Solution:
-------------------------------------------------------------------------------------------------

Question18
The negation of the statement :
(p ∨ q) ∧ (q ∨ (∼r)) is
[10-Apr-2023 shift 1]
Options:

A. ((∼p) ∨ r) ) ∧ (∼q)

B. ( ( ∼ p) ∨(∼q) ) ∧ (∼r)

C. ((∼p) ∨ (∼q)) ∨ (∼r)

D. (p ∨ r) ∧ (∼q)

Answer: A

Solution:

(p ∨ q) ∧ (q ∨ (∼r))
∼ [(p ∨ q) ∧ (q ∨ (∼r))]
= ∼ (p ∨ q) ∧ (∼q ∧ r)
= (∼p ∧ ∼q) ∨ (∼q ∧ r)
= (∼p ∨ r) ∧ (∼q)

-------------------------------------------------------------------------------------------------

Question19
The statement ∼[pV(∼(p ∧ q))] is equivalent to
[10-Apr-2023 shift 2]
Options:

A. (∼(p ∧ q)) ∧ q

B. ∼(p ∨ q)
C. ∼(p ∧ q)

D. (p ∧ q) ∧ (∼p)

Answer: D

Solution:

Solution:
∼ [pv(∼(p ∧ q))]
∼ p ∧ (p ∧ q)

-------------------------------------------------------------------------------------------------

Question20
The number of ordered triplets of the truth values of p, q and r such
that the truth value of the statement ( p ∨q ) ∧ (p ∨ r) ⇒ (q ∨ r) is True,
is equal to ________.
[11-Apr-2023 shift 1]

Answer: 7

Solution:

Hence total no of ordered triplets are 7

-------------------------------------------------------------------------------------------------

Question21
The converse of ((∼p) ∧ q) ⇒ r is
[11-Apr-2023 shift 2]
Options:

A. (pv(∼q)) ⇒ (∼r)

B. ((∼p)vq) ⇒ r

C. (∼r) ⇒ ((∼p) ∧ q)

D. (∼r) ⇒ p ∧ q

Answer: A

Solution:

Solution:
((−P) ∧ 2) ⇒ r
Converse ....
∼ ((∼P) ∧ q) ⇒ (∼r)
(P ∨ (∼q)) ⇒ (∼r)

-------------------------------------------------------------------------------------------------

Question22
Among the two statements
(S1): (p ⇒ q) ∧ (p ∧ (∼q)) is a contradiction and
(S2) : (p ∧ q) ∨ ((∼p) ∧ q) ∨ (p ∧ (∼q)) ∨ ((∼p) ∧ (∼q)) is a tautology
[12-Apr-2023 shift 1]
Options:

A. only (S2) is true

B. only (S1) is true

C. both are true

D. both are false

Answer: C

Solution:
Question23
The negation of the statement ((A ∧ (B ∨ C)) ⇒ (A ∨ B)) ⇒ A is
[13-Apr-2023 shift 1]
Options:

A. equivalent to B ∨ ∼C

B. a fallacy

C. equivalent to ∼C

D. equivalent to ∼ A

Answer: D

Solution:

Solution:
p : ((A ∧ (B ∨ C)) ⇒ (A ∨ B)) ⇒ A
[∼(A ∧ (B ∨ C)) ∨ (A ∨ B)] ⇒ A
[(A ∧ (B ∨ C)) ∧ ∼(A ∨ B)] ∨ A
(f ∨ A) = A
∼ p≡ ∼ A

-------------------------------------------------------------------------------------------------

Question24
The statement (p ∧ (∼q)) ∨ ((∼p) ∧ q) ∨ ((∼p) ∧ (∼q)) is equivalent to
[13-Apr-2023 shift 2]
Options:

A. (∼p) ∨ (∼q)

B. (∼p) ∧ (∼q)

C. p ∨ (∼q)

D. p ∨ q

Answer: A

Solution:

Solution:
(p ∧ ∼q) ∨ (∼p ∧ q) ∨ (∼p ∧ ∼q)

p ∧ ∼q⇒
∼p ∧ q =

(p ∧ ∼q) ∨ (∼p ∧ q)(∼p ∧ ∼q)

(α, β)
(∼p) ∨ (∼q)
Plane passing through (0, −1, 2) and (−1, 2, 1)
then vector in plane <−1, 3, −1> vector parallel to plane is ⟨4, 2, −6⟩ normal vector to plane L2

| |
^ ^ ^
i j k
(→
n) = −1 3 −1
4 2 −6
^ ^
= i(−16) − j (10) + k (−14)
→
n = < 8, 5, 7>
Equation of plane
8(x − 0) + 5(y + 1) + 7(z − 2) = 0
⇒ 8x + 5y + 7z = 9
From given options point (−2, 5, 0) lies on plane.

-------------------------------------------------------------------------------------------------

Question25
Negation of p ∧ (q ∧ ∼(p ∧ q)) is
[15-Apr-2023 shift 1]
Options:

A. (∼(p ∧ q)) ∧ q

B. ∼(p ∨ q)

C. p ∨ q

D. (∼(p ∧ q)) ∨ p

Answer: D

Solution:
Solution:
∼ [p ∧ (q ∧ ∼(p ∧ q))]
∼ p ∨ (∼q ∨ (p ∧ q))
∼ p ∨ ((∼q ∨ p) ∧ (∼q ∨ q))
∼ p ∨ (∼q ∨ p)
∼ (p ∧ q) ∨ p

-------------------------------------------------------------------------------------------------

Question26
The number of choices for ∆ ∈ {∧, ∨, ⇒, ⇔}, such that
(p ∆ q) ⇒ ((p∆ ∼ q) ∨ ((∼p) ∆ q)) is a tautology, is :
[24-Jun-2022-Shift-1]
Options:

A. 1

B. 2

C. 3

D. 4

Answer: B

Solution:

Solution:

Then (p ∆ ∼ q) ∨ (∼ p ∆ q) becomes
(p ∨ ∼ q) ∨ (∼ p ∨ q) which is always true, so x becomes a tautology.
Case-II
When ∆ is same as ∧
Then (p ∧ q) ⇒ (p ∧ ∼ q) ∨ (∼ p ∧ q)
If p ∧ q is T , then (p ∧ ∼ q) ∨ (∼ p ∧ q) is F
so x cannot be a tautology.
Case-III
When ∆ is same as ⇒Then (p ⇒ ∼ q) ∨ (∼ p ⇒ q) is same at (∼ p ∨ ∼ q) ∨ (p ∨ q), which is always true, so x becomes a
tautology.
Case-IV
When ∆ is same as ⇔
Then (p ⇔ q) ⇒ (p ⇔ ∼ q) ∨ (∼ p ⇔ q)
p ⇔ q is true when p and q have same truth values, then p ⇔ ∼ q and ∼ p ⇔ q both are false. Hence x cannot be a
tautology.

-------------------------------------------------------------------------------------------------

Question27
Consider the following statements:
A : Rishi is a judge.
B : Rishi is honest.
C : Rishi is not arrogant.
The negation of the statement "if Rishi is a judge and he is not
arrogant, then he is honest" is
[24-Jun-2022-Shift-2]
Options:

A. B → (A ∨ C)

B. (∼B) ∧ (A ∧ C)

C. B → ((∼A) ∨ (∼C))

D. B → (A ∧ C)

Answer: B

Solution:

Solution:

-------------------------------------------------------------------------------------------------

Question28
Consider the following two propositions:
P1 : ∼(p→ ∼ q)
P2 : (p ∧ ∼q) ∧ ((∼p) ∨ q)
If the proposition p → ((∼p) ∨ q) is evaluated as FALSE, then :
[25-Jun-2022-Shift-1]
Options:

A. P1 is TRUE and P2 is FALSE

B. P1 is FALSE and P2 is TRUE

C. Both P1 and P2 are FALSE

D. Both P1 and P2 are TRUE

Answer: C

Solution:
p → (∼p ∨ q) is F when p is true q is false
From table
P1 & P2 both are false
-------------------------------------------------------------------------------------------------

Question29
The negation of the Boolean expression ((∼q) ∧ p) ⇒ ((∼p) ∨ q) is
logically equivalent to :
[25-Jun-2022-Shift-2]
Options:

A. p ⇒ q

B. q ⇒ p

C. ∼(p ⇒ q)

D. ∼(q ⇒ p)

Answer: C

Solution:

Solution:
Let S : ((∼q) ∧ p) ⇒ ((∼p) ∨ q)
⇒S : ∼((∼q) ∧ p) ∨ ((∼p) ∨ q)
⇒S : (q ∨ (∼p)) ∨ ((∼p) ∨ q)
⇒S : (∼p) ∨ q
⇒S : p ⇒ q
So, negation of S will be ∼(p ⇒ q)

-------------------------------------------------------------------------------------------------

Question30
Let ∆, ∇ ∈ {∧, V } be such that p∇q ⇒ ((p ∆ q)∇r) is a tautology. Then (p
∇q ) ∆ r is logically equivalent to :
[26-Jun-2022-Shift-1]
Options:

A. (p ∆ r) ∨ q

B. (p ∆ r) ∧ q

C. (p ∧ r) ∆ q

D. (p∇r) ∧ q

Answer: A

Solution:

Solution:

Question31
Let r ∈ {p, q, ∼p, ∼q} be such that the logical statement
r ∨ (∼p) ⇒ (p ∧ q) ∨ r
is a tautology. Then r is equal to :
[26-Jun-2022-Shift-2]
 Options:

A. p

B. q

C. ∼p

D. ∼q

Answer: C

Solution:

-------------------------------------------------------------------------------------------------

Question32
The boolean expression (∼(p ∧ q)) ∨ q is equivalent to :
[27-Jun-2022-Shift-1]
Options:

A. q → (p ∧ q)

B. p → q

C. p → (p → q)

D. p → (p ∨ q)

Answer: D

Solution:

-------------------------------------------------------------------------------------------------

Question33
Which of the following statement is a tautology?
[27-Jun-2022-Shift-2]
Options:

A. ((∼q) ∧ p) ∧ q

B. ((∼q) ∧ p) ∧ (p ∧ (∼p))

C. ((∼q) ∧ p) ∨ (p ∨ (∼p))

D. (p ∧ q) ∧ (∼p ∧ q) )

Answer: C

Solution:

Solution:
∵((∼q) ∧ p) ∨ (p ∨ (∼p))
= (∼q ∧ p) ∨ t(t is tautology )
≡t
∴ option (C) is correct.

-------------------------------------------------------------------------------------------------

Question34
Let p, q, r be three logical statements. Consider the compound
statements S1 : ((∼p) ∨ q) ∨ ((∼p) ∨ r) and S2 : p → (q ∨ r)
Then, which of the following is NOT true?
[28-Jun-2022-Shift-1]
Options:

A. If S2 is True, then S1 is True

B. If S2 is False, then S1 is False

C. If S2 is False, then S1 is True

D. If S1 is False, then S2 is False

Answer: C

Solution:

Solution:
S1 : (∼p ∨ q) ∨ (∼p ∨ r)
≅(∼p ∨ q ∨ r)
S2 : ∼p ∨ (q ∨ r)
Both are same
So, option (C) is incorrect.

-------------------------------------------------------------------------------------------------

Question35
Suppose a class has 7 students. The average marks of these students in
the mathematics examination is 62 , and their variance is 20. A student
fails in the examination if he/she gets less than 50 marks, then in worst
case, the number of students can fail is_____
[28-Jun-2022-Shift-2]

Answer: 0

Solution:

Solution:
According to given data
7
∑ (xi − 62)2
i=1
= 20
7
7
⇒ ∑ (xi − 62)2 = 140
i=1
2
So for any xi, (xi − 62) ≤ 140
⇒xi > 50 ∀i = 1, 2, 3, ..... . 7
So no student is going to score less than 50.

-------------------------------------------------------------------------------------------------

Question36
The maximum number of compound propositions, out of
p ∨ r ∨ s, p ∨ r⋁ ∼ s, p ∨ ∼q ∨ s, ∼p ∨ ∼r ∨ s, ∼p ∨ ∼r ∨ ∼s, ∼p ∨ q ∨ ∼
s, q ∨ r ∨ ∼s, q ∨ ∼r ∨ ∼s, ∼p ∨ ∼q ∨ ∼s that can be made
simultaneously true by an assignment of the truth values to p, q, r and
s, is equal to___
[28-Jun-2022-Shift-2]

Answer: 9

Solution:

Solution:
There are total 9 compound propositions, out of which 6 contain ∼s. So if we assign s as false, these 6 propositions will
be true.
In remaining 3 compound propositions, two contain p and the third contains ∼r. So if we assign p and r as true and false
respectively, these 3 propositions will also be true.
Hence maximum number of propositions that can be true are 9.

-------------------------------------------------------------------------------------------------

Question37
Let ∆ ∈ {∧, ∨, ⇒, ⇔} be such that (p ∧ q) ∆ ((p ∨ q) ⇒ q) is a tautology.
Then ∆ is equal to :
[29-Jun-2022-Shift-1]
Options:

A. ∧

B. V

C. ⇒

D. ⇔

Answer: C

Solution:

Solution:
p∨q⇒q
⇒ ∼ (p ∨ q) ∨ q
⇒(∼p ∧ ∼q) ∨ q
⇒(∼p ∨ q) ∧ (∼q ∨ q)
⇒(∼p ∨ q) ∧ t = ∼ p ∨ q
Now by taking option C
(p ∧ q)⇒ ∼ p ∨ q
⇒ ∼ p ∨ ∼q ∨ ∼p ∨ q
⇒t

-------------------------------------------------------------------------------------------------

Question38
Negation of the Boolean statement (p ∨ q) ⇒ ((∼r) ∨ p) is equivalent to
[29-Jun-2022-Shift-2]
Options:

A. p ∧ (∼q) ∧ r

B. (∼p) ∧ (∼q) ∧ r

C. (∼p) ∧ q ∧ r

D. p ∧ q ∧ (∼r)

Answer: C

Solution:

Solution:
Given,
(p ∨ q) ⇒ ((∼r) ∨ p)
Negation is
∼((p ∨ q) ⇒ (∼r) ∨ p) )
= (p ∨ q) ∧ ∼((∼r) ∨ p)
= (p ∨ q) ∧ (r ∧ ∼p)
[(p ∧ ∼p) ∨ (q ∧ ∼p)] ∧ r
= q ∧ ∼p ∧ r

-------------------------------------------------------------------------------------------------
Question39
Which of the following statements is a tautology?
[25-Jul-2022-Shift-1]
Options:

A. ((∼p) ∨ q) ⇒ p

B. p ⇒ ((∼p) ∨ q)

C. ((∼p) ∨ q) ⇒ q

D. q ⇒ ((∼p) ∨ q)

Answer: D

Solution:

Solution:

-------------------------------------------------------------------------------------------------

Question40
Consider the following statements:
P : Ramu is intelligent.
Q : Ramu is rich.
R : Ramu is not honest.
The negation of the statement "Ramu is intelligent and honest if and
only if Ramu is not rich" can be expressed as:
[25-Jul-2022-Shift-2]
Options:

A. ((P ∧ (∼R)) ∧ Q) ∧ ((∼Q) ∧ ((∼P) ∨ R))

B. ((P ∧ R) ∧ Q) ∨ ((∼Q) ∧ ((∼P) ∨ (∼R)))

C. ((P ∧ R) ∧ Q) ∧ ((∼Q) ∧ ((∼P) ∨ (∼R)))

D. ((P ∧ (∼R)) ∧ Q) ∨ ((∼Q) ∧ ((∼P) ∨ R))

Answer: D

Solution:

Solution:
P: Ramu is intelligent
Q: Ramu is rich
R : Ramu is not honest
Given statement, "Ramu is intelligent and honest if and only if Ramu is not rich" = (P ∧ ∼R)⇔ ∼ Q
So, negation of the statement is
∼[(P ∧ ∼R)⇔ ∼ Q]
= ∼ [{∼(P ∧ ∼R) ∨ ∼Q} ∧ {Q ∨ (P ∧ ∼R)}]
= ((P ∧ ∼R) ∧ Q) ∨ (∼Q ∧ (∼P ∨ R))
-------------------------------------------------------------------------------------------------

Question41
The statement (∼(p⇔ ∼ q)) ∧ q is :
[26-Jul-2022-Shift-1]
Options:

A. a tautology

B. a contradiction

C. equivalent to (p ⇒ q) ∧ q

D. equivalent to (p ⇒ q) ∧ p

Answer: D

Solution:

Solution:
∼(p⇔ ∼ q) ∧ q
= (p ⇔ q) ∧ q

∴(∼(p⇔ ∼ q)) ∧ q is equivalent to (p ⇒ q) ∧ p.

-------------------------------------------------------------------------------------------------

Question42
Negation of the Boolean expression p ⇔ (q ⇒ p) is
[26-Jul-2022-Shift-2]
Options:

A. (∼p) ∧ q

B. p ∧ (∼q)

C. (∼p) ∨ (∼q)

D. (∼p) ∧ (∼q)

Answer: D

Solution:
p ⇔ (q ⇒ p)
∼(p ⇔ (q ⇔ p))
≡p⇔ ∼ (q ⇒ p)
≡p ⇔ (q ∧ ∼p)
≡(p ⇒ (q ∧ ∼p)) ∧ ((q ∧ ∼p) ⇒ p) )
≡(∼p ∨ (q ∧ ∼p)) ∧ ((∼q ∨ p) ∨ p) )
≡((∼p ∨ q) ∧ ∼p) ∧ (∼q ∨ p)
≡ ∼ p ∧ (∼q ∨ p)

≡(∼p ∧ ∼q) ∨ (∼p ∧ p)

≡(∼p ∧ ∼q) ∨ c
≡(∼p ∧ ∼q)

-------------------------------------------------------------------------------------------------

Question43
(p ∧ r) ⇔ (p ∧ (∼q)) is equivalent to (∼p) when r is
[27-Jul-2022-Shift-1]
Options:

A. p

B. ∼p

C. q

D. ∼q

Answer: C

Solution:

Solution:

Clearly p ∧ q ⇔ p ∧ ∼q≡ ∼ p
∴r = q

-------------------------------------------------------------------------------------------------

Question44
If the truth value of the statement (P ∧ (∼R)) → ((∼R) ∧ Q) is F, then the
truth value of which of the following is F ?
[27-Jul-2022-Shift-2]
Options:

A. P ∨ Q→ ∼ R

B. R ∨ Q→ ∼ P
C. ∼(P ∨ Q)→ ∼ R

D. ∼(R ∨ Q)→ ∼ P

Answer: D

Solution:

Solution:
X ⇒ Y is a false
when X is true and Y is false
So, P → T, Q → F, R → F
(A) P ∨ Q→ ∼ R is T
(B) R ∨ Q→ ∼ P is T
(C) ∼(P ∨ Q)→ ∼ R is T
(D) ∼ (R ∨ Q)→ ∼ P is F

-------------------------------------------------------------------------------------------------

Question45
Let the operations *, ⊙ ∈ {∧, ∨}. If (p * q)⊙(p⊙ ∼ q) is a tautology, then
the ordered pair (*, ⊙) is:
[28-Jul-2022-Shift-1]
Options:

A. (∨, ∧)

B. (V, V)

C. (∧, ∧)

D. (∧, ∨)

Answer: B

Solution:

Solution:
*, ⊙ ∈ {∧, ∨}
Now for (p * q)⊙(p⊙ ∼ q) is tautology
(A) (∨, ∧) : (p ∨ q) ∧ (p ∧ ∼q) not a tautology
(B) (∨, ∨) : (p ∨ q) ∨ (p ∨ ∼q)
= P ∨ T is tautology
(C) (∧, ∧) : (p ∧ q) ∧ (p ∧ ∼q)
= (p ∧ p) ∧ (q ∧ ∼q) = p ∧ F not a tautology (Fallasy)
(D) (∧, ∨) : (p ∧ q) ∨ (p ∨ ∼q) not a tautology

-------------------------------------------------------------------------------------------------

Question46
Let
p : Ramesh listens to music.
q : Ramesh is out of his village.
r : It is Sunday.
s : It is Saturday.
Then the statement "Ramesh listens to music only if he is in his village
and it is Sunday or Saturday" can be expressed as
[28-Jul-2022-Shift-2]
Options:

A. ((∼q) ∧ (r ∨ s)) ⇒ p

B. (q ∧ (r ∨ s)) ⇒ p

C. p ⇒ (q ∧ (r ∨ s))

D. p ⇒ ((∼q) ∧ (r ∨ s))

Answer: D

Solution:

Solution:
p : Ramesh listens to music
q : Ramesh is out of his village
r : It is Sunday
s : It is Saturday
p → q conveys the same p only if q
Statement "Ramesh listens to music only if he is in his village and it is Sunday or Saturday"
p ⇒ ((∼q) ∧ (r ∨ s))

-------------------------------------------------------------------------------------------------

Question47
The statement (p ∧ q) ⇒ (p ∧ r) is equivalent to :
[29-Jul-2022-Shift-1]
Options:

A. q ⇒ (p ∧ r)

B. p ⇒ (p ∧ r)

C. (p ∧ r) ⇒ (p ∧ q)

D. (p ∧ q) ⇒ r

Answer: D

Solution:

Solution:
(p ∧ q) ⇒ (p ∧ r) is equivalent to (p ∧ q) ⇒ r

-------------------------------------------------------------------------------------------------

Question48
The statement (p ⇒ q) ∨ (p ⇒ r) is NOT equivalent to
[29-Jul-2022-Shift-2]
Options:

A. (p ∧ (∼r)) ⇒ q

B. (∼q) ⇒ ((∼r) ∨ p)

C. p ⇒ (q ∨ r)

D. (p ∧ (∼q)) ⇒ r

Answer: B

Solution:

Solution:
(A) (p ∧ (∼r)) ⇒ q
∼(p ∧ ∼r) ∨ q
≡(∼p ∨ r) ∨ q
≡ ∼ p ∨ (r ∨ q)
≡p → (q ∨ r)
≡(p ⇒ q) ∨ (p ⇒ r)
(C) p ⇒ (q ∨ r)
≡ ∼ p ∨ (q ∨ r)
≡(∼p ∨ q) ∨ (∼p ∨ r)
≡(p → q) ∨ (p → r)
(D) (p ∧ ∼q) ⇒ r
≡p ⇒ (q ∨ r)
≡(p ⇒ q) ∨ (p ⇒ r)

-------------------------------------------------------------------------------------------------

Question49
The contrapositive of the statement; "If you will work, you will earn
money" is
[2021, 25 Feb. Shift-II]
Options:

A. to earn money, you need to work

B. you will earn money, if you will not work

C. if you will not earn money, you will not work

D. if you will earn money, you will work

Answer: C

Solution:

Solution:
Contrapositive of p → q is ∼→ ∼ p
p: you will work
⇒ p:you will not work
q: you will earn money ⇒∼
q:you will not earn money
Then,
∼q→∼ : if you will not earn money, you will not work.

-------------------------------------------------------------------------------------------------
Question50
Let F 1(A, B, C) = (A ∧ ∼B) ∨ [∼C ∧ (A ∨ B)] ∨ ∼A and
F 2(A, B) = (A ∨ B) ∨ (B→ ∼ A) be two logical expressions. Then,
[2021, 26 Feb. Shift-II]
Options:

A. F 1 and F 2 both are tautologies

B. F 1 is a tautology but F 2 is not a tautology

C. F 1 is not tautology but F 2 is a tautology

D. Both F 1 and F 2 are not tautologies

Answer: C

Solution:

Solution:
F 1(A, B, C) = (A ∧ ∼B) ∨ [∼C ∧ (A ∨ B)] ∨ ∼A
≡{ (A ∧ ∼B) ∨ [∼C ∧ (A ∨ B)] (Associative
law)
≡{(A ∨ ∼A) ∧ (∼B ∨ ∼A)} ∨ [(A ∨ B) ∧ C] (distributive
law)
≡(∼B ∨ ∼A) ∨ [(A ∨ B) ∧ ∼C]
≡[(∼A ∼ B) ∨ (A ∨ B)] ∧ [(∼A ∨ ∼B) ∨ ∼C]
≡T ∧ (∼A ∨ ∼B) ∨ ∼C
≡(∼A ∨ ∼B) ∨ ∼C
Which is not a tautology.
Now, F 2(A, B) = (A ∨ B) ∨ (B→ ∼ A)
≡(A ∨ B) ∨ (∼B ∨ ∼A)
Hence, F 2 is a tautology.

-------------------------------------------------------------------------------------------------

Question51
The statement A → (B → A) is equivalent to
[2021, 25 Feb. Shift-1]
Options:

A. A → (A ∧ B)

B. A → (A → B)

C. A → (A ↔ B)

D. A → (A ∨ B)

Answer: D

Solution:

Solution:
Given, statement A → (B → A)
 ≡ A → (∼B ∨ A)
≡ ∼ A ∨ (∼B ∨ A)
≡ (∼A ∨ A) ∨ ∼B
≡ T ∨ ∼B ≡ T
∴T ∨ B = T ≡ (∼A ∨ A) ∨ B
≡ ∼ A ∨ (A ∨ B)
≡ A → (A ∨ B)

-------------------------------------------------------------------------------------------------

Question52
For the statements p and q, consider the following compound
statements
A. [∼q ∧ (p → q)]→ ∼ p
B. [(p ∨ q) ∧ ∼p] → q
Then, which of the following statement(s) is/are correct?
[2021, 24 Feb. Shift-II]
Options:

A. (A) and (B) both are not tautologies.

B. (A) and (B) both are tautologies.

C. (A) is a tautology but not (B).

D. (B) is a tautology but not (A).

Answer: B

Solution:

Given statements,
(A) [ ∼q ∧ (p → q]→ ∼ p
(B) [(p ∨ q) ∧ ∼p] → q
For statement (A),

∴ Statement (A) is tautology.

For statement (B),
∴ Statement (B) is tautology.
∴(A) and (B) both are tautologies.
-------------------------------------------------------------------------------------------------

Question53
The negative of the statement ∼p ∧ (p ∨ q) is
[2021, 24 Feb. Shift-II]
Options:

A. p ∨ q

B. p ∨ ∼q

C. p ∧ q

D. p ∧ ∼q

Answer: B

Solution:

Solution:
Given, statement [ ∼p ∧ (p ∨ q]
Negative of given statement ∼[ ∼p ∧ (p ∨ q)
= p ∨ ∼[p ∨ q) [By De morgan's law]
= p ∨ (∼p ∧ ∼q) [By De Morgani law]
= (p ∨ ∼p) ∧ (p ∨ ∼q) [Using Distribution property]

-------------------------------------------------------------------------------------------------

Question54
The statement among the following that is a tautology is
[2021, 24 Feb. Shift-1]
Options:

A. A ∧ (A ∨ B)

B. A ∨ (A ∧ B)

C. [A ∧ (A → B)] → B

D. B → [A ∧ (A → B)]
Answer: C

Solution:

Solution:
Given, [A ∧ (A → B)] → B
= A ∧ (∼A ∨ B) → B
= [(A ∧ ∼A) ∨ (A ∧ B)] → B
= (A ∧ B) → B
= ∼ A ∨ ∼B ∨ B = t
Hence, [A ∧ (A → B)] → B is a tautology.

-------------------------------------------------------------------------------------------------

Question55
The statement among the following that is a tautology is:
24 Feb 2021 Shift 1
Options:

A. A ∨ (A ∧ B)

B. A ∧ (A ∨ B)

C. B → [A ∧ (A → B)]

D. [A ∧ (A → B)] → B

Answer: D

Solution:

Solution:
(A ∧ (A → B)) → B
= (A ∧ (∼A ∨ B)) → B
= ((A ∧ ∼A) ∨ (A ∧ B)) → B
= (A ∧ B) → B
= ∼ (A ∧ B) ∨ B
= (∼A ∨ ∼B) ∨ B
=T

-------------------------------------------------------------------------------------------------

Question56
If p and q are two statements, then which of the following compound
statement is a tautology?
[2021, 18 March Shift-II]
Options:

A. (p ⇒ q) ∧ ∼q ] ⇒ 0

B. (p ⇒ q) ∧ ∼q ]⇒ ∼ p

C. (p ⇒ q) ∧ ∼q ] ⇒ p

D. (p ⇒ q) ∧ ∼q ] ⇒ (p ∧ q)
Answer: B

Solution:

Solution:
To check options one by one,
(a) [(p → q) ∧ ∼q] → q
≡(∼p ∧ ∼q) → q
≡(p ∨ q) ∨ q ≡ p ∨ q
(b) [ (p → q) ∧ ∼q ]→ ∼ p
≡ (p ∨ q) ∨ ∼p
≡t
(c)[(p → q) ∧ ∼q] → p
≡ [(∼p ∨ q) ∧ ∼q] → p
≡ (∼p ∧ ∼q) → p
≡ (p ∨ q) ∨ p ≡ (p ∨ q)
(d )[(p → q) ∧ ∼q] → p ∧ q
≡ (p ∨ q) ∨ (p ∧ q)
≡ [(p ∨ q) ∨ p] ∧ [(p ∨ q) ∨ q]
≡ (p ∨ q) ∧ (p ∨ q) ≡ (p ∨ q)

-------------------------------------------------------------------------------------------------

Question57
If the Boolean expression (p ⇒ q) ⇔ (q*(∼p)) is a tautology, then the
Boolean expression (p*(∼q)) is equivalent to
[2021, 17 March Shift-1]
Options:

A. q ⇒ p

B. q ⇒ p

C. p⇒ ∼ q

D. p ⇒ q

Answer: A

Solution:

Solution:
The Boolean expression
(p ⇒ q) ⇔ (q*(∼p)) is a tautology.
Making the truth table for this

∴ ∼ (∼q ∧ p) = q ∨ ∼p = ∼ p ∨ q
∴* is equivalent to V .
p* ∼ q = p ∨ ∼q
= ∼q∨p
=q⇒p

-------------------------------------------------------------------------------------------------

Question58
If the Boolean expression (p ∧ q)*(p ⊗ q) is a tautology, then *
and ⊗ are
respectively, given by
[2021, 17 March Shift-II]
Options:

A. →, →

B. ∧∨

C. v1 →

D. ∧→

Answer: A

Solution:

Solution:

Clearly * and ⊗ are →, → respectively for tautology.

-------------------------------------------------------------------------------------------------

Question59
Which of the following Boolean expression is a tautology?
[2021, 16 March Shift-1]
Options:

A. (p ∧ q) ∨ (p ∨ q)

B. (p ∧ q) ∨ (p → q)

C. (p ∧ q) ∧ (p → q)

D. (p ∧ q) → (p → q)

Answer: D
Solution:

Solution:
Let p and q are two statements.
Let's make the truth table and see (p ∧ q) implies (p ∨ q) or not.

Since, last column of the truth table for (p ∧ q) → (p → q) contains T sonly.

So, (p ∧ q) → (p → q) is a tautology.

-------------------------------------------------------------------------------------------------

Question60
Which of the following is the negation of the statement "for all M > 0,
there exist x ∈ S such that x ≥ M "?
[2021, 27 July Shift-II]
Options:

A. there exists M > 0, such that x < M for all x ∈ S

B. there exists M > 0, there exists x ∈ S such that x ≥ M

C. there exists M > 0, there exists x ∈ S such that x < M

D. there exists M > 0, such that x ≥ M for all x ∈ S

Answer: A

Solution:

Solution:
Let P : for all M > 0, there exists x ∈ S such that x ≥ M
∼P :there exists M > 0, for all x ∈ S such that x < M
( ∵ negation of 'there exists' is 'for all')

-------------------------------------------------------------------------------------------------

Question61
Consider the statement "The match will be played only if the weather is
good and ground is not wet".
Select the correct negation from the following
[2021,25 July Shift-II]
Options:
A. The match will not be played andweather is not good and ground is wet.

B. If the match will not be played, then either weather is not good or ground is wet.

C. The match will be played and weather is not good or ground is wet.

D. The match will not be played or weather is good and ground is not wet.

Answer: C

Solution:

Solution:
Let p: The match will be played
q :weather is good
r : ground is not wet
∼[p → (q ∧ r)] = p ∧ ∼(q ∧ r) = p ∧ (∼q ∨ ∼r)
The match will be played and weather is not good or ground is wet.

-------------------------------------------------------------------------------------------------

Question62
Consider the following three statements,
(A) If 3 + 3 = 7, then 4 + 3 = 8
(B) If 5 + 3 = 8, then earth is flat
(C) If both (A) and (B) are true, then 5 + 6 = 17
Then, which of the following statements is correct
[2021, 20 July Shift II]
Options:

A. (A) is false, but (B) and (C) are true

B. (A) and (C) are true while (B) is false

C. (A) is true while (B) and (C) are false

D. (A) and (B) are false while (C) is true

Answer: B

Solution:

Solution:
To solve this, let's construct a truth table for p → q

For (A), statements pandqare as follows,

p:3+3=7
q:4+3=8
Since, pis false, then p → q is true.
Hence, (A) is true.
For (B), statements pand qare as follows,
p:5+3=8
q : Earth is flat
Here, p is true and q is false.
∴ p → q is false.
Hence, (b) is false.
For (c), statements pandqare as follows,
p: Both (A) and (B) are true.
q : 5 + 6 = 17
Here ' p ' is false because (B) is not true, then
p → q is true.
Hence, (c) is true.

-------------------------------------------------------------------------------------------------

Question63
The compound statement (P ∨ Q) ∧ (∼P) ⇒ Q is equivalent to
[2021, 27 July Shift-1]
Options:

A. P ∨ Q

B. P ∧ ∼Q

C. ~(P ⇒ Q)

D. ~(P ⇒ Q) ⇔ P ∧ ∼Q

Answer: D

Solution:
-------------------------------------------------------------------------------------------------

Question64
The Boolean expression (p ⇒ q) ∧ (q⇒ ∼ p) is equivalent to
[2021, 25 July Shift-1]
Options:

A. ∼q

B. q

C. p

D. p

Answer: D

Solution:

(p → q) ∧ (q→ ∼ p)
(∼p ∨ q) ∧ (∼q ∨ ∼p) [∵p → q≡ ∼ p ∨ q]
⇒(∼p ∨ q) ∧ (∼p ∨ ∼q) [commutative property]
⇒ ∼ p ∨ (q ∧ ∼q) (distributive property)
⇒∼p

Question65
Which of the following Boolean expression is not a tautology ?
[2021, 22 July Shift-II]
Options:

A. (p ⇒ q) ∨ (∼q ⇒ p)

B. (q ⇒ p) ∨ (∼q ⇒ p)

C. (p⇒ ∼ q) ∨ (∼q ⇒ p)

D. (∼p ⇒ q) ∨ (∼q ⇒ p)

Answer: D

Solution:
(i) (p → q) ∨ (∼p → p)
= (∼p ∨ q) ∨ (q ∨ p)
= (∼p ∨ q) ∨ q = t ∨ q = t
(ii) (q → p) ∨ (∼q → p)
= (∼q ∨ p) ∨ (q ∨ p)
= (∼q ∨ q) ∨ p = t ∨ p = True
(iii) (p→ ∼ q) ∨ (∼q → p)
= (∼p ∨ ∼q) ∨ (q ∨ p)
= (∼p ∨ q) ∨ (∼q ∨ q) = T ∨ T = T
(iv) (∼q → q) ∨ (∼q → p)
=p∨q∨q∨p=p∨p∨q∨q
=p∨q
Not a tautology.

-------------------------------------------------------------------------------------------------

Question66
The Boolean expression (p ∧ ∼q) ⇒ (q ∨ ∼p) is equivalent to
[2021, 20 July Shift-1]
Options:

A. q ⇒ p

B. p ⇒ q

C. q ⇒ p

D. p⇒ ∼ q

Answer: B

Solution:

Solution:
(p ∧ ∼q) ⇒ (q ∨ ∼p)
So, option (b) is correct.

-------------------------------------------------------------------------------------------------

Question67
Let *, square, in{wedge, v} be such that the Boolean expression
left(p* sim q right) Rightarrow(pq) is a tautology. Then
[2021,31 Aug. Shift-I]
Options:

A. * = v1 = v

B. * = ∧1 =∧

C. * = Λ′ = ∨

D. * = v1 = ∧

Answer: C

Solution:

Solution:

∴(p ∧ ∼q) → (p ∨ q) is tautology.

-------------------------------------------------------------------------------------------------

Question68
Negation of the statement (p ∨ q) ⇒ (q ∨ r) is
[2021, 31 Aug. Shift-II]
Options:

A. p ∧ ∼q ∧ ∼r

B. ∼p ∧ q ∧ ∼r

C. ∼p∧ ∧ r

D. p ∧ q ∧ r

Answer: A

Solution:

Solution:
Negative of (p ∨ r) ⇒ (q ∨ r)
≡ ∼ ((p ∨ r) ⇒ (q ∨ r))
≡(p ∨ r) ∧ (∼(q ∨ r))
≡(p ∨ r) ∧ (∼q ∧ ∼r)
≡(p ∨ r) ∧ ∼r ) ∧ ∼q
≡((p ∧ ∼r)) ∨ (r ∧ ∼r) ∧ ∼q
≡(p ∧ ∼r) ∧ f ) ∧ ∼q
≡(p ∧ ∼r) ∧ (∼q)
≡p ∧ ∼q ∧ ∼r
-------------------------------------------------------------------------------------------------

Question69
The statement (p ∧ (p → q) ∧ (q → r)) → r is
[2021, 27 Aug. Shift-1]
Options:

A. a tautology

B. equivalent to p→ ∼ r

C. a fallacy

D. equivalent to → → r

Answer: A

Solution:

Solution:
Taking True = 1, False = 0

Column (7) gives true (1) in each case.

Hence, (p ∧ (p → q) ∧ (q → r)) → r is a tautology.
Question70
The Boolean expression (p ∧ q) ⇒ ((r ∧ q) ∧ p) is equivalent to
[2021,27 Aug. Shift-11]
Options:

A. (p ∧ q) ⇒ (r ∧ q)

B. (q ∧ r) ⇒ (p ∧ q)

C. (p ∧ q) ⇒ (tr ∨ q)

D. (p ∧ r) ⇒ (p ∧ q)

Answer: A

Solution:

Given, (p ∧ q) ⇒ ((r ∧ q) ∧ p)
⇔ ∼ (p ∧ q) ∨ ((r ∧ q) ∧ p)
⇔ ∼ (p ∧ q) ∨ ((r ∧ q) ∧ (p ∧ q))
⇔[∼(p ∧ q) ∨ (p ∧ q)] ∧ [∼(p ∧ q) ∨ (r ∧ q)]
⇔t ∧ [∼(p ∧ q) ∨ (r ∧ q)]
⇔ ∼ (p ∧ q) ∨ (r ∧ q)
⇔(p ∧ q) ⇒ (r ∧ q)

Question71
If the truth value of the Boolean expression
( (p ∨ q) ∧ (q → r) ∧ (∼r) → (p ∧ q) is false, then the truth values of the
statements, p, q and r respectively can be
[2021, 26 Aug. Shift-1]
Options:

A. T F T

B. FFT

C. TFF

D. FTF

Answer: C
Solution:

X = (p ∨ q) ∧ (q → r) ∧ (∼r)
Y = X → (p ∧ q)

-------------------------------------------------------------------------------------------------

Question72
Consider the two statements :
(S1) : (p → q) ∨ (∼q → p) is a tautology (S2) : (p ∧ ∼q) ∧ (∼p ∨ q) is a
fallacy Then,

[2021, 26 Aug. Shift-11]

Options:

A. only (S1) is true

B. both (S1) and (S2) are false

C. both (S1) and (S2) are true

D. only (S2) is true

Answer: C

Solution:

Solution:
S1 : (∼p ∨ q) ∨ (q ∨ p) = (q ∨ ∼p) ∨ (q ∨ p)
S1 = q ∨ (∼p ∨ p) = q ∨ ( true )
S1 = ( Always true )
S2 : (p ∧ ∼q) ∧ (∼p ∨ q)
= (p ∧ ∼q) ∧ (p ∧ ∼q) = fallacy
Question73
Which of the following is equivalent to the Boolean expression p⋀ ∽ q ?
[1 Sep 2021 Shift 2]
Options:

A. ∽ (q → p)

B. ∽p→ ∽ q

C. ∽ ( p→ ∽ q )

D. ∽ (p → q)

Answer: D

Solution:

Solution:
∽(p → q)
⇒ ∽ (∽p ⋁ q)
⇒p⋀ ∽ q

-------------------------------------------------------------------------------------------------

Question74
Let A, B, C and D be four non-empty sets. The contrapositive statement
of "If A ⊆ B and B ⊆ D, then A ⊆ C" is:
[Jan. 7, 2020 (II)]

Options:

A. If A ⊈ C, then A ⊆ B and B ⊆ D

B. If A ⊆ C, then B ⊂ A or D ⊂ B

C. If A ⊈ = C, then A ⊈ B and B ⊆ D

D. If A ⊈ C, then A ⊈ B or B ⊈ D

Answer: D

Solution:

Let P = A ⊆ B, Q = B ⊆ D, R = A ⊆ C
Contrapositive of (P ∧ Q) → R is ∧R→ ∧ (P ∧ Q)
∧R→ ∧ P ∨ ∧Q

-------------------------------------------------------------------------------------------------
Question75
Negation of the statement:
√5 is an integer of 5 is irrational is:
[Jan. 9, 2020 (I)]
Options:

A. √5 is not an integer or 5 is not irrational

B. √5 is not an integer and 5 is not irrational

C. √5 is irrational or 5 is an integer.

D. √5 is an integer and 5 is irrational

Answer: B

Solution:

Solution:
Let p and q the statements such that p = √5 is aninteger q = 5 is an irrational number.
Then, negation of the given statement
√5 is not an integer and 5 is not an irrational Number
∼(p ∨ q) = ∼ p ∧ ∼q

-------------------------------------------------------------------------------------------------

Question76
If p → (p ∧ ∼q) is false, then the truth values of p and q are respectively:
[Jan. 9, 2020 (II)]
Options:

A. F, F
B. T, F

C. T, T

D. F, T

Answer: C

Solution:
-------------------------------------------------------------------------------------------------

Question77
Which one of the following is a tautology?
[Jan. 8, 2020 (I)]
Options:

A. (p ∧ (p → q)) → q

B. q → (p ∧ (p → q))

C. p ∧ (p ∨ q)

D. p ∨ (p ∧ q)

Answer: A

Solution:
Question78
Which of the following statements is a tautology?
[Jan. 8, 2020 (II)]
Options:

A. p ∨ (∼q) → p ∧ q

B. ∼(p ∧ ∼q) → p ∨ q

C. ∼(p ∨ ∼q) → p ∧ q

D. ∼(p ∨ ∼q) → p ∨ q

Answer: D

Solution:

Solution:
(∼p ∧ q) → (p ∨ q)
⇒ ∼ {(∼p ∧ q) ∧ (∼p ∧ ∼q)}
⇒ ∼ {∼p ∧ f }

-------------------------------------------------------------------------------------------------

Question79
The logical statement (p ⇒ q) ∧ (q⇒ ∼ p) is equivalent to:
[Jan. 7, 2020 (I)]
Options:

A. p

B. q

C. ~p

D. ~q

Answer: C
Solution:

Clearly (p ⇒ q) ∧ (q⇒ ∼ p) is equivalent to ∼p

-------------------------------------------------------------------------------------------------

Question80
The negation of the Boolean expression p ∨ (∼p ∧ q) is equivalent to :
[Sep. 06, 2020 (I)]
Options:

A. p ∧ ∼q

B. ∼p ∧ ∼q

C. ∼p ∨ ∼q

D. ∼p ∨ q

Answer: B

Solution:

Solution:
Negation of given statement = ∼ (p ∨ (∼p ∧ q))
= ∼ p ∧ ∼(∼p ∧ q) = ∼ p ∧ (p ∨ ∼q)
= (∼p ∧ q) ∨ (∼p ∧ ∼q)
= F ∨ (∼p ∧ ∼q) = ∼ p ∧ ∼q

-------------------------------------------------------------------------------------------------

Question81
The negation of the Boolean expression x↔ ∼ y is equivalent to:
[Sep. 05, 2020 (I)]
Options:

A. (x ∧ y) ∨ (∼x ∧ ∼y)

B. (x ∧ y) ∧ (∼x ∨ ∼y)

C. (x ∧ ∼y) ∨ (∼x ∧ y)
D. (∼x ∧ y) ∨ (∼x ∧ ∼y)

Answer: A

Solution:

Solution:
p : x↔ ∼ y = (x→ ∼ y)∧ (∼y → x)
= (∼x ∨ ∼y) ∧ (y ∨ x)
= ∼ (x ∧ y) ∧ (x ∨ y) ( ∵∼(x ∧ y) = ∼ x ∨ ∼y )
Negation of p is
∼p = (x ∧ y) ∨ ∼(x ∨ y) = (x ∧ y) ∨ (∼x ∧ ∼y)

-------------------------------------------------------------------------------------------------

Question82
Given the following two statements:
(S1) : (q ∨ p) → (p↔ ∼ q) is a tautology.
(S2) : ∼q ∧ (∼p ↔ q) is a fallacy. Then :
[Sep. 04, 2020 (I)]

Options:

A. both (S1) and (S2) are correct

B. only (S1) is correct

C. only (S2) is correct

D. both (S1) and (S2) are not correct

Answer: D

Solution:

Solution:
The truth table of both the statements is
∴S1 is not tautology and S2 is not fallacy.
Hence, both the statements (S1) and (S2) are not correct.

-------------------------------------------------------------------------------------------------

Question83
The proposition p→ ∼ (p ∧ ∼q) is equivalent to :
[Sep. 03, 2020 (I)]
Options:

A. q

B. (∼p) ∨ q

C. (∼p) ∧ q

D. (∼p) ∨ (∼q)

Answer: B

Solution:

Solution:

∴p→ ∼ (p ∧ ∼q) is equivalent to ∼p ∨ q

-------------------------------------------------------------------------------------------------

Question84
Let p, q, r be three statements such that the truth value of
(p ∧ q) → (∼q ∨ r) is F . Then the truth values of p, q, r are respectively:
[Sep. 03, 2020 (II)]
Options:

A. T, F, T

B. T, T, T

C. F, T, F

D. T, T, F

Answer: D
Solution:

Solution:
(p ∧ q) → (∼q ∨ r)
= ∼ (p ∧ q) ∨ (∼q ∨ r)
= (∼p ∨ ∼q) ∨ (∼q ∨ r)
= (∼p ∨ ∼q ∨ r)
∵ (∼p ∨ ∼q ∨ r) is false, then ∼p, ∼q and r all these must be false.
⇒p is true, q is true and r is false.

-------------------------------------------------------------------------------------------------

Question85
Consider the statement: “For an integer n, if n3 − 1 is even, then n is
odd.” The contrapositive statement of this statement is:
[Sep. 06, 2020 (II)]
Options:

A. For an integer n, if n is even, then n3 − 1 is odd.

B. For an intetger n, if n3 − 1 is not even, then n is not odd.

C. For an integer n, if n is even, then n3 − 1 is even.

D. For an integer n, if n is odd, then n3 − 1 is even.

Answer: A

Solution:

Solution:
Contrapositive statement will be "For an integer n, if n is not odd then n3 − 1 is not even".
Or
"For an integer n, if n is even then n3 − 1 is odd".

-------------------------------------------------------------------------------------------------

Question86
The statement (p → (q → p)) → (p → (p ∨ q)) is :
[Sep. 05,2020 (II)]
Options:

A. equivalent to (p ∧ q) ∨ (∼q)

B. a contradiction

C. equivalent to (p ∨ q) ∧ (∼p)

D. a tautology

Answer: D

Solution:
Solution:
The truth table of (p → (q → p)) → (p → (p ∨ q)) is

Hence, the statement is tautology.

-------------------------------------------------------------------------------------------------

Question87
Contrapositive of the statement :
'If a function f is differentiable at a, then it is also continuous at a', is :
[Sep. 04, 2020 (II)]
Options:

A. If a function f is continuous at a, then it is not differentiable at a.

B. If a function f is not continuous at a, then it is not differentiable at a.

C. If a function f is not continuous at a, then it is differentiable at a

D. If a function f is continuous at a, then it is differentiable at a

Answer: B

Solution:

Solution:
Contrapositive statement will be "If a function is not continuous at 'a', then it is not differentiable at 'a'.

-------------------------------------------------------------------------------------------------

Question88
The contrapositive of the statement "If I reach the station in time, then
I will catch the train" is :
[Sep. 02, 2020 (I)]
Options:

A. If I do not reach the station in time, then I will catch the train.
B. If I do not reach the station in time, then I will not catch the train.

C. If I will catch the train, then I reach the station in time.

D. If I will not catch the train, then I do not reach the station in time.

Answer: D

Solution:

Solution:
Contrapositive of p→q is ∼q→∼p
i.e. contrapositive of 'if p then q' is 'if not q then not p'.

-------------------------------------------------------------------------------------------------

Question89
The Boolean expression((p ∧ q) ∨ (p ∨ ∼q)) ∧ (∼p ∧ ∼q) is equivalent to
:
[Jan. 12, 2019 (I)]
Options:

A. p ∧ q

B. p ∧ (∼q)

C. (∼p) ∧ (∼q)

D. p ∨ (∼q)

Answer: C

Solution:

Solution:
Consider the Boolean expression
((p ∧ q) ∨ (pv ∼ q)) ∧ (∼p ∧ ∼q)
= (p ∨ ∼q) ∧ (∼p ∧ ∼q)
= ((p ∨ ∼q) ∧ ∼p) ∧ ((p ∨ ∼q) ∧ ∼q)
= ((p ∧ ∼p) ∨ (∼q ∧ ∼p)) ∧ ∼q
= (∼p ∧ ∼q) ∧ ∼q = (∼p ∧ ∼q)

-------------------------------------------------------------------------------------------------

Question90
The expression ∼(∼p → q) is logically equivalent to:
[Jan. 12,2019 (II)]
Options:

A. ∼p ∧ ∼q

B. p ∧ ∼q

C. ∼p ∧ q
D. p ∧ q

Answer: A

Solution:

Solution:
∼(∼p → Q)≡ ∼ (p ∨ q) ≡ ∼ p ∧ ∼q

-------------------------------------------------------------------------------------------------

Question91
If q is false and p ∧ q ↔ r is true, then which one of the following
statements is a tautology?
[Jan. 11, 2019 (I)]
Options:

A. (p ∨ r) → (p ∧ r)

B. (p ∧ r) → (p ∨ r)

C. p ∧ r

D. p ∨ r

Answer: B

Solution:

Solution:
q is false and [(p ∧ q) ↔ r] is true
As (p ∧ q) is false
[False ↔r ] is true
Hence r is false
Option (a): says p ∨ r,
Since r is false
Hence (p ∨ r) can either be true or false
Option (b): says (p ∧ r) → (p ∨ r)
(p ∧ r) is false
Since, F → T is true and
F → F is also true
Hence, it is a tautology
Option (c): (p ∨ r) → (p ∧ r)
i.e. (p ∨ r) → F
It can either be true or false
Option (d): (p ∧ r),
Since, r is false
Hence, (p ∧ r) is false.

-------------------------------------------------------------------------------------------------

Question92
Consider the following three statements:
P : 5 is a prime number.
Q : 7 is a factor of 192.
R : L.C.M. of 5 and 7 is 35 .
Then the truth value of which one of the following statements is true?
[Jan. 10, 2019 (II)]
Options:

A. (∼P) ∨ (Q ∧ R)

B. (P ∧ Q) ∨ (∼R)

C. (∼P) ∧ (∼Q ∧ R)

D. P ∨ (∼Q ∧ R)

Answer: D

Solution:

Solution:
(d) P is True, Q is False and R is True
(a) (∼P) ∨ (Q ∧ R) ≡ F ∨ (F ∧ T ) ≡F ∨ F = F
(b) (P ∧ Q) ∨ (∼R) ≡ (T ∧ F ) ∨ (F ) ≡F ∨ F = F
(c) (∼P) ∧ (∼Q ∧ R) ≡ F ∧ (T ∧ T ) ≡F ∧ T = F
(d) P ∨ (∼Q ∧ R) ≡ T ∨ (T ∧ T ) ≡T ∨ T = T

-------------------------------------------------------------------------------------------------

Question93
If the Boolean expression (p ⊕ q) ∧ (∼p ◉ q) is equivalent to p ∧ q,
where ⊕, ◉ ∈ {∧, ∨} then the ordered pair (⊕, ◉) is:
[Jan. 09, 2019 (I)]
Options:

A. (∨, ∧)

B. (∨, ∨)

C. (∧, ∨)

D. (∧, ∧)

Answer: C

Solution:

Solution:
Check each option
(a) (p ∨ q) ∧ (∼p ∧ q) = (∼p ∧ q)
(b) (p ∨ q) ∧ (∼p ∨ q) = q
(c) (p ∧ q) ∧ (∼p ∨ q) = p ∧ q
(d) (p ∧ q) ∧ (∼p ∧ q) = F

-------------------------------------------------------------------------------------------------

Question94
The logical statement [∼(∼p ∨ q) ∨ (p ∧ r)] ∧ (∼p ∧ r) is equivalent to:
[Jan. 09, 2019 (II)]
Options:

A. (∼p ∧ ∼q) ∧ r

B. ∼p ∨ r

C. (p ∧ r) ∧ ∼q

D. (p ∧ ∼q) ∨ r

Answer: C

Solution:

Solution:
Logical statement,
= [∼(∼p ∨ q) ∨ (p ∧ r)] ∧ (∼q ∧ r)
= [(p ∧ ∼q) ∨ (p ∧ r)] ∧ (∼q ∧ r)
= [(p ∧ ∼q) ∧ (∼q ∧ r)] ∨ [ (p ∧ r) ∧(∼q ∧ r) ]
= [p ∧ ∼q ∧ r] ∨ [p ∧ r ∧ ∼q]
= (p ∧ ∼q) ∧ r
= (p ∧ r) ∧ ∼q

-------------------------------------------------------------------------------------------------

Question95
Contrapositive of the statement “If two numbers are not equal, then
their squares are not equal”. is :
[Jan. 11, 2019 (II)]
Options:

A. If the squares of two numbers are not equal, then the numbers are equal.

B. If the squares of two numbers are equal, then the numbers are not equal .

C. If the squares of two numbers are equal, then the numbers are equal.

D. If the squares of two numbers are not equal, then the numbers are not equal.

Answer: C

Solution:

Solution:
Contrapositive of “If A then B” is “If ~B then ~A”. Hence contrapositive of “If two numbers are not equal, then their
squares are not equal” is “If squares of two numbers are equal, then the two numbers are equal”.

-------------------------------------------------------------------------------------------------

Question96
If the truth value of the statement p → (~q ∨ r) is false (F), then the
truth values of the statements p, q, r arerespectively.
[April 12, 2019 (I)]
Options:

A. T, T, F

B. T, F, F

C. T, F, T

D. F, T, T

Answer: A

Solution:

Solution:
Given statement p → (~q ∨ r) is False.
⇒p is True and ~q ∨ r is False
⇒p is True and ~q is False and r is False
∴ truth values of p, q, r are T , T , F respectively.

-------------------------------------------------------------------------------------------------

Question97
The Boolean expression ∼(p ⇒ (∼q)) is equivalent to:
[April 12, 2019 (II)]
Options:

A. p ∧ q

B. q⇒ ∼ p

C. p ∨ q

D. (∼p) ⇒ q

Answer: A

Solution:

Solution:
Given Boolean expression is,
∼(p ⇒ (∼q)) { ∵p ⇒ q is same as ∼ p ∨ q }
≡ ∼ ((∼p) ∨ (∼q)) ≡ p ∧ q

-------------------------------------------------------------------------------------------------

Question98
Which one of the following Boolean expressions is a tautology ?
[April 10, 2019 (I)]
Options:

A. (p ∧ q) ∨ (p ∧ ∼q)

B. (p ∨ q) ∨ (p ∨ ∼q)
C. (p ∨ q) ∧ (p ∨ ∼q)

D. (p ∨ q) ∧ (∼p ∨ ∼q)

Answer: B

Solution:

Solution:
(p ∨ q) ∨ (p ∨ ∼q) = p ∨ (q ∨ p) ∨ ∼q
= (p ∨ p) ∨ (q ∨ ∼q) = p ∨ T = T
Hence first statement is tautology.

-------------------------------------------------------------------------------------------------

Question99
If p ⇒ (q ∨ r) is false, then the truth values of p, q, r are respectively:
[April 09, 2019 (II)]
Options:

A. F, T, T

B. T, F, F

C. T, T, F

D. F, F, F

Answer: B

Solution:

Solution:
For p ⇒ q ∨ r to be F.
r should be F and p ⇒ q should be F
for p ⇒ q to be F , p ⇒ T and q ⇒ F
p, q, r ≡ T , F , F

-------------------------------------------------------------------------------------------------

Question100
Which one of the following statements is not a tautology?
[April 08, 2019(II)]
Options:

A. (p ∨ q) → (p ∨ (∼q))

B. (p ∧ q) → (∼p) ∨ q

C. p → (p ∨ q)

D. (p ∧ q) → p

Answer: A
Solution:

Solution:
By truth table :

-------------------------------------------------------------------------------------------------

Question101
The negation of the Boolean expression ∼s ∨ (∼r ∧ s) is equivalent to :
[April 10, 2019 (II)]
Options:

A. ∼s ∧ ∼r

B. r

C. s ∨ r

D. s ∧ r

Answer: D

Solution:

Solution:
∼s ∨ (∼r ∧ s) ≡ (∼s ∨ ∼r) ∧ (∼s ∨ s)
≡(∼s ∨ ∼r) ( ∵ ∼s ∨ s) is tautology)
≡ ∼ (s ∧ r)
Hence, its negation is s ∧ r.

-------------------------------------------------------------------------------------------------

Question102
For any two statements p and q, the negation of the expression
p ∨ (∼p ∧ q) is:
[April 9, 2019 (I)]
Options:

A. ∼p ∧ ∼q

B. p ∧ q

C. p ↔ q
D. ∼p ∨ ∼q

Answer: D

Solution:

Solution:
∼(p ∨ (∼p ∧ q)) = ∼ (∼p ∧ q) ∧ ∼p
= (∼q ∨ p) ∧ ∼p
= ∼ p ∧ (p ∨ ∼q)
= (∼q ∧ ∼p) ∨ (p ∧ ∼p)
= (∼p ∧ ∼q)

-------------------------------------------------------------------------------------------------

Question103
The contrapositive of the statement "If you are born in India, then you
are a citizen of India", is :
[April 8, 2019 (I)]
Options:

A. If you are not a citizen of India, then you are not born in India.

B. If you are a citizen of India, then you are born in India.

C. If you are born in India, then you are not a citizen of India.

D. If you are not born in India, then you are not a citizen of India.

Answer: A

Solution:

Solution:
S: ‘’If you are born in India, then you are a citizen of India.’’
Contrapositive of p → q is ~ q → ~ p
So contrapositive of statement S will be :
‘’If you are not a citi​en of India, then you are not born in India.’’

-------------------------------------------------------------------------------------------------

Question104
If p → (∼p ∨ ∼q) is false, then the truth values of p and q are
respectively.
[Online April 16, 2018]
Options:

A. T, F

B. F, F

C. F, T

D. T,T
Answer: D

Solution:

Solution:

From the truth table,

p → (∼p ∨ ∼q) is false only when p and q both are true.

-------------------------------------------------------------------------------------------------

Question105
The Boolean expression∼(p ∨ q) ∨ (∼p ∧ q) is equivalent to
[2018]
Options:

A. p

B. q

C. ∼q

D. ∼p

Answer: D

Solution:

Solution:
∼(p ∨ q) ∨ (∼p ∧ q)
⇒(∼p ∧ ∼q) ∨ (∼p ∧ q)
⇒ ∼ p ∧ (∼q ∨ q)
⇒ ∼ p ∧ t≡ ∼ p

-------------------------------------------------------------------------------------------------

Question106
If (p ∧ ∼q) ∧ (p ∧ r)→ ∼ p ∨ q is false, then the truth values of p, q and r
are respectively
[Online April 15, 2018]
Options:

A. F, T, F
B. T, F, T

C. F, F, F

D. T, T, T

Answer: B

Solution:

Solution:
As the truth table for the (p ∧ ∼q) ∧ (p ∧ r)→ ∼ p ∨ q is false, then only possible values of (p, q, r) is (T, F, T)

-------------------------------------------------------------------------------------------------

Question107
Consider the following two statements.
Statement p:
The value of sin 120° can be divided by taking θ = 240° in the equation
2 sin 2θ = √1 + sin θ − √1 − sin θ .
Statement q: The angles A, B, C and D ofany quadrilateral ABCD satisfy
the equation cos ( 1
2
(A + C) ) + cos ( 1
2
(B + D) ) =0
Then the truth values of p and q are respectively.
[Online April 15, 2018]
Options:

A. F, T

B. T, T
C. F, F

D. T, F

Answer: A

Solution:

Solution:
Statement p:
√3
sin 120° = cos 30° = ⇒ 2 sin 120° = √3
2
So, √1 + sin 240° − √1 − sin 240°

= √1 − √3
2
−
1 + √3
2 √
≠√3
Statement q:
A+C B+D
So, A + B + C + D = 2π ⇒ + =π
2 2
⇒cos (
A+C
2 )
+ cos
B+D
2 ( )
= cos
A+C
2 ( − cos )A+C
2
=0 ( )
Therefore, statement p is false and statement q is true.

-------------------------------------------------------------------------------------------------

Question108
Which of the following is a tautology?
[2017]
Options:

A. (∼p) ∧ (p ∨ q) → q

B. (q → p) ∨ ∼(p → q)

C. (∼q) ∨ (p ∧ q) → q

D. (p → q) ∧ (q → p)

Answer: A

Solution:

Solution:
Truth table

∴(a) ∼ p ∧ (p ∨ q) → q be a tautology
Other options are not tautology.
-------------------------------------------------------------------------------------------------

Question109
The following statement (p → q) → [(∼p → q) → q] is
[2017]
Options:

A. a fallacy

B. a tautology

C. equivalent to ~p → q

D. equivalent to p→ ∼ q

Answer: B

Solution:

Solution:
We have

∴ It is tautology

-------------------------------------------------------------------------------------------------

Question110
The proposition (∼p) ∨ (p ∧ ∼q)
[Online April 8, 2017]
Options:

A. p→ ∼ q

B. p ∧ (∼q)

C. q → p
D. p ∨ (∼q)

Answer: B

Solution:

Solution:
(∼p) ∨ (p ∧ ∼q)

-------------------------------------------------------------------------------------------------

Question111
Contrapositive of the statement
‘If two numbers are not equal, then their squares are not equal’, is :
[Online April 9, 2017]
Options:

A. If the squares of two numbers are equal, then the numbers are equal.

B. If the squares of two numbers are equal, then the numbers are not equal.

C. If the squares of two numbers are not equal, then the numbers are not equal.

D. If the squares of two numbers are not equal, then the numbers are equal.

Answer: A

Solution:

Solution:
p→q
then ~ q → ~ p
∴ If the square of two numbers are equal, then the numbers are equal.

-------------------------------------------------------------------------------------------------

Question112
The Boolean Expression (p ∧ ∼q) ∨ q ∨ (∼p ∧ q) is equivalent to:
[2016]
Options:

A. p ∨ q
B. p ∨ ∼q

C. ∼p ∧ q

D. p ∧ q

Answer: A

Solution:

Solution:
(p ∧ ∼q) ∨ q ∨ (∼p ∧ q)
⇒{(p ∨ q) ∧ (∼q ∨ q)} ∨ (∼p ∧ q)
⇒{(p ∨ q) ∧ T } ∨ (∼p ∧ q)
⇒(p ∨ q) ∨ (∼p ∧ q)
⇒{(p ∨ q) ∨ ∼p} ∧ (p ∨ q ∨ q)
⇒T ∧ (p ∨ q)
⇒p ∨ q

-------------------------------------------------------------------------------------------------

Question113
The contrapositive of the following statement, "If the side of a square
doubles, then its area increases four times", is :
[Online April 10, 2016]
Options:

A. If the area of a square increases four times, then its side is not doubled.

B. If the area of a square increases four times, then its side is doubled.

C. If the area of a square does not increases four times, then its side is not doubled.

D. If the side of a square is not doubled, then its area does not increase four times.

Answer: C

Solution:

Solution:
Contrapositive of p → q is given by ~ q → ~ p
So (c) is the right option.

-------------------------------------------------------------------------------------------------

Question114
Consider the following two statements:
P: If 7 is an odd number, then 7 is divisible by 2 .
Q: If 7 is a prime number, then 7 is an odd number.
If V 1 is the truth value of the contrapositive of P and V 2 is the truth
value of contrapositive of Q, then the ordered pair (V 1, V 2) equals:
[Online April 9, 2016]
Options:
A. (F , F )

B. (F , T )

C. (T , F )

D. (T , T )

Answer: A

Solution:

Solution:
Contrapositive of P :
T is not divisible by 2 ⇒ T is not odd number
T ⇒ F : F (V 1)
Contra positive Q :
T is not odd number ⇒ T is not a prime number
F ⇒ F : T (V 2)

-------------------------------------------------------------------------------------------------

Question115
The negation of ∼s ∨ (∼r ∧ s) is equivalent to :
[2015]
Options:

A. s ∨ (r ∨ ∼s)

B. s ∧ r

C. S ∧ ∼r

D. S ∧ (r ∧ ∼s)

Answer: B

Solution:

Solution:
∼[∼S ∨ (∼r ∧ s)]
= s ∧ ∼(∼r ∧ s)
= s ∧ (r ∨ ∼s)
= (s ∧ r) ∨ (s ∧ ∼s)
= (s ∧ r) ∨ f
=s∧r

-------------------------------------------------------------------------------------------------

Question116
Consider the following statements :
P: Suman is brilliant
Q: Suman is rich.
R: Suman is honest
the negation of the statement
"Suman is brilliant and dishonest if and only if suman is rich" can be
equivalently expressed as :
[Online April 11, 2015]
Options:

A. ∼Q↔ ∼ P ∨ R

B. ∼Q↔ ∼ P ∧ R

C. ∼Q ↔ P ∨ ∼R

D. ∼Q ↔ P ∧ ∼R

Answer: D

Solution:

Solution:
Suman is brilliant and dishonest can be expressed asP ∧ ∼R
therefore given statement is equal to (P ∧ ∼R) ↔ Q
Negation of the above statement is ∼Q ↔ P ∧ ∼R

-------------------------------------------------------------------------------------------------

Question117
The contrapositive of the statement “If it is raining, then I will not
come”, is :
[Online April 10, 2015]
Options:

A. If I will not come, then it is raining.

B. If I will not come, then it is not raining.

C. If I will come, then it is raining.

D. If I will come, then it is not raining.

Answer: D

Solution:

Solution:
The centre positive of the statement is “If i will come, then it is not raining”.

-------------------------------------------------------------------------------------------------

Question118
The statement ∼(p↔ ∼ q) is:
[2014]
Options:
A. a tautology

B. a fallacy

C. eqivalent to p ↔ q

D. equivalent to ∼p ↔ q

Answer: C

Solution:

Solution:

From column (i) and (ii) are equivalent.

Clearly equivalent to p↔q

-------------------------------------------------------------------------------------------------

Question119
Let p, q, r denote arbitrary statements. Then the logically equivalent of
the statement p ⇒ (q ∨ r) is:
[Online April 12, 2014]
Options:

A. (p ∨ q) ⇒ r

B. (p ⇒ q) ∨ (p ⇒ r)

C. (p⇒ ∼ q) ∧ (p ⇒ r)

D. (p ⇒ q) ∧ (p⇒ ∼ r)

Answer: B

Solution:

Solution:
Given statement is
p ⇒ (q ∨ r) which is equivalent to
(p ⇒ q) ∨ (p ⇒ r)

-------------------------------------------------------------------------------------------------

Question120
The proposition ∼(p ∨ ∼q) ∨ ∼(p ∨ q) is logically equivalent to:
[Online April 11, 2014]
Options:

A. p

B. q

C. ∼p

D. ∼q

Answer: C

Solution:

Solution:
Given ∼(p ∨ ∼q) ∨ ∼(p ∨ q)
≡(∼p ∨ q) ∨ (∼p ∨ ∼q)
≡ ∼ p ∨ (q ∨ ∼q)
≡∼p

-------------------------------------------------------------------------------------------------

Question121
The contrapositive of the statement “if I am not feeling well, then I will
go to the doctor” is
[Online April 19, 2014]
Options:

A. If I am feeling well, then I will not go to the doctor

B. If I will go to the doctor, then I am feeling well

C. If I will not go to the doctor, then I am feeling well

D. If I will go to the doctor, then I am not feeling well.

Answer: C

Solution:

Solution:
Given statement can be written in implication form as
I am not feeling well ⇒ I will go to the doctor.
Contrapositive form :
I will not go to the doctor ⇒ I am feeling well.
i.e. If I will not go to the doctor, then I am feeling well.

-------------------------------------------------------------------------------------------------

Question122
The contrapositive of the statement “I go to school if it does not rain” is
[Online April 9, 2014]
Options:

A. If it rains, I do not go to school.

B. If I do not go to school, it rains.

C. If it rains, I go to school.

D. If I go to school, it rains.

Answer: B

Solution:

Solution:
let p = If it does not rain
q = I go to school
According to law of contrapositive
p ⇒ q≡ ∼ q⇒ ∼ p
i.e. ∼q = I do not go to school
∼p = It rains
∼q⇒ ∼ p is If I do not go to school, it rains.

-------------------------------------------------------------------------------------------------

Question123
Consider
Statement-1 : (p ∧ ∼q) ∧ (∼p ∧ q) is a fallacy.
Statement- 2: (p → q) ↔ (∼q→ ∼ p) is a tautology.
[2013]
Options:

A. Statement-1 is true; Statement-2 is true;

Statement-2 is a correct explanation for Statement-1.

B. Statement-1 is true; Statement-2 is true; Statement-2 is not a correct explanation for

Statement-1.

C. Statement-1 is true; Statement-2 is false.

D. Statement-1 is false; Statement-2 is true.

Answer: B

Solution:

Solution:
Statement-2 : (p → q) ↔ (∼q→ ∼ p)
≡(p → q) ↔ (p → q)
which is always true.
So, statement 2 is true
Statement-1: (p ∧ ∼q) ∧ (∼p ∧ q)
= p ∧ ∼q ∧ ∼p ∧ q
= p ∧ ∼p ∧ ∼q ∧ q
=f ∧f =f
So statement- 1 is true

-------------------------------------------------------------------------------------------------
Question124
Let p and q be any two logical statements andr : p → (∼p ∨ q). If r has a
truth value F , then the truth values of p and q are respectively:
[Online April 25, 2013]
Options:

A. F, F

B. T, T

C. T, F

D. F, T

Answer: C

Solution:

Solution:
p → (∼p ∨ q) has truth value F .
It means p → (∼p ∨ q) is false.
It means p is true and ∼p ∨ q is false.
⇒p is true and both ∼p and q are false.
⇒p is true and q is false.

-------------------------------------------------------------------------------------------------

Question125
For integers m and n, both greater than 1, consider the following three
statements:
P : m divides n
Q : m divides n2
R : m is prime,
then
[Online April 23, 2013]
Options:

A. Q ∧ R → P

B. P ∧ Q → R

C. Q → R

D. Q → P

Answer: A

Solution:

Solution:
8 64
(b) = 2, = 16; but 4 is not prime.
4 4
Hence P ∧ Q → R, false
 (6)2 36
(c) = = 3; but 12 is not prime
12 12
Hence Q → R, false
(4)2 16 4
(d) = = 2; is not an integer
8 8 8
Hence Q → P, false

-------------------------------------------------------------------------------------------------

Question126
The statement p → (q → p) is equivalent to :
[Online April 22, 2013]
Options:

A. p → q

B. p → (p ∨ q)

C. p → (p → q)

D. p → (p ∧ q)

Answer: B

Solution:

Solution:

Since truth value of p → (q → p) and p → (p ∨ q) are same, hence p → (q → p) is equivalent to p → (p ∨ q)

-------------------------------------------------------------------------------------------------

Question127
Statement-1: The statement A → (B → A) is equivalent to A → (A ∨ B).
Statement-2: The statement ∼[(A ∧ B) → (∼A ∨ B)] is a Tautology.
[Online April 9, 2013]
Options:

A. Statement-1 is false; Statement-2 is true.

B. Statement-1 is true; Statement-2 is true; Statement- 2 is not correct explanation for

Statement-1.

C. Statement-1 is true; Statement-2 is false.

D. Statement-1 is true; Statement-2 is true; Statement- 2 is the correct explanation for
Statement-1.

Answer: C

Solution:

-------------------------------------------------------------------------------------------------

Question128
Let p and q be two Statements. Amongst the following, the Statement
that is equivalent to p → q is
[Online May 19, 2012]
Options:

A. p ∧ ∼q

B. ∼p ∨ q

C. ∼p ∧ q

D. p ∨ ∼q

Answer: B

Solution:

Solution:
Let p and q be two statements.
p → q is equivalent to ∼p ∨ q

-------------------------------------------------------------------------------------------------

Question129
The logically equivalent preposition of p ⇔ q is
[Online May 12, 2012]
Options:

A. (p ⇒ q) ∧ (q ⇒ p)

B. p ∧ q

C. (p ∧ q) ∨ (q ⇒ p)

D. (p ∧ q) ⇒ (q ∨ p)

Answer: A

Solution:

Solution:
(p ⇒ q) ∧ (q ⇒ p) means p⇔q

-------------------------------------------------------------------------------------------------

Question130
The negation of the statement
"If I become a teacher, then I will open a school", is :
[2012]
Options:

A. I will become a teacher and I will not open a school.

B. Either I will not become a teacher or I will not open a school.

C. Neither I will become a teacher nor I will open a school.

D. I will not become a teacher or I will open a school.

Answer: A

Solution:

Solution:
Let p: I become a teacher.
q: I will open a school
Negation of p → q is ∼(p → q) = p ∧ ∼q
i.e. I will become a teacher and I will not open a school.

-------------------------------------------------------------------------------------------------

Question131
Let p and q denote the following statements
p : The sun is shining
q: I shall play tennis in the afternoon
The negation of the statement “If the sun is shining then I shall play
tennis in the afternoon”, is
[Online May 26, 2012]
Options:

A. q⇒ ∼ p

B. q ∧ ∼p

C. p ∧ ∼q

D. ∼q⇒ ∼ p

Answer: C

Solution:

Solution:
Let p : The sun is shining.
q : I shall play tennis in the afternoon.
Negation of p → q is ∼(p → q) = p ∧ ∼q

-------------------------------------------------------------------------------------------------

Question132
The Statement that is TRUE among the following is
[Online May 7,2012 ]
Options:

A. The contrapositive of 3x + 2 = 8 ⇒ x = 2 is x ≠ 2 ⇒3x + 2 ≠ 8

B. The converse of tan x = 0 ⇒ x = 0 is x ≠ 0 ⇒ tan x = 0.

C. p ⇒ q is equivalent to p ∨ ∼q.

D. p ∨ q and p ∧ q have the same truth table.

Answer: A

Solution:

Solution:
Only statement given in option
(a) is true.
(b) The converse of tanx = 0 ⇒ x = 0 is
x = 0 ⇒ tan x = 0
∴ Statement (b) is false
(c) ∼( p ⇒ q ) is equivalent to p∧∼q
∴ Statement given in option (c) is false.
(d) No, p∨q and p∧q does not have the same truthvalue.

-------------------------------------------------------------------------------------------------

Question133
The only statement among the following that is a tautology is
[2011 RS]
Options:

A. A ∧ (A ∨ B)

B. A ∨ (A ∧ B)

C. [A ∧ (A → B)] → B

D. B → [A ∧ (A → B)]

Answer: C

Solution:

Solution:
Truth table of all options is as follows.

∴ It is tautology

-------------------------------------------------------------------------------------------------

Question134
Let S be a non-empty subset of R. Consider the following statement:
P: There is a rational number x ∈ S such that x > 0.
Which of the following statements is the negation of the statement P?
[2010]
Options:

A. There is no rational number x ∈ S such than x ≤ 0.

B. Every rational number x ∈ S satisfies x ≤ 0.

C. x ∈ S and x ≤ 0 ⇒ x is not rational.

D. There is a rational number x ∈ S such that x ≤ 0.

Answer: B

Solution:

Solution:
Given that P: there is a rational number x ∈ S such that x > 0.
∼P: Every rational number x ∈ S satisfies x ≤ 0.

-------------------------------------------------------------------------------------------------
Question135
Statement-1: ∼(p↔ ∼ q) is equivalent to p ↔ q.
Statement- 2: ∼(p↔ ∼ q) is a tantology
[2009]
Options:

A. Statement-1 is true, Statement-2 is true;

Statement-2 is not a correct explanation for Statement-1.

B. Statement-1 is true, Statement-2 is false.

C. Statement-1 is false, Statement-2 is true.

D. Statement-1 is true, Statement-2 is true,

Statement-2 is a correct explanation for statement -1

Answer: B

Solution:

Solution:
The truth table for the logical statements, involved in statement 1, is as follows :

We observe the columns (i) and (ii) are identical, therefore ∼(p↔ ∼ q) is equivalent to p ↔ q
But ∼(p↔ ∼ q) is not a tautology as all entries in its column are not T .
∴ Statement- 1 is true but statement- 2 is false.

-------------------------------------------------------------------------------------------------

Question136
The statement p → (q → p) is equivalent to
[2008]
Options:

A. p → (p → q)

B. p → (p ∨ q)

C. p → (p ∧ q)

D. p → (p ↔ q)

Answer: B

Solution:
Solution:
The truth table for the given statements, as follows :

From table we observe that

p → (q → p) is equivalent to p → (p ∨ q)

-------------------------------------------------------------------------------------------------

Question137
Let p be the statement “x is an irrational number”, q be the statement
“y is a transcendental number”, and r be the statement “ x is a rational
number iff y is a transcendental number”.
Statement-1 : r is equivalent to either q or p
Statement-2 : r is equivalent to ∼(p↔ ∼ q).
[2008]
Options:

A. Statement -1 is false, Statement-2 is true

B. Statement -1 is true, Statement-2 is true; Statement -2 is a correct explanation for

Statement-1

C. Statement -1 is true, Statement-2 is true; Statement -2 is not a correct explanation for

Statement-1

D. None

Answer: D

Solution:

Solution:
Given that
p : x is an irrational number
q : y is a transcendental number
r : x is a rational number iff y is a transcendental number.
clearly r : ∼p ↔ q
Truth table to check the equivalence of ' r ' and ' q or p '; ' r and ∼(p↔ ∼ q)
From columns (i), (ii) and (iii), we observe, that none of the these statements are equivalent to each other.
∴ Statement 1as well as statement 2 both are false.
∴ None of the options is correct.

-------------------------------------------------------------------------------------------------