GATE PSUs

State Engg. Exams

Workbook 2024
Detailed Explanations of
Try Yourself Questions

Computer Science & IT

Discrete & Engineering
Mathematics

© Copyright: Subject matter to MADE EASY Publications, New Delhi. No part of this book may be reproduced or utilised in any form without the written permission.
 1 Propositional Logic

T1 : Solution

(a)
[(p ∧ q) → (p ∨ q)]v ~ p ∨ q ≡ ~ (p ∧ q ) ∨ (p ∨ q ) ∨~p ∨ q
≡ (~p ∨ ~q ) ∨ (p ∨ q ) ∨~p ∨ q
≡ (~p ∨ p) ∨ (~ q ∨ q) ∨~p ∨ q
≡ T ∨ T ∨ ~p ∨ q
≡ T

T2 : Solution

(d)
∃x (P(x) → ∃y Q(y )) ≅ ¬ ∀x ¬ (P(x) → ∃y Q(y))
≅ ∃x (¬P(x) ∨ ∃y Q(y ))
≅ ∃x (¬∃y Q(y ) → ¬P(x))
≅ ¬∀x (P(x) ∧ ¬ ∃y Q(y ))

T3 : Solution

(b)
For every person x, if person x is female and person x is a parent, then there exists a person y such that
person x is the mother of person y.
F (x) : x is female
P (x) : x is a parent.
M (x, y) : x is the mother of y
∀x ((F ( x) ∧ P ( x) ) → ∃y M ( x, y ) )

≅ ∀x ∃y ((F ( x) ∧ P ( x) ) → M ( x, y ) )

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 3

T4 : Solution

(b)

Given: ∀x∈ R, if x > 2 then x2 > 4

Contrapositive is: ∀x∈ R, if x2 ≤ 4 then x ≤ 2

Converse is: ∀x∈ R, if x2 > 4 then x > 2

Inverse is: ∀x∈ R, if x ≤ 2 then x2 ≤ 4

T5 : Solution

(c)

∀x ∀y ∀z ((Apple ( x ) ∧ Apple (y ) ∧ Apple (z )) → ( x = y ∨ x = z ∨ y = z ))

T6 : Solution

(a)
In I1 both hypothesis are true and conclusion is also true by Modes Ponens.
Socrates is human : p
Socrates is mortal : q
p→q
p
∴ q ⇒ by Modus Ponens

In I2 both hypothesis are true and conclusion is also true by Modus Tollens.
MADE EASY is closed today : q
It will rain today : p
p→q
~q
∴ ~ p ⇒ by Modus Tollens

T7 : Solution

(d)
p q p → q ~ (p → q) ~ q ~ (p → q) →~ q p q p → q ~ q →~ p (p → q) ↔ (~ q →~ p)
T T T F F T T T T T T
T F F T T T T F F F T
F T T F F T F T T T T
F F T F T T F F T T T

© Copyright www.madeeasypublications.org
4 Computer Science & IT • Discrete & Engineering Mathematics

T8 : Solution

(d)
(i) ~ (∀x)∃y P ( x, y ) ≡ (∃x) (∀y )[~ P ( x, y )]

∃x ∀y [~ P ( x, y )] ≡ (∃x)(∀y )[~ P ( x, y )]
Above logic is true.
(ii) ~ (∀x)P(x) ≡ ∃x[~ P(x)]
∃x[~ P(x)] ≡ ∃x[~ P(x)]
Above logic is true.
(iii) ~ (∃x)(∀y )[P ( x, y ) ∨ Q( x, y )] ≡ (∀x)(∃x)[~ P ( x, y )∧ ~ Q( x, y )]

(∀x)(∃x)[~ P ( x, y )∧ ~ Q( x, y )] ≡ (∀x)(∃x)[~ P ( x, y )∧ ~ Q( x, y )]
Above logic is true.
Since all the above option are correct.

T9 : Solution

(c)
¬∀z [P (z ) → (¬Q(z ) → P (z ))]
∃z ¬[¬P (z )] ∨ ¬ (¬Q(z ) ∨ P (z ))]
∃z ¬ [¬P (z ) ∨ (Q (z ) ∨ P (z ))]
∃z ¬[P (z ) ∧ (¬Q(z ) ∧ ¬P (z ))]
∃z [P (z ) ∧ ¬Q(z ) ∧ ¬P (z )] [∴ P ⋅ ¬ P = 0]

T10 : Solution

(b)
Option (a) is correct because every valid formula is tautology and every tautology is satisfiable.
Option (b) is incorrect because some satisfiable are tautology.
Option (c) is correct because no contradiction is satisfiable.

T11 : Solution

(c)
There are atmost two apples : ∀x ∀y ∀z ((Apple (x) ∧ Apple (y ) ∧ Apple (z )) → (x = y ∨ x = z ∨ y = z))
There are exactly two apples : ∃x ∃y (Apple (x) ∧ Apple (y ) ∧ (x ≠ y ) ∧ ∀z (Apple (z) → ((z = x) ∨ (z = y))))
There is atmost one apple : ∀x ∀y ((Apple (x) ∧ Apple (y )) → (x = y ∨ y = x))
There is exactly one apple : ∃x (Apple (x) ∧ ∀y (Apple (y ) → (x = y)))

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 5

T12 : Solution

(c)
∀x∈N [x ≠ 7 ∧ Prime(x) → ¬ Divisibleby7(x)]
≅
∀x∈N [x = 7 ∨ ¬ Prime(x) ∨ ¬ Divisibleby7(x)]
≅
¬∃x ∈ N [x ≠ 7 ∧ Prime(x) ∧ Divisibleby7(x)]
All represents that “no prime except 7 is divisible by 7”.

T13 : Solution

(a)
Everybody loves Mahesh: ∀x Loves (x, Mahesh)
Everybody loves somebody: ∀x ∃y Loves (x, y )
There is somebody whom everybody loves: ∃y ∀x Loves (x, y )
There is somebody whom no one loves: ∃y ∀x ¬ Love (x, y )

T14 : Solution

(d)
∀x P(x) → ∀x [P(x) ∨ Q(x)] is valid
∃x ∃y P(x,y ) → ∃y ∃x P(x,y ) is valid
∃x [R(x) ∨ S(x)] → ∃x R(x) ∨ ∃x S(x) is also valid

T15 : Solution

(b)
¬ (¬ p ∨ q) ∨ (r → ¬ s) ≅ (p ∧ ¬ q) ∨ (¬ r ∨ ¬s) ≅ (p ∨ ¬ r ∨ ¬ s) ∧ (¬ q ∨ ¬ r ∨ ¬ s)

T16 : Solution

(d)
P1, P2 and P3 are equivalent. All are representing the same statement: "there are exactly two apples".

T17 : Solution

(d)
All the statements give true as the truth value. None of them give false as the truth value.

© Copyright www.madeeasypublications.org
6 Computer Science & IT • Discrete & Engineering Mathematics

T18 : Solution

(11)
We wish to make
¬ ((p ⇒ q) ∧ (¬r ∨ ¬s)) = 1

⇒ (p ⇒ q) ∧ (¬r ∨ ¬s) = 0
⇒ (p ⇒ q ) = 0 ...(1)

or ¬r ∨ ¬s = 0 ...(2)
Now (1) is satisfies only when p = 1 and q = 0.
Equation (2) ¬r ∨ ¬s = 0 , iff r ∧ s = 1
i.e. r = 1 and s = 1
i.e. x is a perfect square and x is a prime number. Which is not possible so condition (2) cannot be satisfied
by any x.
So condition (1) must be satisfies which is p = 1 and q = 0 i.e. x ∈ {8, 9, 10, 11, 12} and x is not a
composite.
Now the only value of x which satisfies this is x = 11.
So correct answer is x = 11.

„„„„

www.madeeasypublications.org © Copyright
 2 Combinatorics and
Recurrence Relations

T1 : Solution

(b)
Total number of letters = 15
Number of T’s = 3
First place 12 letters other than T’s at dot places.
X. X. X. X. X. X. X. X. X. X. X. X. X
12!
The number of ways =
5!3!2!
Since no two T’s are together, thus place T’s at cross places whose number = 13
13
P3
Their arrangements are =
3!

12! 13P3
Total number of ways = ×
5!3!2! 3!

T2 : Solution

(b)

n ⎛n⎞
∑ ⎜ k ⎟ xk . yn – k = (x + y )n
k =0⎝ ⎠

n
⎛n⎞
∑ ⎜ k ⎟ (–1)k . 3n – k = ((–1) + 3)n = 2n
k =0⎝ ⎠

© Copyright www.madeeasypublications.org
8 Computer Science & IT • Discrete & Engineering Mathematics

T3 : Solution

(c)
The candidate is unsuccessful if he fails in 9 or 8 or 7or 6 or 5 papers.
∴ The number of ways to be unsuccessful
= 9C9 + 9C8 + 9C7 + 9C6 + 9C5
= 9C0 + 9C1 + 9C2 + 9C3 + 9C4

1 9
= ( C0 + 9C1 + 9C2 + .......... + 9C9)
2

1 9
= (2 ) = 28
2

T4 : Solution

(b)
T (n) – 4T (n – 1) + 3T (n – 2) = 0
x2 – 4x + 3 = 0
(x – 3) (x – 1) = 0 ⇒ x = 3, 1
General Solution: T (n) = A.3n + B.1n
= A.3n + B
Given: T(0) = 0 and T(1) = 2
By taking n = 0 ⇒ T (n ) = A.3n + B
T (0) = A + B ⇒ A + B = 0 ...(i)
By taking n = 1 ⇒ T(1) = A.3 + B ⇒ 3A + B = 2 ...(ii)
From (i) and (ii) ⇒ A = 1, B= – 1
T (n) = A.3n + B[∵ Substitute A = 1 and B = –1]
⇒ T (n) = 3n – 1

T5 : Solution

(a)
x + y + z = 17
x ≥ 1, y ≥ 1, z ≥ 1
Put x = 1 + u, y = 1 + v, z =1 + w
⇒ u + v + w = 14
Now number of solutions in non-negative integers

⎛ 14 + 3 − 1⎞ ⎛ 16 ⎞ ⎛ 16 ⎞
⎜ ⎟ = ⎜ ⎟ = ⎜ ⎟ = 120
⎝ 14 ⎠ ⎝ 14 ⎠ ⎝ 2 ⎠

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 9

T6 : Solution

(b)
Example: In how many ways can the pack of 52 cards be partitioned into 4 sets of size B.

⎛ 52 ⎞ ⎛ 39 ⎞⎛ 26 ⎞⎛ 13 ⎞ (52)!
⎜ ⎟ ⎜ ⎟⎜ ⎟⎜ ⎟ =
⎝ 13 ⎠ ⎝ 13 ⎠⎝ 13 ⎠⎝ 13 ⎠ (13!)4

(52)!
All partitions are not distinct. Each distinct partition arises in 4! ways. Therefore # ways =
(13!)4 ⋅ 4!
m −1
⎛ mn − in ⎞
∏⎜ n ⎠
⎟
i =0 ⎝ (mn)!
Similarly, =
m! (n !)m ⋅ m !

T7 : Solution

(a)
General solution: T (n) = C1.3n + C2. 2n

⎡ Where Homogeneous part : (x − 3) = 0 ⇒ x = 3⎤

⎢ n ⎥
⎢⎣Particular solution: C2.2 ⎥⎦
T (0) = 1, T (1) = 3.T (0) + 2′ = 3 + 2 = 5
T (n) = C1.3n + C2.2n
T (0) = C1.30 + C2.20 ⇒ 1 = C1 + C2
T (1) = C1.3′ + C2.2′ ⇒ 5 = 3C1 + 2C2
C1 = 3, C2 = –2
∴ T (n) = 3.3n – 2.2n = 3n + 1 – 2n + 1

T8 : Solution

(c)
Each question can be answered in 4 ways.
∴ The number of ways = 465

T9 : Solution

(c)
T(n) = 10.T (n – 1)–25.T(n – 2)
⇒ 25T (n – 2) – 10.T (n – 1) + T (n) = 0
⇒ 25 – 10x – x2 = 0
⇒ (x – 5)2 = 0
T (n) = C1⋅5n + C2⋅n⋅5n
T (0) = 5, T (1) = 5
T (0) = C1⋅5° + C2⋅0⋅5°
⇒ 5 = C1

© Copyright www.madeeasypublications.org
10 Computer Science & IT • Discrete & Engineering Mathematics

T (1) = C1⋅51 + C2⋅1⋅51

5 = 5C1 + 5C2
⇒ C1 + C2 = 1
⇒ C2 = 1 – C1 = 1 – 5 = 4
∴ T (n) = 5.5n + (–4)n.5n
= 5n + 1 – 4n.5n

T10 : Solution

(10)
We wish to find coefficient of x12 in (x3 + x4 + x5 + ......)3
= (x3(1 + x1 + x2 +......))3

= x 9 (1+ x + x 2......)3
∞ ∞
x9 r +2
= x9 ∑ 3 −1+r Cr X r = x ∑ Cr X r
9
=
(1 − x)3 r =0 r =0

Now to make x12we need to put r = 3

So coefficient of x12 is 3 + 2C3 = 5C3 = 5C2 = 10

„„„„

www.madeeasypublications.org © Copyright
 3 Set Theory and Algebra

T1 : Solution

(d)
f : N→Z
f (0) = f (2) = 3
⇒ f is not injective
Clearly f is not surjective, all numbers in Z do not have preimages in N (example: 0 has no preimage)
f is function which is not injective and not surjective.

T2 : Solution

(d)

Countable sets : Finite Set, N, O+ , Z + , Z − , Z


denumerable

Uncountable sets : Real numbers

∴ Set of real numbers in the interval [0, 1] is uncountable because they can not be enumerated.

T3 : Solution

(b)
(i) ⏐x – y⏐ ≤ 2
If we take y = (x)
then ⏐x – (x)⏐ ≤ 2 True
So it is reflexive.
(ii) If we do ⏐x – y⏐ or ⏐y – x⏐, answer will be same. So it is symmetric.
(iii) If we do [x – (x – 2)] the [(x – 2) – (x – 4)], the [x – (x – 4)] not follow the condition
So it is not transtive.

© Copyright www.madeeasypublications.org
12 Computer Science & IT • Discrete & Engineering Mathematics

T4 : Solution

(c)
f (x) = (5x + 1)2
⇒ y = (5x + 1)2
⇒ y = 5x + 1
⇒ y − 1 = 5x
y −1
⇒ x = ( ∵ swap x and y for inverse)
5

⇒ y =
1
5
( )
x −1

⇒ f –1(x) =
1
5
( )
x −1

T5 : Solution

(d)
x * y = x + y + xy
Let e be the identity
x * e = x + e + xe [Put e = 0]
x = x

∴ e=0 ⇒ 0 is the identity of S

Let y is the inverse of x

Then x*y = e⇒x*y=0
⇒ x + y + xy = 0
⇒ x + y (1 + x) = 0

−x
⇒ y=
1+ x
⇒ 1+x≠0 ⇒ x ≠ –1
−x
Inverse of x = ; ∀x ∈R \ {−1}
1+ x
∴ S = R\{–1} is an abelian group.
[Note:
Note: S is Commutative and Associative over *]

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 13

T6 : Solution

(c)

A B

Same Venn diagram can be produced for both S1 and S2.

∴ S1 = S2

T7 : Solution

(c)
–1 ≤ sin x ≤ +1
–5 ≤ 5 sin x ≤ 5
–2 ≤ 3 + 5 sin x ≤ 8
–2 ≤ f (x) ≤ 8
⇒ Range is: [–2, 8]

T8 : Solution

(d)
R = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (4, 1)}
R is not reflexive: (3, 3) ∉ R
R is symmetric: if (x + y ) ≤ 5 ⇒ (y + x) ≤ 5
R is not antisymmetric: (1, 2) and (2, 1) in R
R is not transitive: (3, 1) and (1, 3) in R, but (3, 3) ∉ R
∴ R is symmetric

T9 : Solution

(d)
X= {{ }, {a}}
Power set = {{ }, {{ }} {{a}}, {{ }, {a}}}
power set contain 2n element of original set.

© Copyright www.madeeasypublications.org
14 Computer Science & IT • Discrete & Engineering Mathematics

T10 : Solution

(d)
 is countable set.
Hence, Subset of any countable set is also countable and product of two countable sets is also countable.

T11 : Solution

(c)
Commutative for multiplication of matrices does not hold.
AB ≠ BA
If AB is possible to multiply that does not mean that BA can also be multiplied. Moreover the result will not
be the same except for the case when the 2 matrices are same.

T12 : Solution

(2)

f (n) = f ⎛⎜ ⎞⎟ if n is even
n
⎝2⎠
f (n) = f (n + 5) if n is odd
f : N+ → N+
⎛ 2⎞
Now f (2) = f ⎜ ⎟ = f (1)
⎝ 2⎠
⎛8⎞
f (3) = f (3 + 5) = f (8) = f ⎜ ⎟ = f (4)
⎝2⎠
⎛ 4⎞
= f ⎜ ⎟ = f (2) = (1)
⎝ 2⎠
So f (1) = f (2) = f (3) = f (4) = f (8)
⎛ 10 ⎞
Now let us find f (5) = f (5 + 5) = f (10) = f ⎜ ⎟ = f (5) so f (5) = f (10)
⎝ 2⎠
Now let us find f (9)
⎛ 14 ⎞
f (9) = f (9 + 5) = f (14) = f ⎜ ⎟ = f (7)
⎝ 2⎠

= f (7 + 5) = f (12) = f ⎛⎜ ⎞⎟ = f (6)
12
⎝ 2⎠

⎛ 6⎞
= f ⎜ ⎟ = f (3)
⎝ 2⎠
So f (9) = f (7) = f (6) = f (3) = f (1) = f (2) = f (4) = f (8)
For n > 10, the function will be equal to one of f (1), f (2)....f (10)
So the maximum no. of distinct values f takes is only 2.
First is f (1) = f (2) = f (3) = f (4) = f (8) = f (9) = f (7) = f (6)
Second is f (5) = f (10)
All other n values will give only one of these two values.

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 15

T13 : Solution

(d)
If every subset of a lattice has LUB and GLB, then such a lattice is called as complete lattice. All of the
given lattices are complete lattices, since all the lattices are having GLB and LUB.

T14 : Solution

(d)
(A – B) – C = (A ∩ B) − C = A ∩ B ∩ C
(A – C) – (B – C) = (A ∩ C) − (B ∩ C)
= (A ∩ C) ∩ (B ∪ C)
= (A ∩ C ∩ B) ∪ (A ∩ C ∩ C)
= (A ∩ C ∩ B) ∪ (A ∩ φ)
= (A ∩ C ∩ B) ∪ φ
= A∩C ∩ B

T15 : Solution

(c)
A distributive lattice need not be a complemented lattice. A complemented lattice may or may not be
distributive lattice. However a complemented has to be bounded because the complement property requires
0 and 1 which when present will make the lattice bounded.

T16 : Solution

(b)
(a, b) R(c, d ) if a ≤ c or b ≤ d
P : R is reflexive
Q : R is transitive
Since, (a, b) R(a, b) ⇒ a ≤ a or b ≤ b
⇒ t or t
Which is always True, R is reflexive.
Now let us check transitive property
Let (a, b) R(c, d ) ⇒ a ≤ c or b ≤ d
and (c, d) R(e, f ) ⇒ c ≤ e or d ≤ f
Now let us take a situation
a ≤ c (True) or b ≤ d ( false)
and c ≤ e (False) or d ≤ f (True)
Now we can get neither a ≤ e nor b ≤ f

So, (a, b) R(c, d ) and (c, d ) R(e, f ) 

⇒ (a, b) R (e, f ). So clearly R is not transitive.
So P is true and Q is false. Choice (b) is correct.

„„„„

© Copyright www.madeeasypublications.org
 4 Graph Theory

T1 : Solution

(d)
To find maximum number of edges in the disconnected graph with n-vertices, form a complete graph with
(n – 1) vertices and 1 vertex is isolated. So the graph will be disconnected and addition of any edge will
make the graph as connected.
∴ Maximum number of edges in disconnected graph can present:

(n −1) (n − 1)(n − 2)
C2 =
2

T2 : Solution

(a)

K3 : → χ(K3) = 3

K4 : → χ(K4) = 4

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 17

Any planar graph G ⇒ χ(G ) ≤ 4

Every face is bordered by exactly 3 edges ⇒ χ(G) ≥ 3
∴ χ(G) = 3 or 4
So, χ(G) can never have the value 2

T3 : Solution

(a)

9 8 7

1 5
G1 : is Hamiltonian [ ∵ Hamiltonian cycle exists]
2 3 6

G2 : not Hamiltonian graph [ ∵ Hamiltonian cycle does not exists in G2]

∴ Only G1 is hamiltonian graph.

T4 : Solution

(d)
Let n = 2 ⇒ # vertices = 8 [ ∵ # vertices in G = 4n]
1 2 3 4

5 6 7 8

⇒ 3 components Note: For any n, the #components in G = 3]

[Note:

T5 : Solution

(b)

V (C1) = {1,3,5,7} ⇒ m1 = 4 ⎫
⎪
V (C2 ) = {2,6} ⇒ m2 = 2 ⎬ max = 4
V (C3 ) = {4,8} ⇒ m3 = 2 ⎪⎭
In general, ‘G ’ with 4n vertices has 3 components
V (C1) = {1, 3, 5, 7, 9, 11, 13, 15,......} ⇒ m1 = 2n
V (C2) = {2, 6, 10, 14, 18,......} ⇒ m2 = n
V (C3) = {4, 8, 12, 16, 20,......} ⇒ m3 = n
∴ Max (m1, m2, m3) = 2n

© Copyright www.madeeasypublications.org
18 Computer Science & IT • Discrete & Engineering Mathematics

T6 : Solution

(b)
Example: C2n ⇒ n = 2 ⇒ C4

a b
a b a b
C4 : ⇒ &
d c d c
d c

a b
a b b c
C4 : f c ⇒ c d & d e

e d e f f a

A cycle graph with even vertices has 2 perfect matchings.

T7 : Solution

(c)
S1 is true but converse of S1 is not true. If a graphs is Hamiltonian that does not mean that d (v) ≥ n /2 for
each vertex in G.
S2 is true and converse of S2 is also true because G is connected graph. If g is eulerian then every vertex
has to have even degree.

T8 : Solution

(a)
G1 and G2 are isomorphic
a→1
b→3
c→4
d→5
e→6
f→2

T9 : Solution

(c)
G is a planar graph. Every planar graph is 4-colorable. Every face is bordered by 3 edges.
So graph has possibilities of 3 or 4 colors.
k3 colored with 3 and k4 colored with 4 colors.

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 19

T10 : Solution

(c)

(n − 1)(n − 2)
S1 : The maximum number of edges = when a graph has disconnected into two components
2
where one component with a single vertex and other component is complete graph on (n – 1) vertices.
∴ S1 is true.
S2 : G is a forest if and only if G has (n – k) edges. If G is a forest, then each connected component is a
tree.
Example: G has 10 vertices and 3 components. Two components are having a single vertex. Third component
must be a tree with 7 edges i.e., G has 3 components with 7 edges where two components with no edge
and third component with 7 edges.
∴ S2 is true.

„„„„

© Copyright www.madeeasypublications.org
 5 Probability and Statistics

T1 : Solution

(b)
P(X = 2) + P(X = 4) + P(X = 6) + ...
= [P.(1–P)] + [(1 – P).(1 – P).(1 – P).P] + [(1 – P).(1 – P) (1 – P) (1 – P) (1 – P).P] + ...
= P (1 – P) + (1 – P)3. P + (1 – P)5.P + ...
= P (1 – P) [1 + (1 – P)2 + (1 – P)4 + ...]

1
[Since 1 + x + x2 + x3 + ... = ; x < 1]
1− x

⎡ 1 ⎤ 1− P
= P(1 − P) ⎢ 2⎥
=
⎣ 1 − (1 − P) ⎦ 2 − P

T2 : Solution

(c)
E [(X – c)2] = E [X 2] – 2cE [X ] + c 2
= Var(X ) + [E [X ]]2 – 2cμ + c2 [ ∵ E [X 2] = Var(X ) + [E (X )]2]
= σ2 + μ2 – 2cμ + c2
= (μ – c)2 + σ2

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 21

T3 : Solution

(b)
In any connected, planar, simple graph ⇒ e ≤ 3n – 6. This theorem goes only one way from left to right.
Choice (a) is same as this theorem and hence valid.
Choice (c) is the contrapositive of this theorem and hence is also valid.
Choice (d) if e = 3n – 5 then surely e > 3n – 6 and so the contrapositive of the theorem says that the graph
is not planar. So, choice (d) is valid.
Choice (b) is invalid because it is the converse of the one way theorem.

T4 : Solution

(b)
Exact weight cannot be written but there will be limit to measure the weight.
Therefore it is continuous.
Number of questions in a test is finite and can be find easily that number of questions attempted.
Hence it is discrete.

T5 : Solution

(c)
A. Binomial distribution (discrete)

⎛n ⎞
P (x) = ⎜ ⎟ ⋅ P x ⋅ (1 − P )n − x , x ≥ 0
⎝ x⎠
B. Poisson distribution (discrete)

e −λ ⋅ λ x
P (x) = , x ≥1
x!
C. Exponential distribution (continuous)
f (x) = λ⋅e–λx, 0 < x < ∞
D. Uniform distribution (continuous)

1
f (x) = for a < x < b
b −a

© Copyright www.madeeasypublications.org
22 Computer Science & IT • Discrete & Engineering Mathematics

T6 : Solution

(c)

e −λ ⋅ λr
P (x = r) = , where λ = np
r!
λ = 500 × 0.006 = 3
P (x ≤ 1) = P (x = 0) + P (x = 1)

e −λ ⋅ λ 0 e −λ ⋅ λ1
= +
0! 1!

= e –3 + e –3 ⋅ 3
= 4e –3

T7 : Solution

(b)
Probability density function:
f (x) = λ⋅e–λx, x > 0

∞
E(X) = ∫ x ⋅ f (x) ⋅ d x
0

∞
−λx 1
= ∫ x λ ⋅e ⋅ dx =
λ
0

Var(X) = E(X2) – [E(X)]2

∫x
2
E(X2) = ⋅ f (x) ⋅ d x
0

∞
2
= ∫x
2
⋅ λ ⋅ e −λx ⋅ d x =
0 λ2

2
2 ⎛ 1⎞ 1
⇒ Var(X) = − = 2
2 ⎜⎝ λ ⎟⎠ λ
λ

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 23

T8 : Solution

(d)
E[6 X] = 6.E[X] = 6
Var[6 X] = 62 Var[X] = 36 × 2 = 72
E[1 – X] = 1 + (–1) E[X] = 1 – 1 = 0
Var[1 – X] = (–1)2 Var[X] = Var[X] = 2
∴ Var[1 – X] ≠ 3

T9 : Solution

(6)

∞
∫ f (x)d x = 1 is density function
−∞

⎪⎧ λ(− x2 + 3 x − 2) ; 1 ≤ x ≤ 2 ⎪⎫
f (x) = ⎨ ⎬
⎩⎪ 0 ; otherwise⎭⎪

0 2 ∞
= ∫ f ( x) ⋅ d x + ∫ f ( x) ⋅ d x + ∫ f ( x) ⋅ d x
−∞ 1 3

2
= 0 + ∫ f ( x) ⋅ d x + 0
1

2
∫ λ(− x
2
∴ + 3 x − 2)d x = 1
1
2
⎡ x3 x2 ⎤
⇒ λ ⎢− +3 − 2 x⎥ = 1
⎣ 3 2 ⎦1

⎡ ⎛ 8 1⎞ 3 ⎤
⇒ λ ⎢ − ⎜ − ⎟ + ( 4 − 1) − 2 (2 − 1)⎥ = 1
⎣ ⎝ 3 3 ⎠ 2 ⎦

⎡ 7 9 ⎤
⇒ λ ⎢ − + − 2⎥ = 1
⎣ 3 2 ⎦

⎡ −14 + 27 − 12 ⎤
⇒ λ⎢ ⎥ = 1
⎣ 6 ⎦
6
⇒ λ = =6
1
∴ λ = 6

© Copyright www.madeeasypublications.org
24 Computer Science & IT • Discrete & Engineering Mathematics

T10 : Solution

(0.33)

0.5 H – N stop
H
0.5
0.5 T – N stop

0.5 0.5 H – output Y

T 0.5 H – N stop
0.5 H
0.5
T 0.5 T – N stop
0.5 H – Output Y
0.5 T
0.5 T

The tree diagram for the problem is given above.

The desired output is Y.
Now by rule of total probability
p (output = Y ) = 0.5 × 0.5 + 0.5 × 0.5 × 0.5 × 0.5 +...
Infinite geometric series with
a = 0.5 × 0.5
and r = 0.5 × 0.5
0.5 × 0.5 0.25
So p (output = Y ) = =
1 − 0.5 × 0.5 0.75
1
= 0.33 (upto 2 decimal places)
3

„„„„

www.madeeasypublications.org © Copyright
 6 Linear Algebra

T1 : Solution

(a)
The augmented matrix [A⎥ B] is

⎡1 1 1 2⎤
⎢ ⎥
⎢ 2 1 −1 3⎥
⎢3 2 K 4 ⎥
⎣ ⎦

⎡1 1 1 2⎤
(R2 − 2R1) → R2 ⎢ ⎥
⇒ 0 −1 −3 −1⎥
(R3 − 3R1) → R3 ⎢
⎢0 −1 K −3 −2 ⎥⎦
⎣

⎡1 1 1 2⎤
⎢ ⎥
⇒ ⎢0 1 3 1⎥
⎢0 1 3 −K 2 ⎥⎦
⎣

⎡1 1 1 2⎤
⎢ ⎥
⇒ (R3 − R2 ) → R3 ⎢0 1 3 1⎥
⎢0 0 −K 1⎥⎦
⎣

For unique solution rank [A] = rank [A⎥ B] = 3

∴ K ≠ 0

© Copyright www.madeeasypublications.org
26 Computer Science & IT • Discrete & Engineering Mathematics

T2 : Solution

(a)
P 2 + 2 P + I = P 2 + 2P I + I 2
= (P + I)2
1
Eigen values of P are –1, ,3
2

⎡ 1 0 0⎤
⎢ ⎥
I3 × 3 = ⎢0 1 0⎥ ⇒ eigen values of I3 × 3 are 1, 1, 1
⎢⎣0 0 1⎥⎦

1
Eigen values of (P + I) are –1 + 1, + 1, 3 + 1
2
3
= 0, ,4
2
2
⎛3⎞ 9
Eigen values of (P + I)2 are (0)2, ⎜ ⎟ , (4)2 = 0, , 16
⎝2⎠ 4

T3 : Solution

(c)

⎡1 2 K ⎤ ⎡1 2 K ⎤ ⎡1 2 K ⎤
A = ⎢3 −1 1 ⎥ → ⎢0 −7 1− 3K ⎥ → ⎢0 −7 1− 3K ⎥⎥
⎢ ⎥ ⎢ ⎥ ⎢
⎢⎣5 3 −5⎥⎦ ⎢⎣0 −7 −5 − 5K ⎥⎦ ⎢⎣0 0 −6 − 2K ⎥⎦

If –6 –2K ≠ 0 then A is non-singular

If –6 –2K = 0 then A is singular
⇒ K = –3

T4 : Solution

(a)

⎡ 1 3 −2 1 0 0⎤
⎡ 1 3 −2 1 0 0⎤ ⎢
⎢0 2 4 0 1 0⎥ = ⎢ 1 ⎥⎥
⎢ ⎥ 0 1 2 0 0
⎢ 2 ⎥
⎢⎣0 0 −1 0 0 1⎥⎦ ⎢0 0 −1 0 0 1⎥
⎣ ⎦

⎡ 3 ⎤ ⎡ 3 ⎤
⎢ 1 0 −8 1 − 2 0⎥ ⎢ 1 0 −8 1 − 2 0 ⎥
⎢ ⎥ ⎢ ⎥
1 1
= ⎢⎢0 1 2 0 0⎥⎥ = ⎢⎢0 1 2 0 0 ⎥⎥
2 2
⎢ ⎥ ⎢ ⎥
⎣0 0 −1 0 0 1⎦ ⎣ 0 0 1 0 0 −1⎦

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 27

⎡ 3 ⎤
⎢ 1 0 0 1 − 2 −8⎥
⎢ ⎥
1
= ⎢0 1 0 0 2 ⎥
⎢ 2 ⎥
⎢ ⎥
⎣ 0 0 1 0 0 − ⎦
1

⎡ 3 ⎤
⎢ 1 − 2 −8⎥
⎢ ⎥
⎢ 1
∴ A–1 = 0
⎢
2 ⎥⎥
2
⎢ ⎥
⎣0 0 −1⎦

T5 : Solution

(d)
1, –1, 2, –2 are eigens of A
∴ characteristic equation is
(λ – 1) (λ + 1) (λ – 2) (λ + 2) = 0
(λ2 – 1) (λ2 – 4) = 0
λ4 – 5λ2 + 4 = 0
By Cayley Hamilton theorem,
A4 – 5A2 + 4I = 0
A4 – 5A2 = – 4I
B = A4 – 5A2 + 5I
det B = det (A4 – 5A2 + 5I)
= det (– 4I + 5I)
= det I = 1
Since – 1, 1, 2, –2 are eigen values of A
– 1 + 1, 1 + 1, 2 + 1, – 2 + 1 are eigens of A + I
0, 2, 3, –1 are eigens of A + I
Hence det (A + B) = det (A + A4 – 5A2 + 5I)
= det (A – 4I + 5I)
= det (A + I)
= (0) (2) (3) (–1) = 0
Trace of (A + B) = trace of (A + I) = 0 + 2 + 3 – 1 = 4

T6 : Solution

(c)
If all diagonal elements of a square matrix are equal then such matrix is scalar matrix.

⎡ 1 0 0⎤
⎢0 1 0⎥ is scalar matrix. A diagonal matrix is a matrix where diagonal elements are non-zero.
⎢ ⎥
⎢⎣0 0 1⎥⎦
Therefore, it is both diagonal and scalar matrix.

© Copyright www.madeeasypublications.org
28 Computer Science & IT • Discrete & Engineering Mathematics

T7 : Solution

(a)
⎪λ – AI⎪ = (1 – λ) (λ2 – 2) + (2 – λ) – λ
= –λ3 + λ2
⇒ –λ3 + λ2 = 0
⇒ –λ2(λ – 1) = 0
λ = 0, λ = 1
The largest eign value is 1

⎡ 0 −1 1⎤
⎢ ⎥
A – I = ⎢ 1 −2 1⎥
⎢⎣ −1 1 0⎥⎦R ↔ R
1 2

⎡ 1 −2 1⎤
⇒ ⎢ 0 −1 1⎥
⎢ ⎥
⎢⎣ −1 1 0⎥⎦R ← R +R
3 2 1

⎡ 1 −2 1⎤
⇒ ⎢0 −1 1⎥
⎢ ⎥
⎢⎣0 −1 1⎥⎦R ← R −R
3 3 2

⎡ 1 −2 1⎤
⇒ ⎢0 −1 1⎥
⎢ ⎥
⎣⎢0 0 0⎦⎥R1 ← R1− 2R2

⎡ 1 0 −1⎤
⇒ ⎢0 −1 1 ⎥
⎢ ⎥
⎣⎢0 0 0 ⎥⎦

[A − I ]x = 0
x1 – x3 = 0 ⇒ x1 = x3,
–x2 +x3 = 0 ⇒ x2 = x3

⎡ x1 ⎤ ⎡ x3 ⎤ ⎡1⎤
 ⎢ ⎥ ⎢x ⎥ = ⎢1⎥ x3
x = ⎢ x2 ⎥ = ⎢ 3⎥ ⎢⎥
⎢⎣ x3 ⎥⎦ ⎢⎣ x3 ⎥⎦ ⎢⎣1⎥⎦

⎡1⎤
∴ x1 = ⎢1⎥ is an eigen vector.
⎢⎥
⎢⎣1⎥⎦

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 29

T8 : Solution

(c)
Identity matrix is scalar matrix and hence it is diagonal matrix.

⎡ 1 0 0⎤
I3× 3 = ⎢0 1 0⎥ is scalar, because all of its diagonal elements are same.
⎢ ⎥
⎢⎣0 0 1⎥⎦

T9 : Solution

(c)
Am ⋅ An = Am + n and (Am)n = A mn

T10 : Solution

(c)

⎡a b⎤
⎡ −1 0 1⎤ ⎢c d ⎥
A = ⎢ ⎥ and B = ⎢ ⎥
⎣ 0 1 0⎦ ⎢⎣e f ⎥⎦

Given AB = I

⎡a b⎤
⎡ −1 0 1⎤ ⎢ ⎥ ⎡ 1 0⎤
∴ ⎢ 0 1 0⎥ ⎢c d ⎥ = ⎢0 1⎥
⎣ ⎦⎢ ⎣ ⎦
⎣e f ⎥⎦

⎡ −a + e −b + f ⎤ ⎡ 1 0⎤
⇒ ⎢ c ⎥ = ⎢ ⎥
⎣ d ⎦ ⎣0 1⎦
–b + f = 0
⇒ f = b

T11 : Solution

(b)
If we form a matrix using these n-tuples it will look like this:
⎡a1 a2 … … an ⎤
⎢b b2 … … bn ⎥⎥
⎢ 1
⎢c1 c2 … … cn ⎥
⎢ ⎥
⎢… … … … …⎥
⎢⎣… … … … …⎥⎦
Now the maximum rank of this matrix can be only n. Since the rank represents the number of linearly
independent rows, the maximum number of such linearly independent n-tuples is n.

© Copyright www.madeeasypublications.org
30 Computer Science & IT • Discrete & Engineering Mathematics

T12 : Solution

(c)
A = LU
⎡ 1 0 0⎤
Given L = ⎢⎢4 1 0⎥⎥
⎢⎣7 2 1⎥⎦

⎡a11 a12 a13 ⎤

⎢ ⎥
∴ A = ⎢a21 a22 a23 ⎥
⎢⎣a31 a32 a33 ⎥⎦
ai j = j, if i = 1
= 3 + a(i – 1)j ; otherwise
⎡ 1 2 3⎤
⎢ ⎥
∴ A = ⎢4 5 6⎥
⎢⎣7 8 9⎥⎦
A = LU
⎡ 1 2 3⎤ ⎡ 1 0 0⎤ ⎡a b c⎤
⇒ ⎢4 5 6⎥ = ⎢4 1 0⎥ ⎢0 d e ⎥
⎢ ⎥ ⎢ ⎥⎢ ⎥
⎢⎣7 8 9⎥⎦ ⎢⎣7 2 1⎥⎦ ⎢⎣0 0 f ⎥⎦
(i) a = 1, (ii) b = 2 (iii) c = 3
(iv) 4b + d = 5 ⇒ 4 × 2 + d = 5 ⇒ d = –3
(v) 4c + e = 6 ⇒ 4 × 3 + e = 6 ⇒ e = –6
(vi) 7c + 2e + f = 9 ⇒ 7 × 3 + 2 × (–6) + f = 9 ⇒ f = 0

⎡1 2 3 ⎤
∴ U = ⎢0 −3 −6⎥
⎢ ⎥
⎣⎢0 0 0 ⎥⎦

„„„„

www.madeeasypublications.org © Copyright
 7 Calculus

T1 : Solution

(d)

Left hand limit: lim f ( x) = lim (1 – h) – [1 – h]

x →1 − h →0

= lim (1 – h) – 1 = 0
h →0

Right hand limit: lim f ( x) = lim (1 + h) – [1 + h]

x →1 + h →0

= lim (1 + h) – 1
h →0

= lim h = 0
h →0

lim f ( x) = lim f ( x)
x →1 + x →1 −

f (x) = x – [x] is continuous at x = 1

Both Assertion and Reason are false.

T2 : Solution

(a)
n +1 n
⎛ 1⎞ ⎛ 1⎞ ⎛ 1⎞
lim ⎜ 1 + ⎟ = lim ⎜ 1 + ⎟ ⋅ lim ⎜ 1 + ⎟
n →∞ ⎝ n⎠ n →∞ ⎝ n ⎠ n →∞ ⎝ n ⎠
= e⋅1
= e

© Copyright www.madeeasypublications.org
32 Computer Science & IT • Discrete & Engineering Mathematics

T3 : Solution

(d)
3+ x − 3−x
lim
x →0 x
3+ x − 3−x 3+ x + 3−x (3 + x) − (3 − x)
= lim × = lim
x →0 x 3+ x + 3−x x →0 x ( 3 + x + 3 − x )

2x 2 1
= lim = =
x →0 x ( 3 + x + 3 − x) 2 3 3

T4 : Solution

(b)
f (x, y ) = 4x2 + 6y 2 – 8x – 4y + 8
∂f
= 8x – 8
∂x
∂f
= 12y – 4
∂y
∂f ∂f
Putting, = 0 and =
∂x ∂y
8x – 8 = 0 and 12 y – 4 = 0
1
Given, x = 1 and y =
3
⎛ 1⎞
⎜ 1, 3 ⎟ is the only stationary point.
⎝ ⎠
⎡ ∂2f ⎤
r = ⎢ 2⎥ =8
⎣⎢ ∂ x ⎦⎥⎛ 1,
⎜
1⎞
⎝ 3 ⎟⎠

⎡ ∂2f ⎤
s = ⎢ ⎥ =0
⎣⎢ ∂ x ∂ y ⎦⎥ ⎛1,
⎜
1⎞
⎝ 3 ⎟⎠

⎡ ∂2f ⎤
t = ⎢ 2⎥ = 12
⎣⎢ ∂ y ⎦⎥⎛ 1,
⎜
1⎞
⎝ 3 ⎟⎠
Since, rt = 8 × 12 = 96 and s2 = 0

⎛ 1⎞
We have either a maximum or minimum at ⎜ 1, ⎟
⎝ 3⎠

⎡ ∂2f ⎤ ⎛ 1⎞
Since, r = ⎢ ⎥ = 8 > 0, the point ⎜ 1, 3 ⎟ is a point of minimum.
2
⎢⎣ ∂ x ⎥⎦⎛ 1, 1 ⎞ ⎝ ⎠
⎜ 3⎟
⎝ ⎠

www.madeeasypublications.org © Copyright
 Detailed Explanations of Try Yourself Questions : GATE 2024 33

T5 : Solution

(c)
The minimum value is

2
⎛ 1⎞
f ⎜ 1, ⎟ = 4 × 12 + 6 × ⎛⎜ ⎞⎟ − 8 × 1 − 4 × + 8
1 1
⎝ 3⎠ ⎝3⎠ 3

6 4 10
= 4+ −8− +8 =
9 3 3

T6 : Solution

(d)

x
f (x) =
x2 + 4

(x2 + 4) ⋅ 1− x(2x)
⇒ f ′(x) =
(x2 + 4)2

4 − x2 (2 − x)(2 + x)
= 2 2
=
(x + 4) ( x 2 + 4)2

+ve
(2 − x)(2 + x) –ve –ve
∴ f ′(x) = 0 = =0
( x 2 + 4)2 x=2 x=2

∴ f is increasing for –2 < x < 2

i.e., x > –2 and x < 2
Note: f is decreasing for x < –2 and x > 2.

T7 : Solution

(b)
f (x) = x + ln x
1
f ′(x) = 1+ ...(1)
x
f (b) − f (a) f (e) − f (1)
f ′(c) = =
b −a e −1
e + ln e − (1 + ln 1) e + 1 − 1+ 0 e
= = =
e −1 e −1 e −1
e
⇒ f ′(c) = [from equation (1)]
e −1
1 e
⇒ 1+ =
c e −1

© Copyright www.madeeasypublications.org
34 Computer Science & IT • Discrete & Engineering Mathematics

1 e
⇒ = −1
c e −1
1 e −e +1
⇒ =
c e −1
⇒ c = e–1

T8 : Solution

(d)
z = x sin y – y sin x
∂z
= sin y – y cos x
∂x
∂z
= x cos y – sin x
∂y

∂z ∂z
dz = ⋅ dx + ⋅dy
∂x ∂y
= (sin y – y cos x) d x + (x cos y – sin x) dy

T9 : Solution

(c)
S1 : f(x) = x5 + 3x – 1
f ′(x) = 5x4 + 3 > 0, for all values of x
∴ f is increasing function.
S2 : f (x) = 1 – x3 – x9
f ′(x) = –3x2 – 9x8 < 0, for all values of x
∴ f is decreasing function.

„„„„

www.madeeasypublications.org © Copyright