GATE

Workbook 2026
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 2026 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 2026 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 7 or 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 2026 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 
∏ 
i =0  n  (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
= x9 ∑ 3 −1+r Cr X r = x ∑
r +2
=
9
Cr X r
(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 transitive.

© 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 2026 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 number 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 2026 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

⇒ (a, b) R (e, f ). So clearly R is not transitive.

So, (a, b) R(c, d ) and (c, d ) R(e, f ) 
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 2026 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 2026 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