INFINITY SCIENCE CLASSES
[COMPILED BY GALA SIR]
Homework[ MODEL ANSWER ]
Subject: Mathematics &
Std: Mathematics (12th)
Statistics
Date : 15-05-2025 MATRICES, LOGIC
Q.1 Select and write the most appropriate answers from given alternatives:
1) Ans. B)
2) Ans. A)
3) Ans. C)
4) Ans. A)
5) Ans. B)
6) Ans. B)
Page 1 of 31
7) Ans. B)
8) Ans. D)
9) Ans. B)
10) Ans. C)
11) Ans. (d)
~ [p Λ (q → r)]
≡ ~ p ѵ ~ (q → r)
≡ p → [~ (q → r)] …..[∵ p → q ≡ ~ p ѵ q]
≡ p → [~ (~ q ѵ r)]
≡ p → (q Λ ~ r)
12) Ans. (c)
~[(p ѵ ~ q) Λ r]
≡ ~ (p ѵ ~ q) ѵ ~ r ….[De Morgan’s law]
≡ ~ (p Λ ~ q) ѵ ~ r …[De Morgan’s law]
13) Ans. (b) c Λ (p Λ q)
14) Ans. (A)
15) Ans. (B)
Page 2 of 31
Q.2 Solve the following:
1) Ans.
2) Ans.
3) Ans. Let p : Mumbai is in Maharashtra
q : Delhi is capital of India
Truth values of p and q are T and T respectively.
The given statement in symbolic form is p → q
∴ p → q ≡ T → T is T
∴ Truth value of given statement is T
4) Ans. Let p : 3 is a prime number
q : 4 is a rational number.
Truth values of p and q are T and T respectively. The given statement in symbolic form is p Λ q.
The truth value of given statement is T.
5) Ans. There is no x in A which satisfies x + 8 = 16.
∴ The given statement is false.
∴ Its truth value is F.
6) Ans. For each x ∈ A 8 – x ≤ 7
∴ The given statement is true.
∴ Its truth value is T.
7) Ans. ~ [(p ∨ ~ q) ∧ r ]
≡ ~ (p ∨ ~ q) ∨(~ r) (Negation of conjunction)
≡~ p∧ ~(~ q) ∨(~ r) (Negation of disjunction)
≡(~ p ∧ q) ∨(~ r) (Negation of negation)
8) Ans. p→ (p∨ ~ q)
~[ p→ (p∨ ~ q)]
≡ ~ p ∧ [~ (p ∨ ~ q)] [Negation of implication]
≡ ~ p ∧ [~p ∧~ (~q)] [Negation of disjunction]
≡ ~ p ∧ (~ p ∧ q) [Negation of negation]
9) Ans. ~ (p∧ q) ∨ (p∨ ~ q)
We know that ~ (p∧ q)= ~p∨~ q
~ (~p∨~ q) ≡ p ∧ q ….. (1)
Page 3 of 31
~ [(p∧ q) ∨ (p∨~ q)] ≡ ~ [(~p∨~q) ∧~ (p∧ ~ q)]
[Negation of disjunction]
≡ (p ∧ q) ∧ [~p ∨ ~ (~q)]
[(1) and Negation of conjunction]
≡(p ∧ q) ∧(~p ∨ q) [Negation of conjunction]
10) Ans.
11) Ans.
12) Ans.
Page 4 of 31
13) Ans.
14) Ans.
Page 5 of 31
15) Ans.
16) Ans. (p Λ ~ q) ↔ (p → q)
In the above truth table, all the entries in the last column are F.
∴ (p Λ ~ q) ↔ (p → q) is a contradiction.
17) Ans. ~(~ p Λ ~ q) ѵ q
Truth values in the last column are not identical.
∴ ~(~ p Λ ~ q) ѵ q is a contingency.
18) Ans. Let p : x < y
q : x² < y²
∴ The symbolic from of the given statement is p → q.
Inverse : ~ p → ~ q
i.e. if x ≥ y then x² ≥ y².
Contrapositive : ~ q → ~ p
i.e. if x² ≥ y² then x ≥ y.
19) Ans. i. The dual of this statement is ~ p ѵ (q ^ t)
ii. The dual of this statement is ‘Shweta is a doctor and Seema is a teacher.’
Page 6 of 31
20) Ans.
21) Ans.
Page 7 of 31
22) Ans.
23) Ans.
Page 8 of 31
24) Ans.
25) Ans.
Q.3 Solve the following:
1) Ans.
2) Ans.
3) Ans.
Page 9 of 31
4) Ans.
5) Ans.
6) Ans.
7) Ans.
8) Ans. Let p : it rains, q : the match gets cancelled.
∴ Given statement is p → q
i) Its converse is q → p
If the match gets cancelled then it rains.
ii) Inverse is ~ p → ~ q
If it does not rain then the match will not be cancelled.
iii) Its contrapositive is ~ q →~ p.
If the match is not cancelled then it does not rain.
Page 10 of 31
9) Ans. Converse: If a family becomes literate then the woman in it is literate
Inverse: If the woman in the family is not literate then the family does not becomes literate.
contrapositive: If a family does not becomes literate then the woman in the family is not literate.
10) Ans. Converse: If pressure increases then surface area decreases.
Inverse: If surface area does not decrease then pressure does not increase.
contrapositive: If pressure does not increase then surface area does not decrease.
11) Ans. If p → q is given, then its
converse is q → p
inverse is ~p → ~q
contrapositive is ~q → ~p
If x < y then x² < y² (x, y ∈ R)
Converse: If x² < y² then x < y
Inverse: If x ≥ y then x² ≥ y²
contrapositive: If x² ≥ y² then x ≥ y
12) Ans.
13) Ans.
Page 11 of 31
14) Ans.
15) Ans.
A statement pattern having truth value always F, irrespective of the truth values of its component
statement is called a Contradiction.
In the above truth table, all the entries in the last column are F.
∴ The given statement pattern is a contradiction.
Page 12 of 31
16) Ans.
17) Ans.
Page 13 of 31
18) Ans.
Page 14 of 31
19) Ans.
20) Ans. Let first number be x, second number be y and third number be z.
ATQ,
x+y+z=6
y+3z=11
x + z=2y
x-2y+z=0
Page 15 of 31
21) Ans.
Page 16 of 31
22) Ans.
23) Ans.
Page 17 of 31
24) Ans. Let p: The switch S₁ is closed.
q : The switch S₂ is closed.
r: The switch S₃ is closed.
~ q: The switch S₂’ is closed or switch S₂ is open.
~ r: The switch S₃’ is closed or the switch S₃ is open.
∴ The symbolic form of the circuit is
[p ^ (q ѵ r)] ѵ (~ r ^ ~ q ^ p)
≡ [p ^ (q ѵ r)] ѵ (p ^ ~ q ^ ~ r) ….[Commutative law]
≡ [p ^ (q ѵ r)] ѵ [p ^ ~ (q ѵ r)] ….[De – Morgan’s law]
≡ p ^ [(q ѵ r) ѵ ~ (q ѵ r)] ….[Distributive law]
≡p^T …[Complement law]
≡p …[Identity law]
∴ The new switching circuit is as shown
25) Ans.
Page 18 of 31
Q.4 Solve the following:
1) Ans. (p ∧ q) ∨ (~ p∧ q) ∨ (p ∧ ~ q) ≡ p∨ q
L.H.S . = (p ∧ q) ∨ (~p ∧ q) ∨ (p ∧ ~ q)
≡ [(p ∨ ~p) ∧ q] ∨ (p ∧ ~ q)... (Associative and distributive law)
≡ (T ∧ q) ∨ (p ∧ ~ q)....[Complement law]
≡ q ∨ (p ∧ ~ q)....[Identity law]
≡ (q ∨ p) ∧ (q ∨ ~ q) ....[Distributive law]
≡ (q ∨ p) ∧ T....[Complement law]
≡ (q ∨ p) ....[Identity law]
≡ p∨ q [Identity law]
≡ RHS
LHS = RHS
(p∧ q) ∨ (~ p∧ q) ∨ (p ∧ ~ q) ≡ p∨ q
2) Ans. LHS ≡ p↔ q
≡ (p → q) ∧ (q →p)
≡(~p ∨ q) ∧ (~q ∨p) [Conditional law]
≡ [~p ∧ (~q ∨ p)] ∨ [q ∧ (~q ∨p)]
[Distributive law]
≡[ (~p ∧ ~q ) ∨(~p ∧ p)] ∨ [(q ∧~q) ∨( q ∧p)] [Distributive law]
≡[ (~p ∧ ~q ) ∨F]∨ [F∨( q ∧p)]
[Complement law]
≡ (~p ∧ ~q ) ∨ ( q ∧p) [Identity law]
≡(~p ∧ ~q ) ∨ ( p ∧ q)[Commutative law]
≡ ( p ∧ q) ∨(~p ∧ ~q ) [Commutative law]
≡ RHS
p↔ q ≡ (p∧ q) ∨ (~ p∧ ~ q)
3) Ans. LHS ≡ [(p∨ q) ∧p] ∨[ (p∨ q) ∧~ q]
[Distributive law]
≡p ∨[ (p∨ q) ∨~ q] [Absorption Law]
≡ p ∨( p∨ q ∨~ q) [Associative Law]
≡p ∨[ p∨ T] [Complement Law]
≡p ∨ p
≡p
≡ RHS
(p∨ q) ∧ (p∨ ~ q) ≡ p
Page 19 of 31
4) Ans.
5) Ans.
6) Ans. (p ∧ q) ∨ [~p∧ (~ q ∨ p ∨ r)]
Let p: the switch S₁ is closed.
q: the switch S₂ is closed.
r: the switch S₃ is closed.
~p: the switch S₁′ is closed or the switch S₁ is open.
~q: the switch S₂’ is closed or the switch S₂ is open.
Consider the given statement, (p ∧ q) ∨ [~p∧ (~ q ∨ p ∨ r)]:
(p ∧ q) represents that the switches S₁, S₂ are connected in series . (~ q ∨ p ∨ r) represents that the
switches S₂` , S₁ and S₃ are connected in parallel.
Page 20 of 31
~p∧ (~ q ∨ p ∨ r) represents S₁′ and (~ q ∨ p ∨ r) in series.
(p ∧ q) ∨ [~p∧ (~ q ∨ p ∨ r)] represents (p ∧ q) and [~p∧ (~ q ∨ p ∨ r)] in parallel
Hence, the switching circuit of given statement is
7) Ans. [(p ∧ r) ∨ (~q∧ ~ r)] ∧ (~ p∧ ~ r)
Let p: the switch S₁ is closed.
r: the switch S₃ is closed.
~p: the switch S₁′ is closed or the switch S₁ is open.
~q: the switch S₂’ is closed or the switch S₂ is open.
~r: the switch S₃’ is closed or the switch S₃ is open.
Consider the given statement, [(p ∧ r) ∨ (~q ∧ ~ r)] ∧ (~ p∧ ~ r)
(p ∧ r) represents that the switches S₁, S₃ are connected in series .
(~q ∧ ~ r) represents that the switches S₂` and S₃` are connected in series.
(p ∧ r) ∨ (~q ∧ ~ r)] represents that (p ∧ r) and (~q ∧ ~ r)] in parallel.
(~ p∧ ~ r) represents that the switches S₁` and S₃` are connected in series.
[(p ∧ r) ∨ (~q ∧ ~ r)] ∧ (~ p∧ ~ r) represents that the [(p ∧ r) ∨ (~q ∧ ~ r)] and (~ p∧ ~ r) are
connected in parallel.
Hence, the switching circuit of given statement is
8) Ans. (p∧ ~ q ∧ r) ∨ [p ∧ (~ q∨ ~r)]
Let p: the switch S₁ is closed.
r: the switch S₃ is closed.
~q: the switch S₂’ is closed or the switch S₂ is open.
~r: the switch S₃’ is closed or the switch S₃ is open.
Consider the given statement, (p∧ ~ q ∧ r) ∨ [p ∧ (~ q∨ ~r)]
(p∧ ~ q ∧ r) represents that the switches S₁, S₂` and S₃ are connected in series.
p ∧ (~ q∨ ~r) represents that S₂` and S₃` connected in parallel and both connected in series with S₁.
(p∧ ~ q ∧ r) ∨ [p ∧ (~ q∨ ~r)] represents that (p∧ ~ q ∧ r) and [p ∧ (~ q∨ ~r)] are connected in
Parallel.
Hence, the switching circuit of given statement is
Page 21 of 31
9) Ans.
Page 22 of 31
10) Ans.
11) Ans.
Page 23 of 31
12) Ans.
Page 24 of 31
13) Ans.
Page 25 of 31
14) Ans.
Page 26 of 31
Page 27 of 31
15) Ans.
Page 28 of 31
16) Ans.
Page 29 of 31
17) Ans.
18) Ans. (p ѵ q) ѵ r ↔ p ѵ (q ѵ r)
All the truth values in the last column are T.
∴ (p ѵ q) ѵ r ↔ p ѵ (q ѵ r) is tautology.
19) Ans.
In the above truth table, the entries in column 3 and 8 are identical.
∴ p ↔ q ≡ (p Λ q) ѵ (~ p Λ ~ q)
Page 30 of 31
20) Ans.
Hence, the original matrix is reduced to upper triangular matrix.
∴ We have by equality of matrices
x+y+z=9 ...(i)
y + 3z = 16 …(ii)
9z = 45 ….(iii)
i.e., = 5
Substituting z = 5 in equation (ii), we get
y + 3(5) = 16
∴ y + 15 = 16
∴y=1
Substituting z = 5, y = 1 in equation (i), we get
x+1+5=9
∴x+6=9
∴x=3
Page 31 of 31
