GATE

PSUs

Workbook 2022

Computer Science &

Information Technology
Discrete and 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.
 CONTENTS

Discrete and Engineering

2022 Mathematics

Workbook
1. Propositional Logic ...................................... 4

2. Combinatorics & Recurrence Relations .......... 14

3. Set Theory & Algebra ................................. 20

4. Graph Theory ............................................. 31

Computer Science & 5. Probability & Statistics ................................. 38

Information Technology 6. Linear Algebra ............................................ 48

7. Calculus ..................................................... 53

© 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.
Discrete and Engineering Mathematics
Description Sheet

Chapter 1: Propositional Logic • Connected Graphs, Disconnected Graphs and

• Propositional Logic; First Order Logic Components
• Logical Connectives or Operators • Euler Graphs
• Well-Formed Formulas (WFFs) • Hamiltonian Graphs
• Normal forms of Well-Formed Formulas • Planar Graphs
• Rules of Inferences for Propositional Calculus • Trees
• Predicate Calculus • Enumeration of Graphs
• Universal and Existential Quantifiers Chapter 5 : Probability & Statistics
Chapter 2 : Combinatorics & Recurrence Relations • Some Fundamental Concepts
• Introduction • Mean
• Median
• Permutations
• Combinations • Mode and Standard Deviation
• Standard Deviation
• Binomial Identities
• Generating Functions • Random Variables
• Summation • Distributions
• Recurrence Relations Chapter 6 : Linear Algebra
• Solving Recurrence Relations • Introduction
Chapter 3 : Set Theory and Algebra • Special Types of Matrices
• Introduction • Algebra of Matrices
• Properties of Matrices
• Sets
• Relations • Determinants
• Inverse of Matrix
• Functions
• Equal Functions • System of Linear Equations
• Method of Factorisation or Triangularisation
• Groups
• Homomorphisms of Groups Method
• Eigen Values and Eigenvectors
• Isomorphisms of Groups
• Lattice Chapter 7 : Calculus
• Types of Lattices • Limit
• Boolean Algebra • Continuity and Differentiability Continuity
Chapter 4 : Graph Theory • Differentiability
• Fundamental Concepts • Mean Value Theorems
• Special Graphs • Theorems of Integral Calculus
• Graph Representations • Methods of Integration
• Isomorphism • Definite Integrals
• Invariants of Isomorphic Graphs • Partial Derivatives
• Operations on Graphs • Total Derivatives
• Walks, Paths and Cycles • Maxima and Minima
„„„„
 1 Propositional Logic

Q.6 Which of the following is a functionally complete

© 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.
set of connectives?
(a) {¬} (b) {∨}

Y
(c) {∧, ∨} (d) {∧, ¬}
Q.1 Which of the following is a proposition?
(a) What is your name? Q.7 Which of the following is not a functionally

S
(b) Do your assignments. complete set of connectives?
(c) 1 + 1 = 4 (a) {∧, ¬} (b) {∨, ¬}
(d) What a great day it is! (c) {⇒} (d) {↑}
Q.2 Which of the following is not a proposition?
(a) Delhi is in India A Q.8 Which of the following is a smallest minimal
functionally complete set of connective?
E
(b) London is the capital of France (a) {∧, ¬} (b) {↓}
(c) This sentence is true (c) {∧, ∨} (d) {∨, ¬}
(d) This sentence is false
Q.9 Which of the following is commutative but not
E

Q.3 Which of the following is true? associative

(a) 2 + 2 = 4 and x2 is negative for a real x (a) NAND (b) OR
(b) 2 + 2 = 5 follows from 2x is always even (c) EX-OR (d) Implication
D

(c) x is divisible by 2 or x is not divisible by 2

(d) 2x is divisible by 2 iff 3x is not divisible Q.10 Which of the following is false?
by 3 (a) p ⇔ q ≡ ~p ⇔ ~q
A

(b) p ⇔ q ≡ (~p ∨ q) ∧ (~q ∨ p)

Q.4 Which of the following is the negation of x is (c) p ⇔ q ≡ (p ⇒ q) ∧ (q ⇒ p)
even iff x is divisible by 2 (d) p ⇔ q ≡ pq ′ + p ′q
(a) (x is even or x is not divisible by 2) and
M

(x is not even or x is divisible by 2) Q.11 Which of the following is false?

(b) (x is even and x is not divisible by 2) or (a) p ⇒ q ≡ ~p ∧ q
(x is not even and x is divisible by 2) (b) p ∨ q ≡ ~(p ⇔ q)
(c) x is not even iff x is not divisible by 2 (c) p ∨ q ≡ pq ′ + p ′q
(d) x is even if x is divisible by 2 (d) p ⇒ q ≡ ~p ∨ q
Q.5 Which of the following is not equivalent to x is Q.12 Which of the following equivalences does not
even iff x is divisible by 2 hold?
(a) x is divisible by 2 iff x is even
(a) p ↑ q ⇔ ¬p
(b) x is not even iff x is not divisible by 2
(b) (p ↓ q) ↓ (p ↓ q) ⇔ p ∨ q
(c) x is not divisible by 2 iff x is not even
(d) x is even if x is divisible by 2 or x is divisible (c) (p ↑ p) ↑ (q ↑ q) ⇔ p ∨ q
by 2 if x is even (d) (p ↑ q) ↑ (p ↑ q) ⇔ p ∧ q

www.madeeasypublications.org © Copyright
 Workbook 5

Q.13 Which of the following is an equivalent formula Q.21 If a ≡ F and b ⇔ c is a tautology then which of
for p ⇒ (q ⇔ r) which contains neither the the following is equivalent to a ∨ (b ∧ c)
biconditional nor the conditional? (a) a (b) F

© 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.
(a) p ∧ (¬ q ∨ r) ∧ (¬ r ∨ q) (c) T (d) b
(b) p ∨ (¬ q ∧ r) ∨ (¬ r ∨ q)
Q.22 If p is false, then p ∧ q ⇒ r is a
(c) ~p ∨ (¬ q ∨ r) ∧ (¬ r ∨ q)
(a) tautology
(d) p ∨ (¬ q ∨ r) ∨ (¬ r ∨ q)
(b) contingency
Q.14 Which of the following is the correct order of (c) contradiction
precedence of the connectives? (in descending (d) true only if q and r are both false
order of precedence)
Q.23 If p ⇒ q is true, then the truth value of which of
(a) ¬, ∨, ∧, ⇒, ⇔ (b) ¬, ∧, ∨, ⇒, ⇔
the following cannot be determined
(c) ∧, ∨, ¬, ⇒, ⇔ (d) ∧, ∨, ¬, ⇔, ⇒

Y
(a) ~p ∨ q (b) ~q ⇒ ~p
Q.15 Which one of the following is the dual of (c) ~p ⇒ ~q (d) ~(p ∧ ~q)
¬(p ∧ q) ∨ (p ∧ ¬ (q ∨ ¬ s))

S
Q.24 If p ⇒ q is true, then the truth value of which of
(a) (p ∨ q) ∧ (p ∨ (q ∧ s))
the following can be determined?
(b) ¬(p ∨ q) ∧ (p ∨ ¬ (q ∧ ¬ s))
(a) p (b) q
(c) (p ∧ q) ∨ (p ∧ (q ∨ ¬ s))
(d) Does not have a dual

Q.16 Which of the following is the dual of p ∨ T ≡ T A (c) p ∧ q (d) q ∨ ~p

Q.25 If p ⇒ q is true and q ⇒ p is true then which of

E
the following is not possible?
(a) p ∨ T ≡ F (b) p ∧ T ≡ F
(a) p and q are both true
(c) p ∧ F ≡ F (d) p ∨ T ≡ T (b) p and q are both false
Q.17 Which of the following is the dual of ¬(¬ p) ≡ p (c) one of p or q is true and the other is false
E

(a) ¬ p ≡ p (b) ¬(¬ p) ≡ p (d) p ⊕ q = F

(c) ¬ p ≡ ¬ p (d) p ≡ ¬ p Q.26 Which of the following is a contradiction?
D

Q.18 Which of the following is false? (a) (p ⇒ q) ⇒ (q ⇒ p)

(a) If a logical equivalence is true then its dual (b) (p ⇔ q) ∧ (p ⊕ q)
is also true. (If A ⇔ B, then A* ⇔ B*) (c) p ∨ (p ⇒ q)
A

(b) If A* represents the dual of A, then (A*)* = A (d) p ∨ q

(c) ¬A(P1, P2,..., Pn) ⇔ A*(¬P1, ¬P2,...,¬Pn) Q.27 If p ⇒ q is false, which of the following is not
where P1, P2, ..., Pn are the atomic variables
M

true?
that occur in A and A* (a) q ⇒ p is satisfiable
(d) A = ¬A* (b) q ⇒ ~p is unsatisfiable
Q.19 If A(P, Q, R) = ¬P ∧ ¬ (Q ∨ R) what is (c) q ⇒ (p ∨ r) is satisfiable
A* (¬P, ¬Q, ¬R)? (d) q ⇒ (p ∨ r) is a tautology
(a) P ∧ Q ∧ R (b) P ∨ Q ∨ R Q.28 F 1 : p ∨ (p ∧ q)
(c) P ∨ Q ∧ R (d) P ∧ Q ∨ R F 2 : p ∧ (p ∨ q )
Q.20 Which of the following is a tautology? Which of the following is false?
(a) [(p ⇒ q) ∧ (r ⇒ s) ∧ (p ∨ r)] ⇒ (q ∨ s) (a) F1 and F2 are equivalent
(b) [(p ⇒ q) ∨ (q ⇒ p)] ⇔ (p ⇔ q) (b) F1 and F2 are duals of each other
(c) (p ⇒ q) ⇔ (~q ∨ p) (c) F1 and F2 are both tautologies
(d) (p ⇒ q) ∧ p ⇒ ~q (d) F1 and F2 are both contingencies

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

Q.29 Which of the following is the inverse of the Q.35 If F1, F2 and F3 are propositional formulae such
statement “If today is Monday, tomorrow is that F1 ∧ F2 → F3 and F1 ∧ F2 → ~F3 are both
Tuesday”? tautologies, then which of the following is true

© 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.
(a) If today is Monday, then tomorrow is not (a) Both F1 and F2 are tautologies
Tuesday (b) The conjunction F1 ∧ F2 is not satisfiable
(b) Tomorrow is not Tuesday follows from today (c) Neither is tautologous
is not Monday (d) Neither is satisfiable
(c) Today is Monday is sufficient for tomorrow (e) None of the above
is Tuesday [GATE-1991]
[GATE-1991]
(d) Today is not Monday is necessary for Q.36 The operation which is commutative but not
tomorrow is not Tuesday associative is

Y
Q.30 What is the converse of p = 0 or q = 0, if pq = 0? (a) AND (b) OR
(a) p ≠ 0 ∧ q ≠ 0; if pq ≠ 0 (c) EX-OR (d) NAND
(b) If pq = 0, p = 0 or q = 0 [GA TE-1992]
[GATE-1992]

S
(c) pq = 0, if p = 0 or q = 0 Q.37 Which of the following predicate calculus
(d) pq = 0 sufficient for p = 0 or q = 0 statements is/are valid
Q.31 Which of the following is the negation of
“All triangles are polygons”?
(a) There is some triangle which is a polygon A (a) (∀x) P(x) ∨ (∀x) Q(x) → (∀x) {P (x) ∨ Q(x)}
(b) (∃x) P(x) ∧ (∃x) Q(x) → (∃x) {P (x) ∧ Q(x)}
(c) (∀x) {P(x) ∨ Q(x)} → (∀x) P(x) ∨ (∀x) Q(x)
E
(b) All triangles are not polygons (d) (∃x) {P(x) ∨ Q(x)} → ~(∃x) P(x) ∨ (∃x) Q(x)
(c) All polygons are triangles [GA TE-1992]
[GATE-1992]
(d) There is some triangle which is not a polygon
Q.38 Which of the following is/are tautology
E

Q.32 What is the negation of ∀x ∀y x + y = 10? (a) a ∨ b → b ∧ c (b) a ∧ b → b ∨ c

(a) ∃x ∀y x + y = 10 (c) a ∨ b → (b → c) (d) (a → b) → (b → c)
D

(b) ∃x ∃y x + y ≠ 10 [GA TE-1992]

[GATE-1992]
(c) ∃x ∃y x + y = 10
Q.39 The proposition p ∧ (~p ∨ q) is
(d) ∀x ∀y x + y ≠ 10
(a) a tautology
A

Q.33 What is the negation of x is prime iff x is not (b) equivalent to p ∧ q

composite? (c) equivalent to p ∨ q
M

(a) x is prime and x is not composite or x is not (d) a contradiction

prime and x is composite (e) none of the above
(b) x is prime if x is not composite [GATE-1993]
[GATE-1993]
(c) x is not composite iff x is prime Q.40 If the proposition ~p ⇒ q is true, then the truth
(d) x is prime and x is composite or x is not prime value of the proposition ~p ∨ (p ⇒ q), where
and x is not composite ~ is negative, ‘∨’ is inclusive or and ⇒ is
Q.34 Which of the following well-formed formulas are implication, is
equivalent? (a) true
(a) P → Q (b) ~P → Q (b) multiple-valued
(c) ~P ∨ Q (d) ~Q → ~P (c) false
[GA TE-1988]
[GATE-1988] (d) cannot be determined
[GA TE-1995]
[GATE-1995]

www.madeeasypublications.org © Copyright
 Workbook 7

Q.41 Which of the following propositions is a (a) ((∀x) [α] ⇒ (∀x)[β]) ⇒ (∀x) [α ⇒ β]
tautology? (b) (∀x) [α] ⇒ (∃x) [α ∧ β]
(a) (p ∨ q ) → p (b) p ∨ (q → p) (c) (∀x) [α ∨ β ] ⇒ (∃x) [α] ⇒ (∀x) [α]

© 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.
(c) p ∨ (p → q ) (d) p → (p → q) (d) (∀x) [α ⇒ β ] ⇒ ((∀x) [α] ⇒ (∀x) [β])
[GATE-1997]
[GATE-1997] [GA TE-2003]
[GATE-2003]
Q.42 What is the converse of the following assertion? Q.47 The following resolution rule is used in logic
I stay only if you go programming: Derive clause (P ∨ Q) from
(a) I stay if you go clauses (P ∨ R), (Q ∨ ¬ R)
(b) If I stay then you go
Which of the following statements related to this
(c) If you do not go then I do not stay
rule is FALSE?
(d) If I do not stay then you go
(a) (P ∨ R) ∧ (Q ∨ ¬ R) ⇒ (P ∨ Q) is logically

Y
[GA TE-1998]
[GATE-1998]
valid
Q.43 Let a, b, c, d be propositions. Assume that the (b) (P ∨ Q) ⇒ (P ∨ R)∧ (Q ∨ ¬ R) is logically
equivalences a ↔ (b ∨ ¬ b) and b ↔ c hold.

S
valid
Then the truth value of the formula (a ∧ b) → (c) (P ∨ Q) is satisfiable if and only if (P ∨ R) ∧
((a ∧ c) ∨ d ) is always (Q ∨ ¬ R) is satisfiable
(a) True
(b) False
(c) Same as the truth value of b A (d) (P ∨ Q) ⇒ FALSE if and only if both P and Q
are unsatisfiable
[GA TE-2003]
[GATE-2003]
E
(d) Same as the truth value of d
Q. 48 Let p, q, r and s be four primitive statements.
Q.48
[GATE-2000]
[GATE-2000]
Consider the following arguments:
Q.44 Consider two well-formed formulas in P : [(¬ p ∨ q) ∧ (r → s) ∧ (p ∨ r)] → (¬ s → q)
E

propositional logic Q : [(¬ p ∧ q) ∧ [q → ( p → r)]] → ¬ r

F 1 : P ⇒ ¬P R : [[(q ∧ r) → p] ∧ (¬q ∨ p)] → r
F 2 : (P ⇒ ¬P ) ∨ (¬P ⇒ P )
D

S : [p ∧ (p → r) ∧ (q ∨ ¬r)] → q
Which of the following statements is correct?
Which of the above arguments are valid?
(a) F1 is satisfiable, F2 is valid
(a) P and Q only (b) P and R only
A

(b) F1 is unsatisfiable, F2 is satisfiable

(c) P and S only (d) P, Q, R and S
(c) F1 is unsatisfiable, F2 is valid
[GATE-2004]
[GATE-2004]
(d) F1 and F2 are both satisfiable
M

[GA TE-2001]
[GATE-2001] Q.49 What is the first order predicate calculus
statement equivalent to the following? Every
Q.45 “If X then Y unless Z” is represented by which
teacher is liked by some student
of the following formulas in propositional logic?
(a) ∀(x) [teacher (x) → ∃(y ) [student (y ) → likes
(“¬” is negative, “∧” is conjunction, and “→” is
( y, x)]]
implication)
(b) ∀(x) [teacher (x) → ∃(y ) [student (y ) ∧ likes
(a) (X ∧ ¬Z) → Y (b) (X ∧ Y) → ¬Z
( y, x)]]
(c) X → (Y ∧ ¬Z) (d) (X → Y) ∧ ¬Z
(c) ∃( y ) ∀(x) [teacher (x) → [student ( y ) ∧ likes
[GA TE-2002]
[GATE-2002]
( y, x)]]
Q.46 Which of the following is a valid first order (d) ∀(x) [teacher (x) ∧ ∃ ( y ) [student ( y ) → likes
formula? (Here α and β are first order formulae ( y, x)]]
with x as their only free variable) [GA TE-2005]
[GATE-2005]

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

Q.50 Let P (x) and Q(x) be arbitrary predicates. Which (a) (∀x fsa(x) ⇒ (∃y pda( y) ∧ equivalent (x, y))
of the following statements is always TRUE? (b) ~∀y (∃x fsa(x) ⇒ pda( y) ∧ equivalent (x, y))
(a) (∀x(P(x) ∨ Q( x))) ⇒ ((∀xP( x)) ∨ (∀xQ( x))) (c) ∀x ∃y (fsa(x) ∧ pda( y) ∧ equivalent (x, y))

© 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.
(b) (∀x(P ( x) ⇒ Q( x))) ⇒ ((∀xP ( x)) ⇒ (∀xQ( x))) (d) ∀x ∃y (fsa(y) ∧ pda(x) ∧ equivalent (x, y))
[GA TE-2008]
[GATE-2008]
(c) (∀x(P(x) ⇒ (∀xQ(x)))) ⇒ (∀x(P(x) ⇒ Q(x)))
(d) ((∀x(P ( x)) ⇔ (∀xQ( x))) ⇒ (∀x(P ( x) ⇔ Q( x))) Q.54 Which of the following first order formulae is
logically valid? Here α(x) is a first order formula
[IT-2005]
[IT-2005]
with x as a free variable, and β is a first order
Q.51 A logical binary relation , is defined as follows: formula with no free variable.
A B A B (a) [β → (∃x , α ( x ))] → [ ∀x , β → α( x )]
True True True (b) [ ∃x , β → α( x )] → [β → ( ∀x , α( x ))]

Y
True False True (c) [( ∃x , α( x )) → β] → [ ∀x , α( x ) → β]
False True False (d) [( ∀x , α( x )) → β ] → [ ∀x , α( x ) → β ]
False False True

S
[IT-2008]
[IT-2008]

Let ~ be the unary negation (NOT) operator, with Q.55 Which of the following is the negation of
higher precedence, than . Which one of the [(∀ x α → (∃y β → (∀u ∃v γ))]
following is equivalent to A ∧ B?
(a) (~ A  B) (b) ~ (A  ~ B) A (a) [∃ x α → (∀y β → (∃u ∀v γ))]
(b) [∃x α → (∀y β → (∃u ∀v ¬γ))]
E
(c) ~ (~ A  ~ B) (d) ~ (~ A  B) (c) [∀x ¬α → (∃y ¬β → (∀u ∃v ¬γ))]
[GATE-2006]
[GATE-2006]
(d) [∀x α ∧ (∃y β ∧ (∃u ∀v ¬γ))]
Q.52 Let Graph (x) be a predicate which denotes that [IT-2008]
[IT-2008]
E

x is a graph. Let Connected (x) be a predicate

Q.56 Suppose the predicate F (x, y, t ) is used to
which denotes that x is connected. Which of represent the statement that person x can fool
the following first order logic sentences DOES
D

person y at time t. Which one of the statements

NOT represent the statement; “Not every graph below expresses best the meaning of the
is connected”? formula ∀x∃y ∃t (¬ F (x, y, t))?
(a) ¬ ∀x (Graph(x) ⇒ Connected (x))
A

(a) Everyone can fool some person at some

(b) ∃x (Graph(x) ∧ ¬ Connected (x)) time
(c) ¬ ∀x (¬ Graph(x) ∨ Connected (x)) (b) No one can fool everyone all the time
M

(d) ∀x (Graph(x) ⇒ ¬ Connected (x)) (c) Everyone cannot fool some person all the
[GA TE-2007]
[GATE-2007] time
(d) No one can fool some person at some time
Q.53 Let fsa and pda be two predicates such that
[GA TE-2010]
[GATE-2010]
fsa(x) means x is a finite state automaton, and
pda(y) means, that y is a pushdown automaton. Q.57 What is the correct translation of the following
Let equivalent be another predicate such that statement into mathematical logic?
equivalent (a, b) means a and b are equivalent. “Some real numbers are rational”
Which of the following first order logic statement (a) ∃x (real (x) ∨ rational (x))
represents the following: (b) ∀x (real (x) → rational (x))
(c) ∃x (real (x) ∧ rational (x))
Each finite state automaton has an equivalent
(d) ∃x (rational (x) → real (x))
pushdown automaton.
[GA TE-2012]
[GATE-2012]

www.madeeasypublications.org © Copyright
 Workbook 9

Q.58 What is the logical translation of the following (c) ∃d (~Rainy (d ) → Cold (d ))
statements? (d) ∃d (Rainy (d )∧ ~ Cold (d ))
“None of my friends are perfect” [GA TE-2014 (Set-3)]
[GATE-2014

© 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.
(a) ∃x (F (x) ∧ ¬P (x)) (b) ∃x (¬F (x) ∧ P (x))
(c) ∃x (¬F (x) ∧ ¬ P (x)) (d) ¬∃x (F (x) ∧ P (x)) Q.63 The binary operator ≠ is defined by the following
[GA TE-2013]
[GATE-2013] truth table.

p q p ≠q
Q.59 Consider the statement:
0 0 0
“ Not all that glitters is gold”
0 1 1
Predicate glitters(x) is true if x glitters and 1 0 1
predicate gold(x) is true if x is gold. Which one 1 1 0
of the following logical formulae represents the
Which one of the following is true about the

Y
above statement?
binary operator ≠ ?
(a) ∀x : glitters( x) ⇒ ¬gold( x) (a) Both commutative and associative
(b) ∀x : gold( x) ⇒ glitters( x) (b) Commutative but not associative

S
(c) ∃x : gold( x) ∧ ¬glitters( x) (c) Not commutative but associative
(d) ∃x : glitters( x) ∧ ¬gold( x) (d) Neither commutative nor associative
[GA TE-2014 (Set-1)]
[GATE-2014

Q.60 Which one of the following propositional logic

formulas is TRUE when exactly two of p, q and A [GA TE-2015 (Set-1)]
[GATE-2015

Q.64 Consider the following two statements:

S1 : If a candidate is known to be corrupt, then
E
r are TRUE
TRUE? he will not be elected.
(a) ((p ↔ q) ∧ r ) ∨ (p ∧ q ∧ ~ r ) S2 : If a candidate is kind, he will be elected.
(b) (~ (p ↔ q) ∧ r ) ∨ (p ∧ q ∧ ~ r ) Which one of the following statements follows
E

(c) ((p → q) ∧ r ) ∨ (p ∧ q ∧ ~ r ) from S1 and S2 as per sound inference rules of

(d) (~ (p ↔ q) ∧ r ) ∧ (p ∧ q ∧ ~ r ) logic?
[GA TE-2014 (Set-1)]
[GATE-2014 (a) If a person is known to be corrupt, he is
D

kind
Q.61 Consider the following statements: (b) If a person is not known to be corrupt, he is
P : Good mobile phones are not cheap not kind
A

Q : Cheap mobile phones are not good (c) If a person is kind, he is not known to be
L : P implies Q corrupt
M : Q implies P (d) If a person is not kind, he is not known to be
M

N : P is equivalent to Q corrupt
Which one of the following about L, M and N is [GA TE-2015 (Set-2)]
[GATE-2015
CORRECT
CORRECT?
(a) Only L is TRUE Q.65 Which one of the following well formed formulae
(b) Only M is TRUE is a tautology?
(c) Only N is TRUE (a) ∀x ∃y R ( x, y ) ↔ ∃y ∀x R ( x, y )
(d) L, M and N are TRUE (b) (∀x [∃y R ( x, y ) → S ( x, y )]) → ∀x ∃y S ( x, y )
[GATE-2014 (Set-3)]
[GATE-2014 (c) [∀x ∃y (P(x, y ) → R(x , y ))]
Q.62 The CORRECT formula for the sentence, “not ↔ [∀x ∃y (¬P(x, y ) ∨ R(x, y ))]
all rainy days are cold” is (d) ∀x ∀y P ( x, y ) → ∀x ∀y P (y , x)
(a) ∀d (Rainy (d )∧~Cold (d ))
[GATE-2015 (Set-2)]
[GATE-2015
(b) ∀d (~Rainy (d ) → Cold (d ))

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

Q.66 Which one of the following well-formed formulae Q.71 Consider the first order predicate formula ϕ:
in predicate calculus is NOT valid? ∀x[(∀z z⏐x ⇒ ((z = x) ∨ (z = 1))) ⇒ ∃w (w > x)
(a) (∀x p( x) ⇒ ∀x q( x)) ⇒ (∃x ¬ p( x) ∨ ∀x q( x)) ∧ (∀z z⏐w ⇒ ((w = z ) ∨ (z = 1)))]

© 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.
(b) (∃x p( x) ∨ ∃x q ( x)) ⇒ ∃x(p( x) ∨ q( x)) Here ‘a⏐b’ denotes that ‘a divides b’, where a
(c) ∃x (p( x) ∧ q ( x)) ⇒ (∃x p( x) ∧ ∃x q ( x)) and b are integers. Consider the following sets:
(d) ∀x (p( x) ∨ q( x)) ⇒ (∀x p( x) ∨ ∀x q ( x)) S 1 : {1, 2, 3, ..., 100}
[GA TE-2016 (Set-2)]
[GATE-2016 S2 : Set of all positive integers
Q.67 Consider the first-order logic sentence S3 : Set of all integers
F : ∀x(∃yR ( x, y )) . Assuming non-empty logical Which of the above sets satisfy ϕ?
domains, which of the sentences below are (a) S1 and S3 (b) S2 and S3
implied by F ? (c) S1, S2 and S3 (d) S1 and S2

Y
I. ∃y (∃x R ( x, y )) II. ∃y(∀x R ( x, y )) [GATE-2019]
[GATE-2019]
III. ∀y (∃x R ( x, y )) IV.. ¬∃x(∀y ¬ R ( x, y ))
IV
Q.72 Which one of the following is true for the following

S
(a) IV only (b) I and IV only
propositional logic formula?
(c) II only (d) II and III only
(P ⇒ Q) ⇒ [(R ∨ P) ⇒ (R ∨ Q)]
[GATE-2017 (Set-1)]
[GATE-2017

Q.68 Let p, q and r be propositions and the expression

( p → q ) → r be a contradiction. Then, the A (a) Tautology
(c) Satisfiable
(b) Inconsistent
(d) Unsatisfiable
[JNU]
E
expression (r → p) → q is
Q.73 Which one of the following inferences is logically
(a) A tautology
correct?
(b) A contradiction
(a) If it is a clear day then humidity is normally
(c) Always TRUE when p is FALSE
and if humidity is normal then children can
E

(d) Always TRUE when q is TRUE

play outdoors therefore if children can play
[GATE-2017 (Set-1)]
[GATE-2017 outdoors then it is a clear day
D

Q.69 Let p, q, r denote the statements “It is raining”, (b) If it is a clear day then humidity is normal
“It is cold”, and “It is pleasant”, respectively. and on a given day it is clear therefore
Then the statement “It is not raining and it is humidity is normal
A

pleasant, and it is not pleasant only if it is (c) If it is a clear day then humidity is normal
raining and it is cold” is represented by and given that humidity is not normal on a
(a) (¬ p ∧ r ) ∧ (¬ r → (p ∧ q)) particular day therefore it is not a clear day
M

(b) (¬ p ∧ r ) ∧ ((p ∧ q) → ¬r ) (d) If it is a clear day and if humidity is normal

then children can play outdoors therefore
(c) (¬ p ∧ r ) ∨ ((p ∧ q) → ¬r )
children can play outdoors
(d) (¬ p ∧ r ) ∨ (r → (p ∧ q))
[JNU]
[GATE-2017 (Set-2)]
[GATE-2017
Q.74 The negation of the statement
Q.70 The statement (¬ p ) ⇒ (¬ q ) is logically ∀x ∃y ( p (x, y) → q(x, y )) is
equivalent to which of the statements below?
(a) ∀x ∃y (¬p (x, y ) → q(x, y))
I. p ⇒ q II. q ⇒ p
III. (¬ q) ∨ p IV.. (¬ p) ∨ q
IV (b) ∀x ∃y (¬p (x, y ) → ¬q(x, y))
(c) ∃x ∀y ¬(p (x, y ) → q(x, y))
(a) I only (b) I and IV only
(c) II only (d) II and III only (d) ∃x ∀y (¬p(x, y ) → q(x, y))
[GA TE-2017]
[GATE-2017] [JNU]

www.madeeasypublications.org © Copyright
 Workbook 11

Q.75 Any set of Boolean operators that is sufficient (c) ∀x ∃y ∀z (B(x, y ) ∧ ((z ≠ y ) → ¬ B (x, z)))
to represent all Boolean expressions is said to (d) None of the above
be complete. Which of the following is not [JNU]

© 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.
complete?
(a) {AND, NOT} (b) {NOT, OR} Q.79 Identify the false statement:
(c) {AND, OR} (d) {NAND} (a) Let Q (x, y ) denote “x + y = 0”. The truth
[JNU] value of the quantification ∃y ∀x Q (x, y ) is
Q.76 Consider the following WFFs true
1. ∀x Purple (x) ∧ Mushroom (x) → (b) The statements ¬∃x ∀y P (x, y ) and ∀x ∃y
Poisonous (x) ¬ P (x, y ) have the same truth value
2. ∀x Purple (x) → (Mushroom (x) → (c) ¬ (P ∨ (¬ P ∧ Q )) and ¬ P ∧ ¬ Q are
Poisonous (x)) logically equivalent

Y
3. ∀x Mushroom (x) → (Purple (x) → (d) ∀x ∀y P(x, y ) ⇒ ∃x ∀y P(x, y )
Poisonous (x)) [JNU]

S
Which of the following statements is false?
(a) 1 and 3 are equivalent
(b) 2 and 3 are equivalent
(c) 1, 2 and 3 are not equivalent
(d) 1 and 2 are equivalent
A T1. The proposition [(p ∧ q) → (p ∨ q )] ∨ ~ p ∨ q is
E
[JNU] (a) a tautology
Q.77 Consider the following WFFs (Well Formed (b) satisfiable but not tautology
Formulas) (c) a contradiction
1. ∀x Purple (x) ∧ Mushroom (x) ⇒ (d) None of the above
E

Poisonous (x) [Ans: (a)]

2. ∀x Purple (x) ⇒ (Mushroom (x) ⇒ T2. Consider the following predicate statements:
D

Poisonous (x)) P1 : ¬∀x¬ (P(x) → ∃y Q(y ))

3. ∀x Mushroom (x) ⇒ (Purple (x) ⇒
P2 : ∃x (¬P(x) ∨ ∃y Q(y ))
Poisonous (x))
P3 : ∃x (¬∃yQ(y ) → ¬P(x))
A

How many of the above WFFs is logically

P4 : ¬∀x (P(x) ∧ ¬ ∃y Q(y ))
equivalent to the statement, ‘All purple
Which of the above predicates are equivalent
M

mushrooms are poisonous’?

to the predicate statement:
(a) 3 (b) 2
∃x (P(x) → ∃y Q(y ))
(c) 1 (d) 0
(a) P1, P2, P3 (b) P1, P3, P2
[JNU]
(c) P2, P3, P4 (d) All of these
Q.78 Let B(x, y ) be the statement ‘y is the best friend [Ans: (d)]
of x’ and let z be a person other than y . Then
T3. Which one of the first order predicate calculus
the logical expression of the statement
statements given below correctly expresses the
‘Everyone has exactly one best friend’ will be following English statement? (Domain consists
equal to of all people; F (x) : x is a female, M (x, y) : x is
(a) ∀x ∀y ∀z (B(x, y ) ∧ ((z ≠ y ) → ¬ B(x, z))) mother of y, P (x) : x is a parent).
“If a person is female and is a parent, then this
(b) ∀x ∃y ∀z (B(x, z ) ∧ ((z ≠ y ) → ¬ B (x, y)))
person is someone’s mother”

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

(a) ∃x ((F ( x) ∧ P ( x) ) → ∀y M ( x, y ) ) T8. Which of the following is not correct.

(a) ~(∀x) (∃y ) P(x, y) ≡ (∃x) (∀y) [~P(x, y)]
(b) ∀x ∃y ((F ( x) ∧ P ( x) ) → M ( x, y ) )
(b) ~(∀x) P(x) ≡ ∃x [~P(x)]

© 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.
(c) ∀x ((F ( x) ∨ P ( x) ) → ∃y M ( x, y ) )
(c) ~(∃x) (∀y) [P(x, y) ∨ Q(x, y)] ≡ (∀x) (∃y)
(d) ∀x ∃y ((F ( x) ∨ P ( x) ) → M ( x, y ) ) [~P(x, y ) ∧ ~Q (x, y)]
[Ans: (b)]
(d) None of these
T4. Identify the contrapositive for the following [Ans: (d)]
statement. “If a real number is greater than 2,
then its square is greater than 4.” T9. The predicate statement
(a) ∀x ∈ R, if x > 4 then x < 2
2 ¬∀z [P(z) → (¬ Q(z) → P (z))] is _______
(b) ∀x∈ R, if x2 ≤ 4 then x ≤ 2 (a) Satisfiable (b) Tautology
(c) Contradiction (d) None of the above

Y
(c) ∀x∈ R, if x ≤ 2 then x2 ≤ 4
[Ans: (c)]
(d) None of these
[Ans: (b)] T10. Which of the following statement is not correct?

S
(a) Every valid propositional formula is
T5. Find the predicate logic for the following
statement. There are atmost two apples. satisfiable
(a) ∀x ∀y ((Apple ( x) ∧ Apple (y )) → (x = y ∨ y = x))
(b) ∃x ∃y (Apple ( x) ∧ Apple (y ) ∧ x ≠
y ∧ ∀z (Apple (z ) → (z = x ∨ z = y ))) A (b) Every satisfiable is not tautology
(c) Every contradiction is not satisfiable
(d) None of the above
E
(c) ∀x ∀y ∀z ((Apple ( x) ∧ Apple (y ) ∧ Apple (z )) → [Ans: (b)]
(x = y ∨ x = z ∨ y = z )) T11. Match the following Lists:
(d) None of these
List-I
[Ans: (c)]
E

A. There are atmost two apples

T6. Consider the following logical inferences B. There are exactly two apples
I1 : If Socrates is human, then Socrates is mortal.
D

C. There is atmost one apple

Socrates is human.
D. There is exactly one apple
Inference: Socrates is mortal.
I2 : If it rains today, MADE EASY will close. List-II
A

MADE EASY is not closed today. 1. ∀x ∀y ∀z ((Apple (x) ∧ Apple (y) ∧ Apple
Infer ence: It will not rain today.
Inference: (z)) → (x = y ∨ x = z ∨ y = z))
∀x ∀ y ((Apple (x) ∧ Apple ( y )) →
M

Which of the following is true? 2.

(a) Both I1 and I2 are correct inferences. (x = y ∨ y = x))
(b) I1 is correct but I2 is not a correct inference. 3. ∃x ∃y (Apple (x) ∧ Apple (y) ∧ (x ≠ y) ∧ ∀z
(c) I1 is not correct but I2 is a correct inference. (Apple (z) → ((z = x) ∨ (z = y))))
(d) Both I1 and I2 are not correct inferences. 4. ∃x (Apple (x) ∧ ∀y (Apple (y) → (x = y)))
[Ans: (a)] Codes:
T7. Which of the following is/are tautology? A B C D
(a) (p → q) → (q → p) (a) 1 2 3 4
(b) ~(p → q) → ~q (b) 3 2 1 4
(c) (p → q) ↔ (~q → ~p) (c) 1 3 2 4
(d) Both (b) and (c) (d) 3 1 2 4
[Ans: (d)] [Ans: (c)]

www.madeeasypublications.org © Copyright
 Workbook 13

T12. Consider the following statement over the (c) (p ∧ ¬ r ∧ ¬ s) ∨ (¬ q ∧ ¬ r ∧ ¬ s)

domain of natural number. (d) None of these
[Ans: (b)]
“No prime number except 7 is divisible by 7”

© 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.
Find the equivalent predicate logic for the above T16. Consider the following statements:
statement. P1 : ∃x ∃y (x ≠ y ∧ ∀z (Apple (z) ↔ ((z = x)
(a) ∀x∈N[x≠7∧Prime (x)→(¬Divisible by 7 (x))] ∨ (z = y)))

(b) ¬∃x∈N[x ≠ 7∧Prime (x)∧Divisible by 7 (x)] P2 : ∃x ∃y (Apple(x) ∧ Apple (y) ∧ x ≠ y) ∧ ∀ x

∀ y ∀ z ((Apple(x) ∧ Apple (y) ∧ Apple (z))
(c) Both (a) and (b)
→ (x = y ∨ x = z ∨ y = z))
(d) None of these
P3 : ∃x ∃y (Apple (x) ∧ Apple ( y) ∧ (x ≠ y )
[Ans: (c)]
∧ ∀z (Apple (z) → (z = x) ∨ (z = y)))

Y
T13. Match the following Lists: Which of the predicate logic statements represent
List-I the following statement.
A. Everybody loves Mahesh “there are exactly two apples”.

S
B. Everybody loves somebody (a) P1 and P2 only (b) P1 and P3 only
C. There is somebody whom everybody loves (c) P2 and P3 only (d) P1, P2 and P3
D. There is somebody whom no one loves

1.
List-II
∀x Loves (x, Mahesh) A [Ans: (d)]

T17. Consider the following predicates for the domain

of real numbers
E
2. ∀x ∃y Loves (x, y)
P (x, y) : x > y
3. ∃y ∀x Loves (x, y)
Q (x, y) : x ≤ y
4. ∃y ∀x ¬ Loves (x, y)
R (x) : x – 7 = 2
Codes:
E

A B C D S (x) : x > 9
(a) 1 2 3 4 Which of the following proposition gives the
D

(b) 1 3 2 4 False as the truth value?

(c) 1 4 3 2 (a) ∃x R (x) ∨ ∀y [~ S( y)]
(d) 1 2 4 3 (b) ∀x ∃y P (x,y)
A

[Ans: (a)] (c) ∀x ∃y [P (x, y) ∨ Q (x, y)]

(d) None of these
T14. Which of the following predicate arguments is
[Ans: (d)]
M

valid?
(a) ∀x P (x) → ∀x[ P (x) ∨ Q (x)] T18. Let p, q, r, s represent the following propositions.
(b) ∃x ∃ y P (x, y ) → ∃ y ∃x P (x, y ) p : x ∈ {8, 9, 10, 11, 12}
(c) ∃x [R(x) ∨ S(x)] → ∃x R(x) ∨ ∃x S(x) q : x is a composite number
(d) All of these r : x is a perfect square
[Ans: (d)] s : x is a prime number
T15. Consider the following formula: The integer x ≥ 2 which satisfies
¬ (¬ p ∨ q) ∨ (r → ¬ s) ¬ ((p ⇒ q) ∧ (¬ r ∨ ¬s)) is ________.
Which of the following is equivalent to the above [GATE-2016, Ans: (11)]
[GATE-2016,
CNF formula?
(a) (p ∧ ¬ r ∨ ¬ s) ∧ (¬ q ∨ ¬ r ∧ ¬ s) „„„„
(b) (p ∨ ¬ r ∨ ¬ s) ∧ (¬ q ∨ ¬ r ∨ ¬ s)

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

Q.6 A candidate is required to answer 7 out of 12

© 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.
questions, which are divided in to two groups,
each containing 6 questions. He is not permitted

Y
to attempt more than 5 questions from either
Q.1 In how many ways can seven girls be seated at group. In how many different ways can he choose
a round table so that two particular girls are the 7 questions?

S
separated? (a) 180 (b) 210
(a) 120 (b) 260 (c) 600 (d) 780

Q.2
(c) 320
(e) 560
(d) 480

A team of 11 is to be selected out of 14 players A Q.7

(e) 792

Consider the three places Hyderabad, Nanded

and Nagapur. If there are 3 routes from
E
of whom 5 are bowlers. Find the number of ways Hyderabad to Nanded and 2 from Nanded to
in which this can be done so as to include at Nagapur in how many different ways can a
least 4 bowlers. person travel from Hyderabad to Nagapur via
(a) 264 (b) 180 Nanded?
E

(c) 84 (d) 50 (a) 1 (b) 3

(e) 17 (c) 2 (d) 5
D

(e) 6
Q.3 How many odd number having four digits and
with no repeated digits can be formed from Q.8 A lock contains three rings, each ring containing
{1, 2, 3, 4, 5, 6, 7, 8, 9}? four letters. If the lock opens in only one
A

(a) 1860 (b) 1680 arrangement of three letters, how many

(c) 8610 (d) 6801 unsuccessful events are possible?
(e) 1068 (a) 144 (b) 63
M

(c) 24 (d) 121

Q.4 The m th term of an A.P. is n and the n th term is
(e) 17
m. The (m + n)th term would be
(a) m (b) n Q.9 Find the number of ways in which 8 boys and
(c) (m + n) (d) (m – n) 6 girls are to sit for a lunch at a round table so
(e) zero that no two girls are to sit together.
Q.5 The n th term of a series is given to be (a) 7! 8P6 (b) 8! 6!
(3 + n)/4. Find the sum of 105 terms of this (c) 8! 8C6 (d) 7!
series. (e) 8!
(a) 1575 (b) 2730 Q.10 In how many different ways can 8 different shirts
(c) 1470 (d) 2835 be distributed among 4 different people so that
(e) 5460 each receives 2 shirts?

www.madeeasypublications.org © Copyright
 Workbook 15

(a) 2850 (b) 2680 (a) n 2 (b) 2n

2
(c) 2520 (d) 1908 (c) 2n (d) None of these
(e) 1800 [GA TE-1999]
[GATE-1999]

© 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.
Q.11 If the sum of first n terms of an A.P. is 2n2 + 3n, Q.17 The number of binary strings of n zeroes and k
then n th term is ones that no two ones are adjacent is
(a) n (b) n + 1 (a) n – 1Ck (b) nCk
(c) 2n + 1 (d) 3n + 1 n
(c) Ck + 1 (d) None of these
(e) 4n + 1 [GA TE-1999]
[GATE-1999]

Q.12 In a football championship, 153 matches were Q.18 Two girls have picked 10 lilies, 15 sunflowers
played. Every two teams played one match with and 14 daffodils. What is the number of ways
each other. The number of teams participating they can divide the flowers amongst

Y
in the championship is themselves?
(a) 15 (b) 16 (a) 1638 (b) 2100
(c) 17 (d) 18 (c) 2640 (d) None of these

S
(e) 19 [GA TE-1999]
[GATE-1999]

Q.13 A bag contains 10 white balls and 15 black balls. Q.19 The minimum number of cards to be dealt from
Two balls are drawn in succession. The probability
that one of them is black and the other is white
is A an arbitrarily shuffled deck of 52 cards to
guarantee that three cards are from some same
suit is
E
2 4 (a) 3 (b) 8
(a) (b)
3 5 (c) 9 (d) 12
1 1 [GATE-2000]
[GATE-2000]
(c) (d)
3
E

2 Q.20 How many 4 digit even numbers have all 4 digits

[GATE-1995]
[GATE-1995] distinct?
Q.14 The number of functions from an m elements (a) 2240 (b) 2296
D

set to an n element set is (c) 2620 (d) 4536

(a) m + n (b) m n [GA TE-2001]
[GATE-2001]
(c) n m (d) m * n
A

Q.21 The solution to the recurrence equation

[GATE-1998]
[GATE-1998] T (2k) = 3T (2k – 1) + 1,
Q.15 In a room containing 28 people, there are T (1) = 1 is
M

18 people who speak English, 15 people who (a) 2k (b) (3k + 1 – 1)/2
log
(c) 3 2 k (d) 2log3k
speak Hindi and 22 people who speak Kannada.
9 persons speak both English and Hindi, [GA TE-2002]
[GATE-2002]
11 persons speak both Hindi and Kannada
Q.22 Let A be a sequence of 8 distinct integers sorted
whereas 13 persons speak both Kannada and
in ascending order. How many distinct pairs of
English. How many people speak all three
sequences, B and C are there such that (i) each
languages?
is sorted in ascending order, (ii) B has 5 and C
(a) 9 (b) 8
has 3 elements, and (iii) the result of merging B
(c) 7 (d) 6
and C gives A?
[GATE-1998]
[GATE-1998]
(a) 2 (b) 30
Q.16 The number of binary relations on a set with n (c) 56 (d) 256
elements is [GA TE-2003]
[GATE-2003]

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

Q.23 n couples are invited to a party with the condition ∞

that every husband should be accompanied by 28. Let G(x) = 1/(1 – x)2 = ∑ g(i)xi where ⏐x⏐ < 1.
his wife. However, a wife need not be i=0
What is g(i)?

© 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.
accompanied by her husband. The number of (a) i (b) i + 1
different gatherings possible at the party is (c) 2i (d) 2i
⎛ 2n ⎞ n [GATE-2005]
[GATE-2005]
(a) ⎜ ⎟ * 2 (b) 3n
⎝n ⎠ Common Data for Q. 29 & Q.
Q.29 Q.3030
(2n)! ⎛ 2n ⎞ Suppose that a robot is placed on the Cartesian plane.
(c) (d) ⎜ ⎟
2n ⎝n ⎠ At each step it is allowed to move either one unit up or
one unit right, i.e., if it is at (i, j ) then it can move to
[GATE-2003]
[GATE-2003]
either (i + 1, j ) or (i, j + 1).
Q.24 Mala has a colouring book in which each English

Y
Q.29 How many distinct paths are there for the robot
letter is drawn two times. She wants to paint
to reach the point (10, 10) starting from the initial
each of these 52 prints with one of k colours,
position (0, 0)?
such that the colour-pairs used to colour any

S
⎛ 20 ⎞
two letters are different. Both prints of a letter can (a) ⎜ ⎟ (b) 220
also be coloured with the same colour. What is the ⎝ 10 ⎠
(c) 210 (d) None of these
minimum value of k that satisfies this requirement?
(a) 9
(c) 7
(b) 8
(d) 6 A [GA TE-2007]
[GATE-2007]

Q.30 Suppose that the robot is not allowed to traverse

E
[GA TE-2004]
[GATE-2004] the line segment from (4, 4) to (5, 4). With this
Q.25 In how many ways can we distribute 5 distinct constraint, how many distinct paths are there
balls, B1, B2,..., B5 in 5 distinct cells, C1, C2, for the robot to reach (10, 10) starting from (0, 0)?
(a) 29 (b) 219
E

..., C5 such that Ball Bi is not in cell Ci , ∀i = 1,

⎛ 8 ⎞ ⎛11⎞ ⎛ 20 ⎞ ⎛ 8 ⎞ ⎛ 11⎞
2,..., 5 and each cell contains exactly one ball? (c) ⎜ ⎟ × ⎜ ⎟ (d) ⎜ ⎟ − ⎜ ⎟ × ⎜ ⎟
(a) 44 (b) 96 ⎝4⎠ ⎝ 5 ⎠ ⎝ 10 ⎠ ⎝ 4 ⎠ ⎝ 5 ⎠
D

[GA TE-2007]
[GATE-2007]
(c) 120 (d) 3125
[IT -2004]
[IT-2004] Q.31 The exponent of 11 in the prime factorization of
A

300! is
Q.26 Let n = p2q, where p and q are distinct prime
(a) 27 (b) 28
numbers. How many numbers m satisfy (c) 29 (d) 30
1 ≤ m ≤ n and gcd (m, n) = 1? Note that gcd (m, n)
M

[IT-2008]
[IT-2008]
is the greatest common divisor of m and n.
(a) p(q – 1) (b) pq Q.32 In how many ways can b blue balls and r red
2
(c) (p –1)(q – 1) (d) p(p – 1)(q – 1) balls be distributed in n distinct boxes?
[IT-2005]
[IT-2005] (n + b − 1)!(n + r − 1)!
(a)
(n − 1)! b !(n − 1)! r !
Q.27 What is the minimum number of ordered pairs
(n + (b + r ) − 1)!
of non-negative numbers that should be chosen (b)
(n − 1)!(n − 1)! (b + r )!
to ensure that there are two pairs (a, b) and (c, d ) in
the chosen set such that a ≡ c mod 3 and b ≡ d n!
(c)
mod 5 b! r !
(a) 4 (b) 6 (n + b + r ) − 1)!
(d)
(c) 16 (d) 24 n ! (b + r − 1)
[GA TE-2005]
[GATE-2005] [GATE-2008]
[GATE-2008]

www.madeeasypublications.org © Copyright
 Workbook 17

Q.33 Let an be the number of n-bit strings that do (a) A only (b) B only
NOT contain two consecutive 1’s. Which one of (c) A and B (d) Neither
the following is the recurrence relation for an? [JNU]

© 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.
(a) an = an – 1 + 2an – 2
(b) an = an – 1 + an – 2 Q.39 The following finite automaton recognizes a set
(c) an = 2an – 1 + an – 2 of strings of length 6. What is the total number
(d) an = 2an – 1 + 2an – 2 of strings in the set?

[GATE-2016 (Set-1)]
[GATE-2016
Q.34 Which one of the following is a closed form x y z
expression for the generating function of the c c c c
sequence {an}, where an = 2n + 3 for all n = 0,
1, 2, .....? x y z

Y
3 3x b b b b
(a) (b)
(1 − x ) 2
(1 − x )2
x y z

S
2−x 3−x
(c) (d) a a a a
(1 − x )2 (1 − x )2
[GA

many bunches of a half-dozen roses can be

TE-2018]
[GATE-2018]

Q.35 A florist sells roses of five different colours. How

A (a) 18
x y

(b) 16
z
E
formed? (c) 32 (d) None of these
(a) 196 (b) 210 [JNU]
(c) 236 (d) 300
Q.40 Consider the following recurrence relation
[JNU]
E

S(k) – 10 S(k – 1) + 9 S(k – 2) = 0, with the initial

Q.36 Evaluate the sum 1 × 3 + 2 × 4 + 3 × 5 +......upto conditions S(0) = 3, S(1) = 11.
n terms The solution of the recurrence relation is
D

n(n + 1)(2n + 7) n(n + 1) (a) 1 + 2k + 9k – 1 (b) 3 + 8k

(a) (b)
6 3 (c) 2 +9k (d) 1 + 3k + 11k – 1
A

n (2n + 1)
2 [JNU]
(c) n 2 (n + 1)2 (d)
6 Q.41 The maximum number of distinct subwords of
[JNU]
the word AXIOMATIZABLE is
M

Q.37 The number of ways, the numbers 1 to 15 are (a) 183 (b) 111
assigned to 25 squares of 5 by 5 grid having (c) 92 (d) 88
10 squares empty, is [JNU]
(a) 25! (b) 15!
Q.42 Suppose the population of a colony of ants
25! 25! doubles every six months successively. If a
(c) (d)
15! 10! colony is established with an initial population
[JNU] of 37 ants, how many ants will the colony have
after 5 years?
(2n)! (2n)! (a) 9475 (b) 21439
Q.38 Let A = , n ≥ 1, B = , n ≥ 1 which (c) 37888 (d) None of these
2
(n!) 2! (2!)n n!
[JNU]
of these is always an integer?

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

Q.43 The number of positive integral solutions of Q.51 Find the largest integer value of x satisfying the
x + y + z + t = 20 is inequality 10Cx – 1 < 2(10Cx ).
(a) 19C2 (b) 19C3 Q.52 A group consists of 4 women and 7 men. In

© 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.
(c) 18C3 (d) 18C2 how many ways can a team of 5 members be
[JNU] selected when the team has atleast 3 women?
Q.44 Let A be a finite non-empty set with cardinality Q.53 Find the number of seven digit integers with sum
n. The number of subsets S ⊆ A having odd of the digits equal to 11 and formed by using
cardinality is the digits 1, 2 and 3 only.
(a) n (b) 2n /2
Q.54 Find the number of odd integers between 1000
(c) 2n – 1 (d) None of these and 9999 have distinct digits.
[JNU]

Y
Q.55 Find the number of ways 4 fruits can be chosen
Q.45 How many routes are there from the lower-left out of 8 fruits so as to exclude the largest fruit.
corner of an 8 × 8 square-grid to the upper-right
Q.56 A pennant is a sequence of numbers, each

S
corner if we are restricted to travelling only to
number being 1 or 2. An n-pennant is a sequence
the right or upwards?
of numbers with sum equal to n. For example,
(a) 64 (b) 12870
(c) 12800 (d) 512
[JNU]
A (1,1,2) is a 4-pennants. The set of all possible
1-pennant is {(1)}, the set of all possible
2-pennants is {(2), (1,1)} and the set of all
E
Q.46 How many bit strings of length eight either start 3-pennants is {(2,1), (1,1,1), (1,2)}. Note that the
pennant (1,2) is not the same as the pennant
with a 1 bit or end with the two bits 00?
(2,1). The number of 10-pennants is ________.
(a) 128 (b) 160
[GATE-2014 (Set-1)]
[GATE-2014
(c) 174 (d) None of these
E

[JNU] Q.57 The number of distinct positive integral factors

of 2014 is ________.
Q.47 How many positive integers not exceeding 1000
D

[GA TE-2014 (Set-2)]

[GATE-2014
are divisible by 7 or 11?
99
1
(a) 192 (b) 216 Q.58 ∑ x( x + 1) = _________.
(c) 220 (d) 228 x =1
A

[GATE-2015 (Set-1)]
[GATE-2015
[JNU]
Q.59 Let an represent the number of bit strings of
length n containing two consecutive 1s. What
M

is the recurrence relation for an?

(a) an – 2 + an – 1 + 2n – 2
(b) an – 2 + 2an – 1 + 2n – 2
Q.48 Compute the coefficient value of x3 y 2 z in the
(c) 2an – 2 + an – 1 + 2n – 2
(2x – y + 3z)6
(d) 2an – 2 + 2an – 1 + 2n – 2
Q.49 Suppose the group of twelve consists of 5 men [GATE-2015 (Set-1)]
[GATE-2015
and 7 women. How many five-person teams
Q.60 The number of divisors of 2100 is _________.
contain atleast one man?
[GATE-2015 (Set-2)]
[GATE-2015
Q.50 How many number of 5 letter words that use Q.61 The coefficient of x12 in (x3 + x4 + x5 + x6 +...)3 is
letters from the 3 letter set {a, b, c} in which ________.
each letter occurs at least once? [GA TE-2016 (Set-1)]
[GATE-2016

www.madeeasypublications.org © Copyright
 Workbook 19

Q.62 Consider the recurrence relation a1 = 8, an = T5. How many solutions are there of x + y + z = 17
6n2 + 2n + an – 1. Let a99 = K × 104. The value of in positive integers?
K is _________. (a) 120 (b) 171

© 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.
[GA TE-2016 (Set-1)]
[GATE-2016 (c) 180 (d) 221
Q.63 If the ordinary generating function of a [Ans: (a)]
1+ z
sequence {an }n∞=0 is , then a3 – a0 is T6. A set of mn objects can be partitioned into ‘m’
3
(1 − z ) sets of size ‘n ’ in _________ different ways.
equal to _________. m! (mn)!
[GATE-2017]
[GATE-2017] (a) (b)
(n !)m (n !)m m !
(mn)!
(c) (d) None of these

Y
(n !)m
[Ans: (b)]
T1. The number of ways of arranging the letters

S
T7. Solve the following recurrence relation.
GGGGGAAATTTECCS in a row when no two T’s T (n) = 3 T (n – 1) + 2n, n > 0 and T (0) = 1
are together is
(a) 3n + 1 – 2n + 1 (b) 3n – 2n
(a)
12!
5!3!2!
15!
× 13 P3

13!
(b)
12!

15!
×
P3
5!3!2! 3!
13

A (c) 3n + 1 – 2n (d) 3n + 1 + 2n
[Ans: (a)]
E
(c) − (d) − 3! T8. There are 65 questions and each question can
5!3!2! 5!3!2! 5!3!3!2!
[Ans: (b)] be answered with any one of four choices. Find
the number of ways, in which they can be
n ⎛n⎞
∑ ⎜k ⎟ answered.
E

T2. (–1)k . 3n – k = ________.

k =0⎝ ⎠ (a) 65 (b) 654
(a) 1 (b) 2n (c) 465 (d) None of these
D

(c) 4n (d) None of these [Ans: (c)]

[Ans: (b)]
T9. Solve the following recurrence relation.
A

T3. In an examination of 9 papers a candidate has T (n) = 10.T (n – 1) – 25 T (n – 2); if n > 1

to pass in more papers than the number of = 5; if n = 0 or n = 1
papers in which he fails in order to be successful. (a) 5n + 2n5n (b) 5n + 1 – 2n5n
M

The number of ways in which he can be (c) 5 n + 1 – 4n5n (d) 5n – 2n5n

unsuccessful is _________.
[Ans: (c)]
9! 9!
(a) +1 (b) −1 T10. The coefficient of x12 in (x3 + x4 + x5 + x6 +...)3 is
2 2
(c) 28 (d) 28 – 1 ________.
[Ans: (c)] [GA TE-2016, Ans: (10)]
[GATE-2016,

T4. Consider the following recurrence relation T (n) „„„„

– 4T (n – 1) + 3T (n – 2) = 0, T(0) = 0, T(1) = 2.
What is the solution of T (n)?
(a) 3n + 4n (b) 3n – 1
(c) 4n – 1 (d) None of these
[Ans: (b)]

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

(d) not more than one of the sets Si can be infinite

© 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.
(e) None of the above
[GA TE-1993]
[GATE-1993]

Y
Q.1 Let A be a finite set of size n. The number of Q.5 Some group (G, ο) is known to be abelian. Then,
which one of the following is true for G?

S
elements in the power set A × A is
(a) 22
n
(b) 2n
2 (a) g = g –1 for every g ∈ G
(c) (2n)
2
(d) (22)
n (b) g = g 2 for every g ∈ G
(c) (g οh)2 = g 2 οh2 for every g, h ∈ G
(e) None of the above
[GA TE-1993]
[GATE-1993]
A (d) G is of finite order
[GA TE-1994]
[GATE-1994]
E
Q.2 The less-than relation, <, on reals is
(a) a partial ordering since it is asymmetric and Q.6 Let R be a symmetric and transitive relation on
reflexive a set A. Then
(b) a partial ordering since it is antisymmetric (a) R is reflexive and hence an equivalence
relation
E

and reflexive
(c) not a partial ordering because it is not (b) R is reflexive and hence a partial order
asymmetric and not reflexive (c) R is reflexive and hence not an equivalence
D

(d) not a partial ordering because it is not relation

antisymmetric and reflexive (d) None of the above
(e) None of the above [GA TE-1995]
[GATE-1995]
A

[GATE-1993]
[GATE-1993] Q.7 The number of elements in the power set P(S)
Q.3 Let A and B be sets with cardinalities m and n of the set S = {(φ), 1, (2, 3)} is
M

respectively. The number of one-one mappings (a) 2 (b) 4

(injections) from A to B, when m < n, is (c) 8 (d) None of these
(a) mn (b) nPm [GA TE-1995]
[GATE-1995]
m
(c) Cn (d) nCm Q.8 Let A and B be sets and let Ac and Bc denote
(e) mPn the complements of the sets A and B. The set
[GA TE-1993]
[GATE-1993] (A – B) ∪ (B – A) ∪ (A ∩ B) is equal to
Q.4 Let S be an infinite set and S1 ..., Sn be sets (a) A ∪ B (b) Ac ∪ Bc
such that S1 ∪ S2 ∪ ... ∪ Sn = S. Then, (c) A ∩ B (d) Ac ∩ Bc
(a) at least one of the set Si is a finite set [GA TE-1996]
[GATE-1996]
(b) not more than one of the sets Si can be Q.9 Let X = {2, 3, 6, 12, 24}, Let ≤ be the partial
finite order defined by X ≤ Y iff X / Y. The number of
(c) at least one of the sets Si is an infinite set edges in the Hasse diagram of (X, ≤) is

www.madeeasypublications.org © Copyright
 Workbook 21

(a) 3 (b) 4 Q.14 Which one of the following is false?

(c) 9 (d) None of these (a) The set of all bijective functions on a finite
[GA TE-1996]
[GATE-1996] set forms a group under function composition

© 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.
(b) The set {1, 2 ..., p – 1} forms a group under
Q.10 Suppose X and Y are sets and ⏐X⏐ and ⏐Y⏐
are their respective cardinalities. It is given that multiplication mod p where p is a prime
there are exactly 97 functions from X to Y. From number
this one can conclude that (c) The set of all strings over a finite alphabet
(a) ⏐X⏐ = 1, ⏐Y⏐ = 97 forms a group under concatenation
(b) ⏐X⏐ = 97, ⏐Y⏐ = 1 (d) A subset s ≠ φ of G is a subgroup of the
(c) ⏐X⏐ = 97, ⏐Y⏐ = 97 group <G, *> if and only if, for any pair of
(d) None of the above elements a, b ∈ s, a * b–1 ∈ s
[GA TE-1996]
[GATE-1996]

Y
[GA TE-1996]
[GATE-1996]

Q.11 Which of the following statements is false? Q.15 Let ∗ be defined as x ∗ y = x + y. Let z = x ∗ y.
(a) The set of rational numbers is an Abelian Value of z ∗ x is

S
group under addition (a) x + y (b) x
(b) The set of integers is an Abelian group under
(c) 0 (d) 1
addition
(c) The set of rational numbers form an Abelian
group under multiplication
A [GATE-1997]
[GATE-1997]

Q.16 Let (Z, ∗) be an algebraic structure, where Z is

E
(d) The set of real numbers excluding zero in the set of integers and the operation ∗ is defined
an Abelian group under multiplication by n ∗ m = maximum (n, m). Which of the
[GA TE-1996]
[GATE-1996] following statements is true for (Z, ∗)?
Q.12 Let R denotes the set of real numbers. Let (a) (Z, ∗) is a monoid
E

f : R × R → R × R be a bijective function defined (b) (Z, ∗) is an Abelian group

by f (x, y ) = (x + y, x – y ). The inverse function (c) (Z, ∗) is a group
D

of f is given by (d) None of the above

[GA TE-1997]
[GATE-1997]
⎛ 1 1 ⎞
(a) f –1 (x, y ) = ⎜ , ⎟
⎝x+y x−y ⎠ Q.17 In the lattice defined by the Hasse diagram
A

given in following Figure, how many complements

(b) f –1 (x, y ) = (x – y, x + y )
does the element ‘e ’ have?
⎛x+y x−y ⎞
M

(c) f –1 (x, y ) = ⎜ , ⎟ a
⎝ 2 2 ⎠
(d) f –1 (x, y ) = [2(x – y), 2(x + y)] b c
[GATE-1996]
[GATE-1996]
g
Q.13 Let R be a non-empty relation on a collection of
sets defined by A R B if and only if A ∩ B = φ.
e d
Then, (pick the true statement)
(a) R is reflexive and transitive f
(b) R is symmetric and not transitive
(a) 2 (b) 3
(c) R is an equivalence relation
(c) 0 (d) 1
(d) R is not reflexive and not symmetric
[GATE-1997]
[GATE-1997]
[GATE-1996]
[GATE-1996]

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

Q.18 The number of equivalence relations of the set elements a, b ∈ L let the least upper bound lub
{1, 2, 3, 4} is (a, b) and the greatest lower bound glb (a, b)
(a) 15 (b) 16 exist. Which of the following is/are true?

© 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.
(c) 24 (d) 4 (a) L is a poset
[GA TE-1997]
[GATE-1997] (b) L is a Boolean algebra
(c) L is a lattice
Q.19 A partial order ≤ is defined on the set S = {x, a1,
(d) None of the above
a2, ... an, y} as x ≤ ai for all i and ai ≤ y for all i, [GA TE-1999]
[GATE-1999]
where n ≥ 1. The number of total orders on the
set S which contain the partial order ≤ is Q.24 A relation R is defined on the set of integers as
(a) n! (b) n + 2 x Ry iff (x + y ) is even. Which of the following
(c) n (d) 1 statements is true?

Y
[GA TE-1997]
[GATE-1997] (a) R is not an equivalence relation
(b) R is an equivalence relation having
Q.20 Suppose A is a finite set with n elements. The 1 equivalence class

S
number of elements in thelargest equivalence (c) R is an equivalence relation having
relation of A is 2 equivalence classes
(a) n (b) n2 (d) R is an equivalence relation having
(c) 1 (d) n + 1
[GA TE-1998]
[GATE-1998]
A 3 equivalence classes
[GA TE-2000]
[GATE-2000]
E
Q.21 Let R1 and R2 be two equivalence relations on a Q.25 Let P(S) denotes the power set of set S. Which
set. Consider the following assertions: of the following is always true?
1. R1 ∪ R2 is an equivalence relation (a) P(P(S)) = P(S) (b) P(S) ∩ P(P(S)) = {φ}
(c) P(S) ∩ S = P(S) (d) S ∉ P(S)
2. R2 ∩ R2 is an equivalence relation
E

[GA TE-2000]
[GATE-2000]
Which of the following is correct?
(a) Both assertions are true Q.26 Consider the following relations:
D

(b) Assertion 1 is true but Assertion 2 is not R1 (a, b) iff (a + b) is even over the set of
true integers
(c) Assertion 2 is true but Assertion 1 is not R2 (a, b) iff (a + b) is odd over the set of integers
A

true R3 (a, b) iff a.b > 0 over the set of non-zero

(d) Neither 1 nor 2 is true rational numbers
M

[GATE-1998]
[GATE-1998] R4 (a, b) iff ⏐a – b⏐ ≤ 2 over the set of natural
Q.22 The binary relation R = {(1, 1), (2, 1), (2, 2), numbers
(2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4)} on the Which of the following statements is corrects?
set A = {1, 2, 3, 4} is (a) R1 and R2 are equivalent relations, R3 and
(a) reflexive, symmetric and transitive R4 are not
(b) neither reflexive, nor irreflexive but transitive (b) R1 and R3 are equivalent relations, R2 and
(c) irreflexive, symmetric and transitive R4 are not
(d) irreflexive and antisymmetric (c) R1 and R4 are equivalent relations, R2 and
[GA TE-1998]
[GATE-1998] R3 are not
(d) R1, R 2 , R3 and R4 are all equivalence
Q.23 Let L be a set with a relation R which is transitive, relations
anti-symmetric and reflexive and for any two [GA TE-2001]
[GATE-2001]

www.madeeasypublications.org © Copyright
 Workbook 23

Q.27 Consider the following statements: (c) {(x, y )⏐y < x and x, y ∈ {0, 1, 2, ...}}
S1 : There exist infinite sets A, B, C such that (d) {(x, y )⏐y ≤ x and x, y ∈ {0, 1, 2, ...}}
A ∩ (B ∪ C) is finite. [GA TE-2004]
[GATE-2004]

© 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.
S2 : There exist two irrational numbers x and y
Q.32 In a class of 200 students, 125 students have
such that (x + y ) is rational.
taken Programming Language course,
Which of the following is true about S1 and S2?
85 students have taken Data Structures course,
(a) Only S1 is correct
65 students have taken Computer Organization
(b) Only S2 is correct
course; 50 students have taken both
(c) Both S1 and S2 are correct
Programming Language and Data Structures,
(d) None of S1 and S2 is correct
35 students have taken both Data Structures
[GA TE-2001]
[GATE-2001]
and Computer Organization; 30 students have
Q.28 Let f : A → B be a function, and let E and F be

Y
taken both Programming Language and
subsets of A. Consider the following statements Computer Organization, 15 students have taken
about images. all the three courses. How many students have

S
S1 : f (E ∪ F) = f (E) ∪ f (F) not taken any of the three courses?
S2 : f (E ∩ F) = f (E) ∩ f (E) (a) 15 (b) 20
Which of the following is true about S1 and S2? (c) 25 (d) 30
(a) Only S1 is correct
(b) Only S2 is correct
A [IT-2004]
[IT-2004]

Q.33 Let R1 be a relation from A = {1, 3, 5, 7} to B =

E
(c) Both S1 and S2 are correct
{2, 4, 6, 8} and R2 be another relation from B
(d) None of S1 and S2 is correct
to C = {1, 2, 3, 4} as defined below:
[GA TE-2001]
[GATE-2001]
(i) An element x in A is related to an element y
Q.29 Which of the following is true? in B (under R1) if x + y is divisible by 3.
E

(a) The set of all rational negative numbers (ii) An element x in B is related to an element y
forms a group under multiplication in C (under R2) if x + y is even but not
(b) The set of all non-singular matrices forms a
D

divisible by 3.
group under multiplication Which is the composite relation R2R1 from A
(c) The set of all matrices form a group under to C?
A

multiplication (a) {(1, 2), (1, 4), (3, 3), (5, 4), (7, 3)}
(d) Both (b) and (c) are true (b) {(1, 2), (1, 3), (3, 2), (5, 2), (7, 3)}
[GA TE-2002]
[GATE-2002] (c) {(1, 2), (3, 2), (3, 4), (5, 4), (7, 2)}
M

Q.30 The binary relation S = φ (empty set) on set (d) {(3, 2), (3, 4), (5, 1), (5, 3), (7, 1)}
A = {1, 2, 3} is [IT-2004]
[IT-2004]
(a) Neither reflexive nor symmetric Q.34 The inclusion of which of the following sets into
(b) Symmetric and reflexive S = {{1, 2}, {1,2,3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4,
(c) Transitive and reflexive 5}} is necessary and sufficient to make S a
(d) Transitive and symmetric
complete lattice under the partial order defined
[GA TE-2002]
[GATE-2002]
by set containment?
Q.31 Consider the binary relation: (a) {1}
S = {(x, y )⏐y = x + 1 and x, y ∈ {0, 1, 2, ...}} (b) {1}, {2, 3}
The reflexive transitive closure of S is (c) {1}, {1, 3}
(a) {(x, y )⏐y > x and x, y ∈ {0, 1, 2, ...}} (d) {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5}
(b) {(x, y )⏐y ≥ x and x, y ∈ {0, 1, 2, ...}} [GA TE-2004]
[GATE-2004]

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

Q.35 Let A, B and C be non-empty sets and let (c) 3 does not have an inverse
X = (A – B) – C and Y = (A – C) – (B – C) (d) 8 does not have an inverse
Which one of the following is TRUE? [GATE-2006]
[GATE-2006]

© 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.
(a) X = Y (b) X ⊂ Y
(c) Y ⊂ X (d) None of these Q.41 A relation R is defined on ordered pairs of
[GA TE-2005]
[GATE-2005] integers as follows: (x , y)R(u, v) if x < u and y > v.
Then R is
Q.36 Let f : B → C and g : A → B be two functions (a) Neither a Partial Order nor an Equivalence
and let h = f ο g. Given that h is an onto function. Relation
Which one of the following is TRUE? (b) A Partial Order but not a Total Order
(a) f and g should both be onto functions
(c) A Total Order
(b) f should be onto but g need not be onto
(d) An Equivalence Relation
(c) g should be onto but f not be onto

Y
[GA TE-2006]
[GATE-2006]
(d) Both f and g need not be onto
[GA TE-2005]
[GATE-2005] Q.42 Let S = {1, 2, 3,..., m }, m > 3. Let X 1 ,
X2, ..., Xn be subsets of S each of size 3. Define

S
Q.37 Let A be a set with n elements. Let C be a
a function f from S to the set of natural numbers
collection of distinct subsets of A such that for
any two subsets S1 and S2 in C, either S1 ⊂ S2 or as, f (i) is the number of sets Xj that contains
the element i. That is f (i) = ⎪{ j |i ∈ X j}⎪.
S2 ⊂ S1. What is the maximum cardinality of C?
(a) n
(c) 2n – 1 +1
(b) n +1
(d) n! A Then
m
Σ f (i) is
i =1
E
[IT-2005]
[IT-2005] (a) 3m (b) 3n
(c) 2m + 1 (d) 2n + 1
Q.38 For the set N of natural numbers and a binary
[GATE-2006]
[GATE-2006]
operation f : N × N → N, an element z ∈ N is
E

called an identity for f, if f (a, z ) = a = f (z, a), Q.43 Consider the set S = {a, b, c, d}. Consider the
for all a ∈ N. Which of the following binary following 4 partitions π1, π2, π3, π4, on
operations have a identity?
S : π1 = {abcd}, π2 {ab,cd}, π3 = {abc, d},
D

I. f (x, y ) = x + y – 3
II. f (x, y ) = max(x, y ) π4 = {a,b,c,d}
III. f (x, y ) = x y
Let ≺ be the partial order on the set of
A

(a) I and II only (b) II and III only

partitions S′ = (π1, π2, π3, π4) defined as follows:
(c) I and III only (d) None of these
πi ≺ πj if and only if πi refines πj. The poset
[IT-2006]
[IT-2006]
diagram for (S′, ≺) is
M

Q.39 Let, X, Y, Z be sets of sizes x, y and z π1

π1
respectively. Let W = X × Y and E be the set of
π2
all subsets of W. The number of functions from
(a) (b) π2 π4
Z to E is π3
(a) z (b) z × 2 x y
π4 π3
(c) 2 z (d) 2 x yz
[GATE-2006]
[GATE-2006] π1 π1 π2 π3

Q.40 The set {1, 2, 3, 5, 7, 8, 9} under multiplication

(c) π2 π3 (d)
modulo 10 is not a group. Given below are four
possible reasons. Which one of them is false?
(a) It is not closed π4 π4
(b) 2 does not have an inverse [GATE-2007]
[GATE-2007]

www.madeeasypublications.org © Copyright
 Workbook 25

Q.44 If P, Q, R are subsets of the universal set x g(h(x))

Q.48 If g (x) = 1 – x and h( x) = , then is
U, then (P ∩ Q ∩ R) ∪ (Pc ∩ Q ∩ R) ∪ Qc ∪ Rc x −1 h(g(x))
is
h(x) −1

© 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.
(a) Qc ∪ Rc (b) P ∪ Qc ∪ Rc (a) (b)
g(x) x
(c) Pc ∪ Qc ∪ Rc (d) U
[GA TE-2008]
[GATE-2008] g(x) x
(c) (d)
h(x) (1 − x)2
Q.45 How many onto (or surjective) functions are there
[GATE-2015 (Set-1)]
[GATE-2015
from an n-element (n ≥ 2) set to a 2-element
set? Q.49 For a set A, the power set of A is denoted by
(a) 2n (b) 2n – 1 2A. If A = {5, {6}, {7}}, which of the following
(c) 2n – 2 (d) 2(2n – 2) options are True?

Y
[GA TE-2012]
[GATE-2012] 1. ∅ ∈ 2A
Q.46 Let X and Y be finite sets and f : X → Y be a 2. ∅ ⊆ 2A
function. Which one of the following statements 3. {5,{6}} ∈ 2A

S
is TRUE? 4. {5,{6}} ⊆ 2A
(a) 1 and 3 only (b) 2 and 3 only
(a) For any subsets A and B of X,
f (A ∪ B) = f (A) + f (B)
(b) For any subsets A and B of X, A (c) 1, 2 and 3 only (d) 1, 2 and 4 only
[GATE-2015 (Set-1)]
[GATE-2015
E
f (A ∩ B) = f (A) ∩ f (B) Q.50 Suppose U is the power set of the set S = {1,
2, 3, 4, 5, 6}. For any T ∈ U, let ⏐T ⏐ denote
(c) For any subsets A and B of X,
the number of elements in T and T ′ denote the
f (A ∩ B) = min{ f (A) , f (B) } complement of T. For any T, R ∈ U, let T \ R
E

(d) For any subsets S and T of Y, be the set of all elements in T which are not
f −1(S ∩ T ) = f −1(S) ∩ f −1(T ) in R. Which one of the following is true?
D

[GATE-2014 (Set-3)]
[GATE-2014 (a) ∀X ∈ U (| X | = | X ′ |)
(b) ∃X ∈ U ∃Y ∈ U (| X | = 5,| Y | = 5
Q.47 Consider the set of all functions f : {0,1, ...,
and X ∩ Y = ∅)
A

2014} → {0,1, ...,2014} such that f ( f (i)) = i, for

(c) ∀X ∈ U ∀Y ∈ U (| X | = 2,| Y | = 3
all 0 ≤ i ≤ 2014. Consider the following
statements: and X \ Y = ∅)
M

(d) ∀X ∈ U ∀Y ∈ U (X \ Y = Y ′ \ X ′)
P : For each such function it must be the case
[GATE-2015 (Set-3)]
[GATE-2015
that for every i , f (i) = i .
Q : For each such function it must be the case Q.51 Let R be a relation on the set of ordered pairs
that for some i , f (i) = i. of positive integers such that ((p, q), (r, s)) ∈
R : Each such function must be onto. R if and only if p – s = q – r. Which one of the
Which one of the following is CORRECT? following is true about R?
(a) P, Q and R are true (a) Both reflexive and symmetric
(b) Only Q and R are true (b) Reflexive but not symmetric
(c) Only P and Q are true (c) Not reflexive but symmetric
(d) Only R is true (d) Neither reflexive nor symmetric
[GATE-2014
[GA TE-2014 (Set-3)] [GATE-2015
[GA TE-2015 (Set-3)]

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

Q.52 A binary relation R on N × N is defined as s

follows: (a, b) R (c, d ) if a ≤ c or b ≤ d. Consider
the following propositions:

© 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.
a t
P : R is reflexive Q : R is transitive
Which one of the following statements is TRUE?
(a) Both P and Q are true n d
(b) P is true and Q are false (a) s ≺ t ≺ a ≺ n ≺ d (b) s ≺ a ≺ n ≺ t ≺ d
(c) P is false and Q are true (c) n ≺ a ≺ d ≺ t ≺ s (d) n ≺ d ≺ a ≺ t ≺ s
(a) Both P and Q are false [JNU]
[GATE-2016 (Set-2)]
[GATE-2016
Q.57 Let AG denote the adjacency matrix of a graph
Q.53 Let N be the set of natural numbers. Consider G. Let AGk + 1 = AGk ⋅ AG, where ‘⋅’ is matrix

Y
the following sets: multiplication operator. For the following graph
P. Set of Rational numbers (positive and G and the following statement with blanks,
negative). select the correct option to correspond the

S
Q. Set of functions from {0, 1} to N. blanks:
R. Set of functions from N to {0, 1}. 1 2 3
S. Set of finite subsets of N.
Which of the sets above are countable?
(a) Q and S only (b) P and S only
A 6 5 4
E
(c) P and R only (d) P, Q and S only
Statement: The (3, 5)th element in AG 2 is
[GATE-2018]
[GATE-2018]
________, which denotes the number of paths
Q.54 Let G be an arbitrary group. Consider the of length ________.
E

following relations on G : (a) 3, 2 (b) 2, 2

R 1 : ∀a, b ∈ G,a R1 b if and only if ∃g∈G such (c) 2, 3 (d) 3, 3
that a = g –1bg [JNU]
D

R 2 : ∀a, b ∈ G,a R2 b if and only if a = b –1 Q.58 Let A = {1, 2, 3, 4, 5, 6}. Given that set A is a
Which of the above is/are equivalence relation/ group with respect to multiplication mod 7. Is A
relations?
A

a cyclic group? If yes, identify its generator.

(a) R1 and R2 (b) R1 only (a) Yes, and generators are 1, 3, 5
(c) R2 only (d) Neither R1 nor R2 (b) Yes, and generators are 3 and 6
M

[2019 : 1 Mark] (c) Yes, and the generators are 3 and 5

(d) No, A is not a cyclic group
Q.55 Which of the following is not a Boolean algebra? [JNU]
(a) D40 (b) D66
(c) D210 (d) D646 Q.59 Which of the following statements is false?
[JNU] (a) The set of rational numbers is an Abelian
group under addition
Q.56 Consider the following Hasse diagram in which (b) The set of integers is an Abelian group under
the labels of the nodes are used only for addition
reference. Labels s, a, t , n and d are the (c) The set of rational numbers forms an Abelian
elements (contents) of the poset (A, ≺) group under multiplication
represented by the following Hasse diagram. (d) The set of real numbers excluding zero is
What is the result of topological sorting of the an Abelian group under multiplication
poset A? [JNU]

www.madeeasypublications.org © Copyright
 Workbook 27

1 1 1 1 1 (a) {(1), (2, 3), (4), (5)} and {(1, 2, 3), (4, 5)}
Q.60 The sum + + + + (b) {(1, 2, 3), (4, 5)} and {(1, 2), (3), (4, 5)}
1! 9! 3! 7! 5! 5! 7! 3! 9!1!
(c) {(1, 2), (3, 4), (5)} and {(1, 2), (3, 4), (5)}

© 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.
2a (d) {(1, 2, 3, 4, 5)} and {(1), (2), (3), (4), (5)}
can be written in the form where a and b are
b! [JNU]
positive integers. The ordered pair (a, b) is
Q.64 A ‘chain’ is a
(a) (10, 9) (b) (9, 10)
(a) Totally ordered set
(c) (7, 9) (d) (9, 7)
(b) Partially ordered set
[JNU]
(c) Well-ordered set
Q.61 Let A be adjacency matrix of a graph G. Then (d) None of the above
aK (i, j ), the (i, j )th entry in matrix AK gives [JNU]

Y
number of paths of length K from vi to vj .
Q.65 From the following two diagrams 1 and 2,
⎡0 0 0 1⎤ determine
⎢1 0 1 1⎥⎥

S
If A = ⎢ what will be the value of
⎢1 0 0 1⎥
⎢ ⎥
⎣⎢0 0 1 0 ⎦⎥
A3 ?
⎡0
⎢1
0 1 0⎤
0 1 2 ⎥⎥
⎡1
⎢1
0 0 1⎤
0 2 2 ⎥⎥
A 1 2
E
(a) ⎢ (b) ⎢
⎢0 0 1 1⎥ ⎢1 0 1 1⎥
⎢ ⎥ ⎢ ⎥ (a) Both 1 and 2 are lattice
⎢⎣ 1 0 0 1⎥⎦ ⎢⎣0 0 1 1⎥⎦ (b) 1 is poset and 2 is lattice
(c) 1 is lattice and 2 is poset
E

⎡1 0 1 0⎤ ⎡1 0 0 1⎤
⎢1 ⎢1 0 0 2 ⎥⎥
0 0 2 ⎥⎥
(d) Both 1 and 2 are poset not lattice
(c) ⎢ (d) ⎢ [JNU]
⎢1 0 1 1⎥ ⎢1 0 1 1⎥
D

⎢ ⎥ ⎢ ⎥
⎢⎣0 0 1 0 ⎥⎦ ⎣⎢0 0 1 1⎦⎥
⎡a b ⎤
[JNU] Q.66 The set of 2 into 2 matrices of the form ⎢ ⎥
⎣0 0 ⎦
A

Q.62 If R be an equivalence relation on the set with the operation multiplication of matrices is a
A = {6, 7, 8, 9, 10} defined by R = {(6, 6), (7, 7), (a) group
(8, 8), (9, 9), (10, 10), (6, 7), (7, 6), (8, 9), (9, 8),
M

(b) abelian group

(9, 10), (10, 9) (8, 10), (10, 8)}, its partitions are
(c) monoid but not group
(a) {{6}, {7}, {8, 9}, {10}} (d) semigroup but not monoid
(b) {{6, 7, 8}, {9, 10}} [JNU]
(c) {{6}, {7, 8}, {9, 10}}
Q.67 The following statement S holds for any Boolean
(d) {{6, 7}, {8, 9, 10}}
algebra [B; ¬, ∨, ∧] S : (a ∧ b) = a if a ≤ b.
[JNU]
Find the dual, S*, of the statement S
Q.63 Over the set A = {1, 2, 3, 4, 5} two partitions a (a) S * : (a ∧ b) = a if a ≤ b
and b are defined as = {{1, 2, 3}, {4}, {5}} and (b) S * : (a ∨ b) = a if a ≤ b
b = {{1}, {2, 3}, {4, 5}}. The MEET and JOIN (under (c) S * : (a ∧ b) = a if a ≥ b
refinement relation between partitions) are (d) S * : (a ∨ b) = a if a ≥ b
respectively [JNU]

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

Q.68 Let the relation R be defined as, x R y iff (i) g8 = e (ii) g2 ≠ e

y = x + 2 and the relation S as, x Sy iff x ≤ y. The (iii) Order of g is not 8.
relation RS on {1, 3, 5} is Find the order of g.

© 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.
(a) {(1,1), (1,3), (1,5)} (b) {(1,3), (1,5), (3,5)}
Q.74 Let S denote the set of all functions
(c) {(1,3), (3,5), (5,7)} (d) {(1,3), (3,5)}
f : {0, 1}4 → {0, 1} . Denote by N the number of
[JNU]
functions from S to the set {0, 1}. The value of
Q.69 Let A be a set and S be any subset of A consider log2 log2N is __________.
the function Cs : A → {0, 1} as defined below: [GA TE-2014 (Set-1)]
[GATE-2014
⎧0 if x ∈ S
Cs ( x) = ⎨ Q.75 Let G be a group with 15 elements. Let L be a
⎩ 1 if x ∉ S subgroup of G. It is known that L ≠ G and that
If A = {a, b, c, d } and S = {a, b, d}, when find Cs the size of L is at least 4. The size of L is

Y
(a) Cs = {(a, 1), (b, 1), (c, 0), (d, 1)} ________.
(b) Cs = {(a, 1), (b, 0), (c, 1), (d, 0)} [GA TE-2014 (Set-3)]
[GATE-2014

S
(c) Cs = {(a, 0), (b, 0), (c, 1), (d, 0)} Q.76 The number of onto functions (surjective
(d) Cs = {(a, 0), (b, 1), (c, 0), (d, 1)} functions) from set X = {1, 2, 3, 4} to set
[JNU] Y = {a, b, c} is ________.

A [GATE-2015 (Set-2)]
[GATE-2015

Q.77 Let X and Y denote the sets containing 2 and

E
20 distinct objects respectively and F denote
1 the set of all possible functions defined from X
Q.70 What is the order of the element [1+ i] in and Y. Let f be randomly chosen from F. The
2
probability of f being one-to-one is _________.
E

the non-zero complex numbers under

multiplication? Q.78 The number of integers between 1 and 500
(both inclusive) that are divisible by 3 or 5 or
D

Q.71 Consider the Hasse diagram of a poset given

7 is ________.
below:
[GA TE-2017 (Set-1)]
[GATE-2017
h j
A

Q.79 Let G be a finite group on 84 elements. The

g f
size of a largest possible proper subgroup of
G is ________.
M

d e
[GATE-2018]
[GATE-2018]
b c

a
Find the number of upper bounds of the subset
{a, c, d, f }?
T1. The function f is mapped from natural numbers
Q.72 Let G be a finite group. If A and B are subgroups to integer numbers and f (x) = x2 – 2x + 3.
of G with orders 4 and 5 respectively then Consider N = {0, 1, 2, 3, . . .} and Z = {1 ... , –2,
⎪A ∩ B⎪ = _________. –1, 0, 1, 2, ...}. What is the function f ?
Q.73 Assume g is an element of the group G . (a) Injective function (b) Surjective function
Consider the following conditions of g with e as (c) Bijective function (d) None of these
identity element. [Ans: (d)]

www.madeeasypublications.org © Copyright
 Workbook 29

T2. Which of the following set is uncountable. T8. Consider a relation R = {(x, y )⎪x, y are positive
(a) Set of all natural numbers integers ≤ 4 and (x + y ) ≤ 5}. Which of the
(b) Set of all integers following is true?

© 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.
(c) Set of all positive rational numbers (a) R is reflexive, symmetric and transitive
(d) Set of all real numbers in the interval [0, 1] (b) R is symmetric and transitive
[Ans: (d)] (c) R is antisymmetric and transitive
T3. Let R be a relation over the set of integers, (d) R is symmetric
and (x, y ) ∈ R if and only if |x – y | ≤ 2. Then R is [Ans: (d)]
__________.
T9. Let X = {{}, {a}}. The power set of X is _______.
(a) Reflexive and transitive relation
(a) {{}, {a}}
(b) Reflexive and symmetric relation

Y
(b) {{}, {a}, {{}}, {{}, a}}
(c) Symmetric and transitive relation
(d) Equivalence relation (c) {{}, {{a}}, {{}, a}}
[Ans: (b)] (d) {{}, {{a}}, {{}}, {{}, {a}}}

S
[Ans: (d)]
T4. Let f (x) = (5x + 1)2. Then f –1 (x) = _______.
T10. Find the countable set from the following
(a)

1
x−
1
5
(b)
5 x +1
2
2 A (a) Subset of natural numbers
(b)  × 
(c) Set of positive rational numbers
E
(c) ( x − 1) (d) x+
5 5 (d) All of these
[Ans: (c)] [Ans: (d)]
T5. The set of real numbers denoted by R and * is T11. Identify the correct statement from the following
E

an operation on R, such that x * y = x + y + x y

(a) Commutative property not holds for
for all x, y ∈ R. If S ⊆ R and (S, *) is an abelian
addition of matrices
group then which of the following could be S?
D

(a) R (b) R \ {0} (b) Associative property not holds for addition
(c) R \ {1} (d) R \ {–1} of matrices
(c) Commutative property not holds for
A

[Ans: (d)]
multiplication of matrices
T6. Consider three finite sets A, B and C.
(d) None of the above
Let S1 = ((A ∩ B) – (B ∩ C)) – C and
M

S2 = (A – (A ∩ C))– (A – B). [Ans: (c)]

Sets S1 and S2 are related as T12. A function f : N+ → N+, defined on the set of
(a) S1 ⊂ S2 positive integers N+, satisfies the following
(b) S1 ⊃ S2 properties:
(c) S1 = S2
f (n) = f (n /2) if n is even
(d) None of these
[Ans: (c)] f (n) = f (n + 5) if n is odd

T7. Range of f (x) = 3 + 5 sinx is _______. Let R = {i⎪∃ j : f ( j ) = i} be the set of distinct
(a) [–1, 5] (b) [2, 8] values that f takes. The maximum possible size
(c) [–2, 8] (d) [1, 5] of R is ________.
[Ans: (c)] [GA TE-2016, Ans: (2)]
[GATE-2016,

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

T13. Which of the following lattices are complete T15. Identify the correct statement.
lattices? (a) Every distributive lattice is complemented
lattice.

© 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.
(b) Every complemented lattice is distributive
(a) (b) lattice.
(c) Every complemented lattice is bounded.
(d) Both (b) and (c)
[Ans: (c)]
T16. A binary relation R on N × N is defined as
(c) (d) All of these
follows: (a, b) R (c, d) if a ≤ c or b ≤ d. Consider
the following propositions
[Ans: (d)] P : R is reflexive

Y
Q : R is transitive
T14. Let A, B and C be three sets. Then (A – B) – C
Which one of the following statements is TRUE
TRUE?
= ______.

S
(a) Both P and Q are true
(a) (A – B) – (B – C) (b) (B – C) – (A – C)
(b) P is true and Q is false
(c) (A – B) – (A – C) (d) (A – C) – (B – C)
(c) P is false and Q is true
[Ans: (d)]

A (d) Both P and Q are false

[GA TE-2016, Ans: (b)]
[GATE-2016,
E
„„„„
E
D
A
M

www.madeeasypublications.org © Copyright
 4 Graph Theory

number of components in the resultant graph

© 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.
must necessarily lie between.
(a) k and n (b) k – 1 and k + 1

Y
(c) k – 1 and n – 1 (d) k + 1 and n – k
Q.1 Which of the following graphs is/are planar? [GATE-2003]
[GATE-2003]

S
Q.5 How many perfect matchings are there in a
complete graph of 6 vertices?

A (a) 15
(c) 30
(b) 24
(d) 60
[GATE-2003]
[GATE-2003]
E
G1 G2 G3
Q.6 A Graph G = (V, E ) satisfies ⏐E⏐ ≤ 3 ⏐V⏐ – 6.
(a) G1 only (b) G1 and G2
(c) G2 only (d) G2 and G3 The min-degree of G is defined as min {degree
v ∈V
[GA TE-1988]
[GATE-1988]
E

(v)}. Therefore, min-degree of G cannot be

Q.2 A graph is planar if any only if (a) 3 (b) 4
(a) It does not contain subgraphs (c) 5 (d) 6
D

homeomorphic to K5 and K3, 3

[GA TE-2003]
[GATE-2003]
(b) It does not contain subgraphs isomorphic
to K5 and K3, 3 Q.7 The minimum number of colours required to
A

(c) It does not contain subgraphs isomorphic colour the following graph, such that no two
to K5 or K3, 3 adjacent vertices are assigned the same colour,
(d) It does not contain subgraph homeomorphic is
M

to K5 or K3, 3
[GATE-1990]
[GATE-1990]

Q.3 How many undirected graphs (not necessarily

connected) can be constructed out of a given (a) 2 (b) 3
set V = {v1, v2, ... vn} of n vertices? (c) 4 (d) 5
n(n − 1) [GATE-2004]
[GATE-2004]
(a) (b) 2n
2
Q.8 What is the maximum number of edges in an
(c) n! (d) 2n(n – 1)/2 acyclic undirected graph with n vertices?
[GA TE-2001]
[GATE-2001]
(a) n – 1 (b) n
Q.4 Let G be an arbitrary graph with n nodes and k (c) n + 1 (d) 2n – 1
components. If a vertex is removed from G, the [IT-2004]
[IT-2004]

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

Q.9 What is the number of vertices in an undirected (a) Any k -regular graph where k is an
connected graph with 27 edges, 6 vertices of even number
degree 2, 3 vertices of degree 4 and remaining (b) A complete graph on 90 vertices

© 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.
of degree 3? (c) The complement of a cycle on 25 vertices
(a) 10 (b) 11 (d) None of the above
[GA TE-2007]
[GATE-2007]
(c) 18 (d) 19
[IT 2004]
[IT-2004] Q.15 What is the size of the smallest MIS (Maximal
Independent Set) of a chain of nine nodes?
Q.10 Let G be a simple connected planar graph with
(a) 5 (b) 4
13 vertices and 19 edges. Then, the number of
(c) 3 (d) 2
faces in the planar embedding of the graph is
[IT-2008]
[IT-2008]
(a) 0 (b) 8

Y
(c) 9 (d) 13 Q.16 What is the chromatic number of the following
[GA TE-2005]
[GATE-2005] graph?
Q.11 Which one of the following graphs is

S
NOT planner?

(a) G1: (b) G2:

A (a) 2
(c) 4
(b) 3
(d) 5
E
[IT-2008]
[IT-2008]

Q.17 G is a simple, connected, undirected graph.

(c) G3: (d) G4:
Some vertices of G are of odd degree. Add a
E

node v to G and make it adjacent to each odd

degree vertex of G. The resultant graph is sure
to be
D

[GATE-2005]
[GATE-2005]
(a) Regular (b) Complete
Q.12 If all the edge weights of an undirected graph (c) Hamiltonian (d) Euler
are positive, then any subset of edges that [IT-2008]
[IT-2008]
A

connects all the vertices and has minimum total

Q.18 What is the chromatic number of an n-vertex
weight is a
simple connected graph which does not contain
(a) Hamiltonian cycle (b) Grid
M

(c) Hypercube (d) Tree any odd length cycle? Assume n ≥ 2.

[IT-2006]
[IT-2006] (a) 2 (b) 3
(c) n – 1 (d) n
Q.13 Let G be the non-planar graph with the minimum [GA TE-2009]
[GATE-2009]
possible number of edges. Then G has
(a) 9 edges and 5 vertices Q.19 Which one of the following is TRUE for any
(b) 9 edges and 6 vertices simple connected undirected graph with more
(c) 10 edges and 5 vertices than 2 vertices?
(d) 10 edges and 6 vertices (a) No two vertices have the same degree
[GA TE-2007]
[GATE-2007] (b) At least two vertices have the same degree
(c) At least three vertices have the same degree
Q.14 Which of the following graphs has an Eulerian (d) All vertices have the same degree
circuit? [GATE-2009]
[GATE-2009]

www.madeeasypublications.org © Copyright
 Workbook 33

Q.25 Consider an undirected random graph of eight

Q.20 Let, G = (V, E ) be a graph. Define ξ(G) = ∑ id × d,
Q.20
d vertices. The probability that there is an edge
where id is the number of vertices of degree d

© 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
in G. If S and T are two different trees with ξ(S) between a pair of vertices is . What is the
2
= ξ(T ), then
expected numbers of unordered cycles of length
(a) ⏐S⏐= 2⏐T⏐ (b) ⏐S⏐ = ⏐T⏐ – 1
three?
(c) ⏐S⏐ = ⏐T⏐ (d) ⏐S⏐ = ⏐T⏐ + 1
[GATE-2010]
[GATE-2010] 1
(a) (b) 1
Q.21 The degree sequence of a simple graph is the
Q.21 8
sequence of the degrees of the nodes in the (c) 7 (d) 8
graph in decreasing order. Which of the following [GATE-2013]
[GATE-2013]
sequences can not be the degree sequence of

Y
Q.26 If G is a forest with n-vertices and k connected
any graph?
components, how many edges does G have?
I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2
⎢n ⎥ ⎡n ⎤

S
III. 7, 6, 6, 4, 4, 3, 2, 2 IV
IV.. 8, 7, 7, 6, 4, 2, 1, 1
(a) ⎢ ⎥ (b) ⎢ ⎥
(a) I and II (b) III and IV ⎣k ⎦ ⎢k ⎥
(c) IV only (d) II and IV (c) n – k (d) n – k + 1
[GA

Q.22 Let G be a simple undirected planar graph on

TE-2010]
[GATE-2010]

10 vertices with 15 edges. If G is a connected A [GA TE-2014 (Set-3)]

[GATE-2014

Q.27 Let δ denote the minimum degree of a vertex in

E
a graph. For all planar graphs on n vertices
graph, then the number of bounded faces in with δ ≥ 3 which one of the following is TRUE
TRUE?
any embedding of G on the plane is equal to
(a) In any planar embedding, the number of
(a) 3 (b) 4
n
E

(c) 5 (d) 6 +2
faces is at least
[GA TE-2012]
[GATE-2012] 2
(b) In any planar embedding, the number of
Q.23 Which of the following graphs is isomorphic to
D

n
faces is less than +2
2
(c) There is a planar embedding in which the
A

n
number of faces is less than +2
2
(a) (b) (d) There is a planar embedding in which the
M

n
number of faces is at most
δ +1
(c) (d) [GATE-2014 (Set-3)]
[GATE-2014

Q.28 A graph is self-complementary if it is isomorphic

[GATE-2012]
[GATE-2012] to its complement. For all self-complementary
Q.24 Let G be a complete undirected graph on graphs on n vertices, n is
6 vertices. If vertices of G are labeled, then (a) A multiple of 4
the number of distinct cycles of length 4 in G (b) Even
is equal to
(c) Odd
(a) 15 (b) 30
(d) Congruent to 0 mod 4, or 1 mod 4
(c) 90 (d) 360
[GA TE-2012]
[GATE-2012] [GATE-2015 (Set-2)]
[GATE-2015

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

Q.29 Let G be an undirected complete graph, on Q.35 Euler’s formula v – e + r = 2 is used to test
n vertices, where n > 2. Then, the number of (a) an Euler path in the graph
different Hamiltonian cycles in G is equal to (b) a Hamiltonian path in a graph

© 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.
(a) n ! (b) (n – 1)! (c) planarity of a graph
(d) none of the above
(n − 1)!
(c) 1 (d) [JNU]
2
Q.36 If dmax is the maximum degree of the vertices in
[2019 : 1 Mark]
a graph G, Chromatic number C of G is defined as
Q.30 The diameter and chromatic number of the star (a) C = 1 + dmax (b) C < 1 + dmax
graph (K1, n, n ≥ 2) is (c) C > 1 + dmax (d) C ≤ 1 + dmax
(a) 1, 2 (b) 2, 2 [JNU]
(c) 3, 2 (d) 2, n

Y
Q.37 How many chromatic partition(s) the given graph
Q.31 Which one of the following statements is false? has?
(a) A spanning tree is a tree that contains all

S
v3
edges of a graph
(b) The degree of a vertex in a simple graph is
v1
the number of vertices adjacent to it
(c) A loop is a special case of cycle in which a
single are begins and ends with same node
A v4

v5
v2
E
(d) The adjacency matrix of a directed graph
(a) Three (b) Two
with no cycles must have all diagonal
(c) One (d) Zero
elements as 0’s
[JNU]
[JNU]
E

Q.38 Consider the following statements:

Q.32 A connected multigraph has an Eulerian path (not
1. Every tree with a minimum of three vertices
circuit) if and only if
is 2-colorable.
D

(a) every vertex in it has even degree

2. The complete bipartite graph K3, 3 is non-
(b) every vertex in it has odd degree
planar.
(c) it has one vertex which is of odd degree
3. If e is an edge in a connected graph with
A

(d) it has two vertices which are of odd degree

the smallest weight, then e is an edge in
[JNU]
every minimum spanning tree of the graph.
M

Q.33 In a directed graph, if there is a directed path Which of the statements is true?
from any node u to v or vice versa, for any pair (a) Only 1 and 2 are true
of nodes of the graph, the graph is (b) Only 2 and 3 are true
(a) weakly connected (c) Only 3 and 1 are true
(b) unilaterally connected (d) All statements are true
(c) strongly connected [JNU]
(d) disconnected
[JNU] Q.39 A simple graph with n vertices ( n ≥ 3) is
Hamiltonian if the sum of degrees of every pair
Q.34 What type of graph STAR is? of non-adjacent vertices is at least
(a) Multigraph (b) Bipartite
(a) n (b) n2/3
(c) Tripartite (d) Multipartite
(c) n (d) None of these
[JNU]
[JNU]

www.madeeasypublications.org © Copyright
 Workbook 35

Q.40 Suppose that a connected planar simple graph

G A T E
has 20 vertices, each of degree 3. Into how many
regions does a representation of this planar

© 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.
graph split the plane?
(a) 12 (b) 10
R N K 1
(c) 11 (d) 8
[JNU]
Q.45 Find the matching number for the following graph
Q.41 For the graph G shown in the figure:
G A T E

Y
2 0 1 4
Identify the correct answer. G is a

S
(a) bipartite and regular but not a Hamiltonian
Common Data Q.46 & Q.47:
graph
(b) regular and Hamiltonian but not a bipartite Consider the graph below:
graph
(c) Hamiltonian and bipartite but not a regular
A b c
E
graph
g
(d) regular, bipartite and Hamiltonian graph G: a d
[JNU]

Q.42 A tree has n2 vertices of degree 2, n3 vertices

E

of degree 3, ..., and nk vertices of degree k. f e

How many vertices of degree 1 does it have?
Q.46 What is the chromatic number of G?
D

(a) n2 + 2n4 + 3n5 + ... + (k – 2)nk + 1

(b) n2 + 2n3 + 3n4 + ... + (k – 1)nk Q.47 How many edges are present in complimentary
(c) n3 + 2n4 + 3n5 + ... + (k – 2)nk + 2
graph G of the given graph G?
A

(d) None of the above

[JNU] Q.48 A connected cubic planar graph with no bridges
has exactly 5 edges in boundary of each region.
Q.43 If G is a tree with n vertices, then which of the
M

Find the number of edges of the graph.

following statements is correct?
(a) G is a connected graph Q.49 Find the number of spanning trees for the
(b) G has n – 1 edges following graph.
(c) G is a connected graph with n – 1 edges a b c
(d) None of the above
[JNU]
f e d

Q.50 Consider an undirected graph G where self-

loops are not allowed. The vertex set of G
is {(i, j ) : 1 ≤ i ≤ 12, 1 ≤ j ≤ 12). There is an
Q.44 Find the matching number for the following edge between (a, b) and (c, d ) if ⎪a – c⎪≤ 1
graph. and ⎪b – d⎪≤ 1.

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

The number of edges in this graph is _______.

[GATE-2014 (Set-1)]
[GATE-2014

© 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.
Q.51 The maximum number of edges in a bipartite
graph on 12 vertices is _______.
[GATE-2014 (Set-2)]
[GATE-2014 T1. Let G be a disconnected simple graph with n
Q.52 A cycle on n vertices is isomorphic to its vertices. Find the maximum number of edges
are possible in G.
complement. The value of n is________.
[GATE-2014 (Set-2)]
[GATE-2014 (n − 1)
(a) (b) (n – 1)
2
Q.53 Let G be a connected planar graph with
10 vertices. If the number of edges on each n(n − 1) (n − 1)(n − 2)

Y
(c) (d)
face is three, then the number of edges in G is 2 2
________. [Ans: (d)]
[GATE-2015 (Set-1)]
[GATE-2015

S
T2. Let G be a planar graph such that every face is
Q.54 Consider a binary tree T that has 200 leaf bordered by exactly 3 edges. Which of the
nodes. Then, the number of nodes in T that following can never be the value for χ(G)? [where
have exactly two children are ________.
[GATE-2015 (Set-3)]
[GATE-2015 A χ(G) is chromatic number of G]
(a) 2 (b) 3
E
(c) 4 (d) None of these
Q.55 The minimum number of colours that is sufficient [Ans: (a)]
to vertex-colour any planar graph is ________.
T3. Consider the following graphs:
[GATE-2016 (Set-2)]
[GATE-2016
E

Q.56 Let T be a tree with 10 vertices. The sum of

G1 :
the degrees of all the vertices in T is ________.
D

[GA TE-2017 (Set-1)]

[GATE-2017

Q.57 G is an undirected graph with n vertices and

A

25 edges such that each vertex of G has degree

at least 3. Then the maximum possible value
of n is ________. G2 :
M

[GA TE-2017 (Set-2)]

[GATE-2017

Q.58 The chromatic number of the following graph

is ________.

a e

Identify the correct statement?

c d
(a) Only G1 is Hamiltonian
(b) Only G2 is Hamiltonian
b f
(c) Both G1 and G2 are Hamiltonian
(d) Neither G1 nor G2 is Hamiltonian
[GATE-2018]
[GATE-2018]
[Ans: (a)]

www.madeeasypublications.org © Copyright
 Workbook 37

Linked Answer T4 & T5: T8. Consider the following graph.

a
Let G be a graph with V(G) = {i⎥ 1 ≤ i ≤ 4n, n ≥ 1} where 2

© 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.
V(G) is the set of vertices of G. Such that two numbers f b

x and y in V(G) are adjacent if and only if (x + y ) is a G1 : G2 :

multiple of 4.
e c
T4. Find the number of components in graph G.
d 1 3 4 5 6
(a) 2 (b) 4
(c) n (d) None of these 1 a

[Ans: (d)]
6 2 f b

T5. From the above k components, assume that

Y
G3 : G4 :
each component Ck has mk vertices, then what
5 3 e c
is the maximum value of mk in the graph G?
(a) n (b) 2n

S
4 d
(c) 3n (d) None of these
Which of the above graphs are isomorphic?
[Ans: (b)]
(a) G1 and G2 (b) G3 and G4
T6. Find the number of perfect matchings in a cycle
graph with 2n vertices is ________.
A (c) G1 and G3 (d) G2 and G4
[Ans: (a)]
E
(a) 0 (b) 2
T9. Let G be a planar graph such that every face is
n bordered by exactly three edges. What are the
(c) n (d)
2 possible values for chromatic number of G?
E

[Ans: (b)] (a) Only 3 (b) Only 4

(c) 3 or 4 (d) None of these
T7. Consider the following statements.
[Ans: (c)]
D

Let G be a connected graph of order n where

n ≥ 3. T10. Consider the following statements:

n S1 : The maximum number of edges in a

A

S1 : If d (V) ≥ for each vertex V in G, then G is disconnected simple graph having

2
Hamiltonian. [ d (V) is the degree of a (n − 1)(n − 2)
n-vertices is .
M

vertex V]. 2
S2: If every vertex in G has even degree then S2 : A simple graph G (with n-vertices and
G is eulerian. k-components) is a forest if and only if G
Which of the above statements are correct? has (n – k) edges.
(a) Only S1 (b) Only S2 Find which of the above statements are correct
(c) Both S1 and S2 (d) Neither S1 nor S2
(a) S1 only (b) S2 only
[Ans: (c)]
(c) Both S1 and S2 (d) Neither S1 nor S2
[Ans: (c)]

„„„„

© Copyright www.madeeasypublications.org
 5 Probability & Statistics

Q.4 One shot is fired from each of the three guns,

© 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.
where G1, G2 and G3 denote the events that the

Y
target is hit by the first, second and third guns
respectively. If P(G1) = 0.5, P(G2) = 0.6 and
Q.1 A multiple choice test consists of three P(G3) = 0.8 and G1, G2 and G3 are independent

S
problems. For each problem, there are five of each other. The probability that at least two
choices, one of which is correct. One student hits to be registered is
comes totally unprepared and decides to answer (a) 0.50 (b) 0.55
by sheer guessing. What is the probability that
he will answer at least one problem correctly?
4 61 A (c) 0.60
(e) 0.70
(d) 0.65
E
(a) (b) 3 1 1
5 125 Q.5 If P(A′) = , P(B′) = and P(A ∩ B) =
48 12 8 2 4
(c) (d)
125 125
⎛ B′ ⎞
then the value of P ⎜ ⎟ is
E

1 ⎝ A′ ⎠
(e)
125
(a) 0 (b) 1
D

Q.2 From twenty tickets marked with the first twenty

1 1
numerals, one ticket is drawn at random. What (c) (d)
3 4
is the probability that the numeral marked on it
A

is a multiple of 3 or 5? 1
(e)
1 1 5
(a) (b)
20 10
M

Q.6 A pair of fair dice is thrown. Find the probability

3 9
(c) (d) of getting a sum of 7, when it is known that the
10 20 digit in the first die is greater than that of the
1 second.
(e)
2
5 1
(a) (b)
Q.3 If six fair dice are rolled, what is the probability 12 5
that each of the six numbers will appear exactly
1 5
once? (c) (d)
12 8
(a) 0.0065 (b) 0.0154
(c) 0.0198 (d) 0.0215 7
(e)
(e) 0.0285 10

www.madeeasypublications.org © Copyright
 Workbook 39

Q.7 The manufacturing process of an article consists Q.12 A bin in a hardware store, contains 125 bolts
of two parts A and B. The probabilities of defect and 200 nuts. One-fifth of the bolts and three-
in parts A and B are 8% and 12% respectively. fourth of the nuts are defective. One item is

© 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.
What is the probability that the assembled picked randomly from the bin. What is the
product will not have any defect? (Assume that probability that the item is either a defective
A and B are independent.) item or it is a nut?
(a) 80.9% (b) 76.5% (a) 92.3% (b) 84.6%
(c) 74.02% (d) 70.25% (c) 69.2% (d) 53.8%
(e) 68.57% (e) 38.5%
Q.8 If P(A ∪ B) = 0.6 and P(A ∩ B) = 0.25 then the Q.13 The average deviation of all items in the data
value of P(A) + P(B) is from zero is equal to the

Y
(a) 0.60 (b) 1.93 (a) Arithmetic mean (b) Median
(c) 0.10 (d) 1.15 (c) Mode (d) Standard deviation
(e) 2.32 (e) Variance

S
Q.9 When five coins are tossed, Heads and tails Q.14 A negatively skewed distribution curve tails off
show up on the coins. Find the probability of towards the lower end and for such a curve
showing exactly two heads on the coins.

(a)
1
2
(b)
2
5 A (a) A.M > Median > Mode
(b) A.M < Median < Mode
(c) A.M = Median = Mode
E
(d) A.M = Median < Mode
3 5
(c) (d) (e) A.M > Median = Mode
8 16
7 Q.15 What is the variance of first n natural numbers?
(e)
E

20 (n 2 + 1) (n − 1)
(a) (b)
Q.10 If the occurrence of some events are dependent 12 12
(n 2 − 1) (n 2 − 1)
D

on the occurrence of an event A then the sum of

(c) (d)
all the joint probabilities in which the occurrence 2 12
of event A is considered gives the
(n 2 + 1)
A

(a) Subjective probability of event A (e)

2
(b) Classical probability of event A
(c) Conditional probability of event A Q.16 A football match is played from 9 A.M. to 11 A.M.
M

(d) Marginal probability of event A A boy arrives to see the match (not before the
(e) Relative frequency of occurrence of event A match starts). What is the probability that he
will miss the only goal of the match, which takes
Q.11 If events B and C are dependent on event A place at the 21st minute of the match?
and P(A and B) = 0.30, P(A and C) = 0.20, and (a) 0.126 (b) 0.935
the dependent events B and C are mutually (c) 0.736 (d) 0.825
exclusive and collectively exhaustive, then (e) 0.901
⎛ C⎞ Q.17 The mean of squares of first 23 natural numbers
P⎜ ⎟ is equal to
⎝A⎠ is
(a) 0.20 (b) 0.40 (a) 4324 (b) 188
(c) 0.50 (d) 0.60 (c) 1128 (d) 104
(e) 0.80 (e) 3424

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

Q.18 A die is loaded so that probability of getting joint probabilities of the events that may result
face x is proportional to x. The probability of an from these two experiments are given below:
odd number occurring when the die is rolled A B C

© 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.
would be D 0.12 0.075 0.12
1 2 E 0.28 0.225 0.18
(a) (b)
21 7 Which of the following statements are correct?
3 4 1. P(A) = 0.30 2. P(B) = 0.40
(c) (d) 3. P(C) = 0.30 4. P(D) = 0.685
7 7
5 5. P(E) = 0.685 6. P(D⏐C) = 0.25
(e) 7. P(E⏐B) = 0.75 8. P(D⏐A) = 0.30
7
9. D is independent of the events A, B and C
Q.19 A, B and C are mutually exclusive and respectively.

Y
collectively exhaustive events, resulting from an 10. E is dependent on the events A, B and C
experiment. B is twice as likely as A and C is respectively.
2.5 times as likely as B. Which of the following (a) 1, 4 and 6 above

S
is correct? (b) 4, 6, 7 and 10 above
(a) P(A) = 3%, P(B) = 6% and P(C) = 15% (c) 2, 3, 4, 6 and 9 above
(b) P(A) = 5%, P(B) = 10% and P(C) = 25%
(c) P(A) = 8%, P(B) = 16% and P(C) = 40%
(d) P(A) = 10%, P(B) = 20% and P(C) = 50%
A (d) 3, 5, 7, 8 and 10 above
(e) 1, 2, 4, 6 and 9 above

Q.23 Two computers A and B are to be sold. A

E
(e) P(A) = 12.5%, P(B) = 25% and P(C) = 62.5%
salesman who is assigned the job of selling
Q.20 In a certain town, male and female each from
these has the chances of 60 percent and
60 and 40 percent of the population respectively.
40 percent respectively to get success. The two
It is known that 25 percent of the males and
E

computers may be sold independently. Given

15 percent of the females are unemployed. A
that atleast one computer has been sold, what
research student studying the employment
is the probability that computer A has been sold?
situation selects an unemployed person at
D

(Round off your answer up to the second

random. What is the probability that the person
decimal)
so selected is male?
(a) 0.40 (b) 0.64
A

(a) 0.121 (b) 0.714

(c) 0.79 (d) 0.90
(c) 0.800 (d) 0.485
(e) 0.24
(e) 0.735
M

Q.24 The probability of solving a problem by three

Q.21 Probability of getting a plumbing contract is
0.5. Probability of getting an electrical contract 1 3 2
students X, Y and Z are , and
is 0.3. Probability of getting neither contract is 4 7 9
0.25. What is the probability of getting both respectively. If all of them try independently then
types of contract? the probability that the problem could not be
(a) 60% (b) 75% solved is
(c) 30% (d) 5% 1 1
(e) 85% (a) (b)
3 4
Q.22 Experiment one results in the mutually exclusive 1 2
(c) (d)
and collectively exhaustive events A, B and C. 5 5
Experiment two results in the mutually exclusive 3
(e)
and collectively exhaustive events D and E. The 7

www.madeeasypublications.org © Copyright
 Workbook 41

Q.25 If A is an event, the conditional probability of A Q.29 If A and B are any two events, the probability
given A is equal to that exactly one of them occurs is given by
(a) 0 (b) 0.4 (a) P(A) + P(B) – 2P(AB)

© 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.
(c) 0.5 (d) 0.8 (b) P(A) + P(B) – P(AB)
(e) 1 (c) P(A) + P(B) − 2P(AB)

Q.26 Because a new medical procedure has been (d) P(A) + P(B) − P(AB)
shown to be effective in early detection of an (e) P(AB)
illness, a medical screening of the population
Q.30 Which of the following statements are FALSE?
is proposed. The probability that the test
(a) For Poisson distribution, the mean in twice
correctly identifies someone with the illness as
the variance
positive is 0.99, and the probability that the test
(b) In queuing theory, if arrivals occurs

Y
correctly identifies some one without the illness
according to Poisson distribution, then the
as negative is 0.95. The incidence of illness in
inter-arrival time is exponentially distributed
the general population is 0.0001. You take the

S
(c) If the time between successive arrivals is
test, and the result is positive. What is the exponential, then the time between the
probability that you have the illness? (Round occurrences of every third arrival is also
off your answer upto the third decimal)
(a) 0.002
(c) 0.995
(b) 0.005
(d) 0.998 A exponential
(d) None of these
[GA TE-1988]
[GATE-1988]
E
(e) 0.949
Q.31 Let A and B be any two arbitrary events, then,
Q.27 Two dice are thrown together. What is the which one of the following is true?
probability that the sum of the numbers on the (a) P(A ∩ B) = P(A) P(B)
E

two faces is divisible by 4 or 6? (b) P(A ∪ B) = P(A) + P(B)

1 1 (c) P(A ⏐ B) = P(A ∩ B) P(B)
(a) (b) (d) P(A ∪ B) ≤ P(A) + P(B)
2 3
D

[GATE-1994]
[GATE-1994]
5 7
(c) (d)
12 15 Q.32 The probability that a number selected at random
A

between 100 and 999 (both inclusive) will not

7
(e) contain the digit 7 is
18
3
16 ⎛ 9 ⎞
M

Q.28 Which of the following is most appropriate if (a) (b) ⎜ ⎟

25 ⎝ 10 ⎠
certain events are mutually exclusive and
27 18
collectively exhaustive? (c) (d)
25 25
(a) The sum of the probabilities of the events [GATE-1995]
[GATE-1995]
will be less than 1
Q.33 Two dice are thrown simultaneously. The
(b) The sum of the probability of the events will
probability that at least one of them will have
be more than 1
6 facing up in
(c) The sum of the probabilities of the events
1 1
will be equal to 1 (a) (b)
36 3
(d) Some of the events will be definitely have
25 11
zero probability (c) (d)
36 36
(e) Each of the events has a zero probability
[GATE-1996]
[GATE-1996]

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

Q.34 The probability that top and bottom cards of a 2

randomly shuffled deck are both aces is (a) Pr[E1 or E2] is
3
4 4 4 3 (b) Events E1 and E2 are independent

© 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.
(a) × (b) ×
52 52 52 52 (c) Events E1 and E2 are not independent
4 3 4 4 ⎡E ⎤ 4
(c) × (d) × (d) Pr ⎢ 1 ⎥ =
52 51 52 51
[GA TE-1996]
[GATE-1996] ⎣ E2 ⎦ 5
[GATE-1999]
[GATE-1999]
Q.35 The probability that it will rain today is 0.5. The
probability that it will rain tomorrow is 0.6. The Q.39 E1 and E2 are events in a probability space
probability that it will rain either today or satisfying the following constraints
tomorrow is 0.7. What is the probability that it Pr(E1) = Pr (E2)
Pr(E1 ∪ E2) = 1

Y
will rain today and tomorrow?
(a) 0.3 (b) 0.25 E1 and E2 are independent
(c) 0.35 (d) 0.4 The value of Pr(E1), the probability of the event

S
[GA TE-1997]
[GATE-1997] E1, is
Q.36 A die is rolled three times. The probability that 1
exactly one odd number turns up among the (a) 0 (b)
three outcomes is

(a)
1
(b)
3
A (c)
1
2
(d) 1
4
E
6 8 [GATE-2000]
[GATE-2000]
1 1
(c) (d) Q.40 Seven (distinct) car accidents occurred in a
8 2
week. What is the probability that they all
[GATE-1998]
[GATE-1998]
E

occurred on the same day?

Q.37 Suppose that the expectation of a random 1 1
variable X is 5. Which of the following statements (a) (b)
77 76
D

is true?
(a) There is a sample point at which X has the 1 7
(c) (d)
value 5 27 27
A

(b) There is a sample point at which X has value [GATE-2001]

[GATE-2001]
greater than 5
Q.41 Four fair coins are tossed simultaneously. The
(c) There is a sample point at which X has a
probability that at least one head and one tail
M

value greater than or equal to 5

turn up is
(d) None of the above
[GA TE-1999]
[GATE-1999] 1 1
(a) (b)
Q.38 Consider two events E 1 and E 2 such that 16 8
7 15
1 (c) (d)
probability of E1, Pr [E1] = , probability of E2, 8 16
2
[GATE-2002]
[GATE-2002]
1
Pr [ E2 ] = and probability of E 1 and E2 , Q.42 The tailors in a tailoring shop on an average
3
stitch three shirts in an hour, stitching has a
1
Pr [E1 and E2] = . Which of the following Poisson distribution. During a particular hour,
5
what is the probability that the number of shirts
statements is/are true?
stitched is 5 or more?

www.madeeasypublications.org © Copyright
 Workbook 43

(a) 0.8571 (b) 0.8152 Q.47 Suppose the random variate X has the
(c) 0.1848 (d) 0.1439 probability distribution given below:
[JNU]
x −2 −1 0 1 2

© 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.
Q.43 A coin is biased so that the probability of heads P(X = x) 0.25 0.20 0.15 0.35 0.05
2 Let Y = 2 X 2 + 6. The expected value E (Y ) is
is . What is the probability that exactly four
3 (a) 9.5 (b) 6
(c) 15.5 (d) 18
heads come up when the coin is flipped seven
[JNU]
times, assuming that the flips are independent?
Q.48 A discrete random variate X has pmf P (X = i) =
560 521
(a) (b) C
2281 2187 , i = 1, 2, 3, .... . Find C
i2

Y
509
(c) (d) None of these 1
2013 (a) (b) 0
2
[JNU]

S
6
(c) π2 (d)
Q.44 An electronic gadget has 5 components of which π2
two are of type-1 and the other three are of [JNU]
type-2. Unless all the components are functional
the gadget will not be operative. During some
interval, the probability of failure of each of the A Q.49 A student takes a multiple-choice examination,
where each question has 5 possible answers.
E
components of type-1 is 0.04 and the probability He attempts a question correctly if he knows
of failure of each of the components of type-2 is the answer, otherwise he guesses at random.
0.03. What is the corresponding probability of Suppose he knows answer to 70% of the
failure of the gadget? questions, what is the probability that on a question
E

(a) 15.88% (b) 16.75% chosen at random, the student gets correct answer?
(c) 0.432% (d) 0.956% (a) 0.20 (b) 0.76
[JNU] (c) 0.70 (d) None of the above
D

[JNU]
Q.45 Three pens are randomly drawn without
replacement from a pack of 50 pens of which Q.50 In four tests taken by 450 students, marks are
A

four are defective. The probability that none of found to be normally distributed with mean and
the pens is defective, first one is defective while variance as given below:
the other two are not, and third one is defective
M

Test No. Mean Variance

while the first two are not, respectively are
1 74 121
(a) 75%, 6.62%, 7.19%
(b) 77.44%, 7.04%, 7.04% 2 75 100
(c) 77.86%, 6.77%, 6.62% 3 78 196
(d) 80%, 6.77%, 7.04% 4 82 169
[JNU] A has secured 80 in the first test, 81 in the
Q.46 What is the probability of obtaining at least four second, 86 in the third and 89 in the fourth. In
Heads yet not all Heads while tossing an which test did A actually perform best relative
unbiased coin 7 times? to other students?
(a) 49.2% (b) 40.08% (a) Fourth test (b) Third test
(c) 50.00% (d) 50.78% (c) Second test (d) First test
[JNU] [JNU]

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

Q.51 Suppose the average number of telephone calls Q.54 A die is loaded in such a way that each odd
arriving at the switchboard of an organization is number is twice as likely to occur as each even
30 calls per hour. Determine the probability that number. If E is the event that a number greater

© 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.
no calls will arrive at a 3-minute period than or equal to 4 occurs on a single toss of the
(a) e–1.5 (b) e –0.05 die, then P(E ) is
k
−1.5(1.5)k 1 ∞
e−1.5(1.5) 4 2
(c) e (d) ∑ (a)
9
(b)
3
k! k =3 k!
1 1
[JNU] (c) (d)
2 3
Q.52 A machine contains a component A that is vital [JNU]
for its operation. The reliability of the component
Q.55 A random variate has the following distribution:

Y
A is 80%. To improve the reliability of the
machine, a similar component is used in parallel
x 0 1 2 3 4 5 6 7
for the system S as shown in the following figure.

S
2 2 2
p( x) 0 k 2k 2k 3k k 2k 7k + k
A

The value of k is

B
A (a) –1
(c) 0.1
(b) 0
(d) –0.1
[JNU]
E
The machine works if one of these two
Q.56 A point P is chosen at random on a line AB of
components functions. What is the reliability of
length 2l. The probability
the system S?
(a) 98% (b) 96% ⎡ l2 ⎤
E

P ⎢(AP × BP) > ⎥ is

(c) 94% (d) 92% ⎣ 2⎦
[JNU]
D

1 1
Q.53 For answering a question in a multiple choice (a) (b)
2 2
test a student either knows the answer, or
⎛ 1 ⎞ 1
A

guesses it. Let p be the probability that the

(c) ⎜ 1 − ⎟l (d) l
answer is known to the student and (1 – p) that ⎝ 2⎠ 2
the answer is guessed. Let m be the number of [JNU]
M

1 Q.57 Consider any set of 201 observations x1, x2, ...,

alternative answers, then be the probability
m x200, x201. It is given that x1 < x2 < ... < x200 <
that the answer is guessed correctly. The x201. Then the mean deviation of this set of
observations about a point k is minimum when
conditional probability that the student knew the
k equals
answer to a question given that she/he answered
it correctly is ( x1 + x2 + ... + x200 + x201)
(a)
p 1 201
(a) (b) p −
1 + (m − 1)p m (b) x1
1 p mp (c) x101
(c) p + − (d) (d) x201
m m 1 + (m − 1)p
[JNU]
[JNU]

www.madeeasypublications.org © Copyright
 Workbook 45

Q.58 Three identical dice are rolled. The probability Q.63 Suppose there are n number of CPUs on a
that the same number will appear on each of common bus. The probability that any CPU tries
them is to use the bus in a given cycle is p. What is the

© 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 1 chance that the bus is idle?
(a) (b)
6 36 pn
1 3 (a) (b) pn (1 – p)n
(c) (d) (1 − p)n
18 28
(c) pn (d) (1 – p)n
[JNU]
[JNU]
Q.59 If M and N are any two events, which of the Q.64 For any discrete random variable X, with
following is not the probability that exactly one probability mass function P(X = j ) = pj , pj ≥ 0,
of them occurs N
j ∈ {0...N}, and ∑ pj = 1, define the polynomial

Y
(a) P(M) + P(N) – 2P(M ∩ N)
j =0
(b) P(M) +P(N) – P(M ∩ N)
N
(c) P(MC) + P(NC) – 2P(MC ∩ NC)
function gX (z) = ∑ pj z j . For a certain discrete

S
(d) P(M ∩ NC) + P(MC ∩ N) j =0
[JNU]
random variable Y, there exists a scalar β ∈ [0, 1]
Q.60 A room has three lamp sockets. From a
collection of 12 light bulbs of which 7 are no
good, a person selects 3 at random and put
A such that gY (z) = (1 – β + βz)N. The expectation
of Y is
(a) N β (1 – β)
E
them in sockets. What is the probability that he (b) N β
will have light?
(c) N (1 – β)
37 5 (d) Not expressible in terms of N and β alone
(a) (b)
44 12 [GA TE-2017]
[GATE-2017]
E

41
(c) (d) None of these
48
[JNU]
D

Q.61 Find the variance of the random variable X whose

value when two dice are rolled is X (i, j ) = i + j Q.65 Consider the following diagram which shows
A

where i is the number appearing on the first die the results of a game where discs are thrown
and j is the number appearing on the second into two circles A and B
die U
M

29 23 A B
(a) (b)
12 17
35 31
(c) (d)
6 8
[JNU]

Q.62 Let A and B be any two events with p (A) = 0.3, What is the value of P(A) ? [Assume P is
p (B) = 0.8. Which of the following is true probability]. Please enter the value in x ⋅ y format
regarding p (A ∪ B) and p (A ∩ B)?
(a) 0.8 ≤ p(A ∪ B) ≤ 1 and 0.1 ≤ p(A ∩ B) ≤ 0.3 Q.66 5 Students are selected without replacement
(b) 0.7 ≤ p(A ∪ B) ≤ 1 and 0.1 ≤ p(A ∩ B) ≤ 0.3 from a class of 3 boys and 5 girls. The
(c) 0.8 ≤ p(A ∪ B) ≤ 1 and 0.1 ≤ p(A ∩ B) ≤ 0.2 probability of choosing at least 3 girls is ______.
(d) 0.2 ≤ p(A ∪ B) ≤ 1 and 0.7 ≤ p(A ∩ B) ≤ 0.8 [Please enter the value in x⋅yz format]

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

Q.67 A simple graph G has only 5 vertices and by Q.72 Let X be a Gaussian random variable with mean
the deletion of every vertex Vi from G the 0 and variance σ2. Let Y = max (X, 0) where
subgraph Gi is obtained by removal of all max (a, b) is the maximum of a and b. The

© 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.
adjacent edges of Vi of G. Suppose the following median of Y is ________.
graphs are obtained as subgraphs G1, G2, G3, [GA TE-2017]
[GATE-2017]
G4 and G5 by deletion of vertices V1, V2, V3, V4
and V5 respectively, how many edges are
present in the given graph G ?

T1. Consider a coin with probability P to be heads.

What is the probability that the first head will
G1 : G2 :

Y
appear on the even numbered tosses?
1− P 1− P
(a) (b)
2 2 −P

S
1− P 1
G3 : G4 : (c) (d)
P(1− P)
3 −P

A T2.
[Ans: (b)]

Suppose that X is a random variable for which

E
E (X ) = μ and Var(X ) = σ2. Let ‘c ’ be an arbitrary
G5 :
constant. Then E [(X – c)2 ] = __________
(a) (μ – c)2
(b) (μ – c)2 – σ2
E

Q.68 A fair coin is tossed three times in succession. (c) (μ – c)2 + σ2

If the first toss produces a head, then what is (d) None of these
the probability of getting exactly two heads in
D

[Ans: (c)]
three tosses?
T3. Assume that connected simple graph ‘G’ has n
Q.69 A fair six sided die is thrown twice. If the sum
vertices (n ≥ 3) and e edges. Which of the
A

of the face values of these two tosses is 5 then

following statement is invalid?
what is the probability that the face value of the
first toss is less than that of second toss? (a) If G is planar then e ≤ (3n – 6)
M

(b) If e ≤ (3n – 6) then G is a planar

Q.70 Let X be a continuous random variable with (c) If e > (3n – 6) then G is not planar
following probability density function.
(d) If e = 3n – 5 then G is not planar
f (x) = 2x, x∈[0,1] [Ans: (b)]
= 0, x∉[0,1]
T4. Which one of the following random variable is
Find the variance of X. (Round upto three decimal discrete?
places)
(a) A person’s exact weight
Q.71 If a fair coin is tossed until the same result turns (b) Number of questions attempted in a test
up in succession (both head or both tail) then (c) Both (a) and (b)
find the probability when the number of tosses (d) Neither (a) nor (b)
are even. (Round upto two decimal places) [Ans: (b)]

www.madeeasypublications.org © Copyright
 Workbook 47

T5. Match the following Lists: T7. Let X be an exponential random variable with
List-I rate parameter λ. Then find variance of X.
⎛n ⎞

© 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.
A. ⎜ ⎟ ⋅ P x (1 − P )n − x 1 1
(a) (b)
⎝ x⎠ λ λ2
e −λ ⋅ λ x
B. 2 2
x! (c) (d)
λ λ2
C. λ ⋅ e–λx
[Ans: (b)]
1
D. T8. E[X] = 1 and Var[X] = 2, which one of the
b −a
following is not correct?
List-II (a) E[6 X] = 6 (b) Var[6 X] = 72

Y
1. Discrete distribution (c) E[1 – X] = 0 (d) Var[1 – X] = 3
2. Continuous distribution [Ans: (d)]
Codes:
Find the value of λ such that function f (x) is valid

S
T9.
A B C D
probability density function.
(a) 1 2 1 2
f (x) = λ(x – 1) (2 – x) for 1 ≤ x ≤ 2
(b) 2 1 2 1
(c) 1 1
(d) 2 2
2
1
2
1
[Ans: (c)] A = 0 otherwise

T10. Consider the following experiment.

[Ans: (6)]
E
Step 1. Flip a fair coin twice.
T6. If the proportion of handicapped people in a Step 2. If the outcomes are (TAILS, HEADS)
large population is 0.006, then what is the then output Y and stop.
probability that there will be atmost one Step 3. If the outcomes are either (HEADS,
E

handicapped person in a randomly chosen group HEADS) or (HEADS, TAILS), then output N and
of 500 people? Use poisson approximation to stop.
D

compute the probability. Step 4. If the outcomes are (TAILS, TAILS), then
(a) 3e–4 (b) 2e –3 go to Step 1.
(c) 4e –3 (d) 3e–2 The probability that the output of the experiment
A

[Ans: (c)] is Y is _____ (up to two decimal places).

[GA TE-2016, Ans: (0.33)]
[GATE-2016,
M

„„„„

© Copyright www.madeeasypublications.org
 6 Linear Algebra

© 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.
⎡ 0 0 −3 ⎤
Q.5 The rank of matrix ⎢9 3 5 ⎥ is

Y
⎢ ⎥
⎢⎣3 1 1 ⎥⎦
Q.1 A square matrix is singular whenever
(a) 0 (b) 1

S
(a) the rows are linearly independent
(b) the columns are linearly independent (c) 2 (d) 3
(c) the rows are linearly dependent [GATE-1994]
[GATE-1994]
(d) None of the above
[GATE-1987]
[GATE-1987]
A Q.6 If A is an orthogonal a matrix, which of the
following statements about A, is false?
(a) A = A–1
E
Q.2 The eigen vector(s) of the matrix
(b) A At = I
⎛0 0 α ⎞ (c) At = A –1
⎜ ⎟ , α ≠ 0 is (are)
⎜0 0 0 ⎟ (d) The eigen values of A have magnitude 1
⎜0 0 0 ⎟
⎝ ⎠
E

Q.7 The rank of the following (n + 1) × (n + 1) matrix,

(a) (0, 0, α) (b) (α, 0, 0) where a is a real number is
(c) (0, 0, 1) (d) (0, α, 0)
D

[GATE-1993]
[GATE-1993] ⎡1 a a2  an ⎤
⎢ ⎥
⎢1 a a2  an ⎥
⎢ ⎥
A

⎛1 0 0 1⎞ ⎢⋅ ⋅ ⋅ ⋅ ⎥
⎜ ⎟ ⎢⋅ ⋅ ⋅ ⋅ ⎥
0 −1 0 −1⎟
Q.3 If A = ⎜ the matrix A4, calculated ⎢ ⎥
⎜0 0 i i ⎟ ⎢⋅ ⋅ ⋅ ⋅ ⎥
M

⎜ ⎟ ⎢ ⎥
⎝0 0 0 −i ⎠ ⎣1 a a2  an ⎦

by the use of Cayley-Hamilton theorem or (a) 1

otherwise, is (b) 2
(a) O (b) I (c) n
(c) A (d) None of these (d) Depends on the value of a
[GA TE-1993]
[GATE-1993] [GATE-1995]
[GATE-1995]

Q.4 Let A and B real symmetric matrices of size Q.8 Let A be the set of all non singular matrices
n × n. Then which one of the following is true? over real number and let ∗ be the matrix
(a) AA t = I (b) A = A –1 multiplication operation. Then
(c) AB = BA (d) (AB)t = BA (a) A is closed under ∗ but <A, ∗> is not a
[GATE-1994]
[GATE-1994] semi-group

www.madeeasypublications.org © Copyright
 Workbook 49

(b) <A, ∗> is a semi-group but not a monoid (a) row is the same as its second row
(c) <A, ∗> is a monoid but not a group (b) row is the same as the second row of A
(d) <A, ∗> is a group but not an Abelian group (c) column is the same as the second column

© 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.
[GA TE-1995]
[GATE-1995] of A
(d) row is all zero
Q.9 Let A x = b be a system of linear equations where
[GA TE-1997]
[GATE-1997]
A is an m × n matrix and b is a m × 1 column
matrix and X is a n × 1 column vector of unknowns. Q.13 Consider the following set of equations
Which of the following is false? x + 2y = 5
(a) The system has a solution if and only if, 4x + 8 y = 12
both A and the augmented matrix [A b ] have 3x + 6 y + 3z = 15
the same rank This set

Y
(b) If m < n and b is the zero vector, then the (a) has unique solution
system has infinitely many solutions (b) has no solutions
(c) If m = n and b is non-zero vector, then the (c) has finite number of solutions

S
system has a unique solution (d) has infinite number of solutions
(d) The system will have only a trivial solution [GATE-1998]
[GATE-1998]
when m = n, b is the zero vector and rank
(A) = n
[GA TE-1996]
[GATE-1996]
A ⎡1 4 8
⎢0 0 3
Q.14 The rank of the matrix given is ⎢
7⎤
0 ⎥⎥
E
⎢4 2 3 1⎥
⎡cos θ − sin θ ⎤ ⎡a 0 ⎤ ⎢ ⎥
Q.10 The matrices ⎢ ⎥ and ⎢ ⎥ ⎣⎢3 12 24 2 ⎦⎥
⎣ sin θ cos θ ⎦ ⎣0 b ⎦
commute under multiplication (a) 3 (b) 1
E

(a) If a = b or θ = n π, where n is an integer (c) 2 (d) 4

(b) Always [GATE-1998]
[GATE-1998]
(c) Never
D

Q.15 Consider the following determinant

(d) If a cos θ ≠ b sin θ
[GA TE-1996]
[GATE-1996] 1 a bc
A

Δ = 1 b ca
⎡ 6 −8 1 1⎤ 1 c ab
⎢0 2 4 6 ⎥⎥
Q.11 The determinant of the matrix ⎢
M

Which of the following is a factor of Δ?

⎢0 0 4 8⎥
⎢ ⎥ (a) a + b (b) a – b
⎣⎢0 0 0 −1⎦⎥
(c) a + b + c (d) abc
[GA TE-1998]
[GATE-1998]
is
(a) 11 (b) –48
⎡2 0 0 0⎤
(c) 0 (d) –24 ⎢8 1 7 2 ⎥⎥
[GATE-1997]
[GATE-1997] Q.16 The determinant of the matrix ⎢ is
⎢2 0 2 0⎥
Q.12 Let A = (ai j) be an n -rowed square matrix and ⎢ ⎥
⎢⎣9 0 6 1⎥⎦
I12 be the matrix obtained by interchanging the
first and second rows of the n -rowed identity (a) 4 (b) 0
matrix. Then A I12 is such that its first (c) 15 (d) 20
[GATE-2000]
[GATE-2000]

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

Q.17 Consider the following statements: (a) kn D (b) k – D

S1 : The sum of two singular n × n matrices may D
be non-singular. (c) –kD (d)
k

© 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.
S2 : The sum of two n × n non-singular matrices [JNU]
may be singular. Q.22 For large n, how many arithmetic operations
Which of the following statements is correct? does the Gauss-Jordan elimination require?
(a) S1 and S2 are both true n3
(b) S1 is true and S2 is false (a) n3 (b)
(c) S1 is false and S2 is true 6
n3
3
(d) S1 and S2 are both false n
[GA TE-2001]
[GATE-2001] (c) (d)
3 2

Y
[JNU]
⎡ 1 1⎤
Q.18 The rank of the matrix ⎢ ⎥ is Q.23 Total number of divisions and multiplications
⎣0 0 ⎦
required for solving a system of 5 equations

S
(a) 4 (b) 2
using Gauss Elimination Method is
(c) 1 (d) 0
(a) 113 (b) 208
[GATE-2002]
[GATE-2002]

Q.19 For the following matrix A, which one of the given

options is true? A (c) 65 (d) 45
[JNU]
Q.24 Which one of the following is not a property of
E
⎡3 1 4⎤ eigenvalues and eigenvectors?
⎢0 5 8 ⎥⎥ (a) The eigenvalues of a real symmetric matrix
A= ⎢ are real
⎢ −3 4 4⎥
⎢ ⎥ (b) Eigenvalues of a singular matrix are reciprocal
E

⎢⎣ 1 2 4 ⎥⎦
of the eigenvalues of inverse of that matrix
(a) The rank of AT is 4 (c) Similar matrices have the same eigenvalues
D

(b) The rank of the matrix A is 3 (d) The matrix and its transpose have the same
(c) The number of linearly independent row eigenvalues
vectors is 2 [JNU]
A

(d) The matrix A is linearly independent

Q.25 Let AX = B be a system of n linear equations in
[JNU]
n unknown with integer coefficient and the
M

components of B are all integer. Consider the

⎡3 5 3 ⎤ following:
⎢ ⎥
Q.20 Consider the matrix A = ⎢0 4 6 ⎥ . Which of 1. det (A) =1
⎢⎣0 0 1⎥⎦ 2. det (A) = 0
the following is two out of its three eigenvalues? 3. solution X has integer entries
(a) 3, 4 (b) 3, 5 4. solution X does not have all integer entries
(c) 5, 4 (d) 4, 6 For the given system of linear equations which
[JNU] one of the following is correct?
(a) Only 3 unconditionally holds true
Q.21 Given an n × n matrix B with determinant D, let
(b) If 1 then 3 holds true
B′ be obtained by first multiplying the i th row
(c) If 1, then 4 holds true
by k and then interchanging the i th and the j th
(d) If 2, then 3 holds true
rows. What is the determinant of B′?
[JNU]

www.madeeasypublications.org © Copyright
 Workbook 51

Q.26 Let A be n × n real valued square symmetric Q.31 Consider the following system of equations.
x+y = 2
n n
matrix of rank 2 with ∑∑ Ai2j = 50 . Consider x + py = 2

© 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.
i =1 j =1 Where p is constant. Find the value of ‘p ’ such
that the system has more than two solutions.
the following statements.
I. One eigenvalue must be in [–5, 5]
II. The eigenvalue with the largest magnitude
must be strictly greater than 5.
Which of the above statements about T1. The system of linear equations
eigenvalues of A is/are necessarily CORRECT? x + y + z = 2, 2x + y – z = 3, 3x + 2y + Kz = 4
(a) Both I and II (b) I only
has unique solution if _______

Y
(c) II only (d) Neither I nor II
(a) K ≠ 0 (b) K ≤ 0
[GA TE-2017]
[GATE-2017]
(c) K ≥ 0 (d) K = 0
[Ans: (a)]

S
1
T2. A matrix P3 × 3 has three eigen values –1, , 3.

Q.27 Find the rank of following matrix A

⎡ 1 5 1⎤ A What will be the eigen values of P 2 + 2P + I?
[Where I is identity matrix (3 × 3 order)]
2
E
A = ⎢2 1 1⎥ 9 1
⎢ ⎥ (a) 0, 16, (b) 1, ,9
⎢⎣3 6 2⎥⎦ 4 4
9 3
Q.28 Consider the following matrix A. (c) 2, ,4 (d) 2, , –2
2 2
E

⎡ 1 1 1⎤ [Ans: (a)]
A = ⎢⎢0 1 2⎥⎥ T3. Find the value of K for which the following matrix
D

⎢⎣ 5 x 6⎥⎦ A is singular.
For which value of x is the matrix A not invertible? ⎡1 2 K ⎤
A = ⎢⎢3 −1 1 ⎥⎥
A

Q.29 Suppose 3-digit number is formed as following.

• First digit is any one of 1, 2 and 3 ⎣⎢ 5 3 −5⎥⎦
• Second digit is any one of 4, 5 and 6 (a) K = –1 (b) K = –2
M

• Third digit is any one of 7, 8 and 9 (c) K = –3 (d) None of these

[Ans: (c)]
How many ways the above 3-digit number can
be formed? T4. Compute the inverse of the following matrix A.
Q.30 Find the value of x in the matrix A–1 for the ⎡ 1 3 −2⎤
following matrix A and A–1. A = ⎢⎢0 2 4 ⎥⎥
⎢⎣0 0 −1⎥⎦
⎛1 −2 ⎞
⎜3 0
⎜ 3 ⎟⎟ ⎡ 3 ⎤
⎛ 3 0 2⎞ ⎢ 1 − 2 −8⎥
⎜ ⎟ and A −1 = ⎜ 0 1
x ⎟⎟ ⎢ ⎥ ⎡ 1 3 −2⎤
A = ⎜ 0 2 4⎟ ⎜
(b) ⎢0 2 4 ⎥
⎢ 1
2 ⎥⎥
⎜ 0 0 1⎟ 2
⎜ ⎟ (a) 0
⎢ ⎥
⎝ ⎠ ⎜0 0 1 ⎟ ⎢ 2
⎜ ⎟ ⎢ ⎥ ⎢⎣0 0 −1⎥⎦
⎝ ⎠ ⎣0 0 −1⎦

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

⎡ 3 ⎤ T9. Let A be n × n matrix, An = An – 1 A for n ≥ 1 and

⎢1 − 2 8⎥ A0 = In . Which of the following is correct
⎢ ⎥
(c) ⎢0 2 4⎥ (d) None of these (a) Am ⋅ An = Am + n (b) (Am)n = Amn

© 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.
⎢0 0 −1⎥⎦
⎣ (c) Both (a) and (b) (d) Neither (a) nor (b)
[Ans: (a)] [Ans: (c)]

T5. Let A be a 4 × 4 matrix with real entries such

⎡a b ⎤
that –1, 1, 2, –2 are its eigen values. If B = A4 – ⎡ −1 0 1⎤ ⎢c d ⎥
T10. Let A = ⎢ ⎥ and B = ⎢ ⎥ .
5A2 + 5I where I denotes 4 × 4 identity matrix, ⎣ 0 1 1⎦ ⎢⎣e f ⎥⎦3 × 2
then which of the following is correct? [det(X)
represents determinant of X] If AB = I then element f = __________.
(a) det (A + B) = 0 (a) a (b) a + 1

Y
(b) det (B) = 1 (c) b (d) 1 – b
(c) trace of A + B is 4 [Ans: (c)]
(d) all of these

S
T11. If we take n-tuples of the form (a1, a2, ...., an),
[Ans: (d)]
maximum how many of these n-tuples can be
T6. Which of the following is a scalar matrix? linearly independent.
⎡0 1 2⎤
(a) ⎢ 1 0 3⎥
⎢ ⎥
⎢⎣2 3 0⎥⎦
⎡0 0 0⎤
⎢
(b) ⎢ 1 0 1⎥
⎥

⎣⎢0 1 0⎥⎦
A (a) n – 1

(c)
n
(b) n

(d) 2n
E
2

⎡ 1 0 0⎤ ⎡0 1 1⎤ [Ans: (b)]
⎢ ⎥ ⎢ ⎥
(c) ⎢0 1 0⎥ (d) ⎢ 1 0 1⎥ T12. Consider the following factorization of a matrix A.
⎣⎢0 0 1⎥⎦ ⎣⎢ 1 1 0⎥⎦
E

A = LU,
[Ans: (c)]
⎡ 1 0 0⎤ ⎡a b c ⎤
where L = ⎢4 1 0 ⎥ , U = ⎢⎢0 d e ⎥⎥
⎢ ⎥
T7. Find an eigen vector corresponding to largest
D

⎢⎣7 2 1⎥⎦ 3 × 3 ⎢⎣0 0 f ⎥⎦ 3 × 3

⎡ 1 −1 1⎤
⎢
eigen value of matrix A = ⎢ 1 −1 1⎥
⎥
A

⎡a11 a12 a13 ⎤

⎢⎣ −1 1 1⎥⎦ and A = ⎢⎢a21 a22 a23 ⎥⎥
⎢⎣a31 a32 a33 ⎥⎦
3 ×3
M

⎡1⎤ ⎡ 1⎤
(a) ⎢1⎥ (b) ⎢2⎥ If i = 1 then ai j = j otherwise ai j = 3 + a(i – 1)j.
⎢⎥ ⎢ ⎥
⎢⎣1⎥⎦ ⎢⎣ 1⎥⎦ Find the matrix U.
⎡ 1⎤ ⎡1 2 3 ⎤ ⎡ 1 2 −6⎤
⎡2⎤ ⎢2 ⎥ (a) ⎢0 −1 −2⎥ (b) ⎢0 −3 3 ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
(c) ⎢⎢ 1⎥⎥ (d) ⎢ 1 ⎥ ⎢⎣0 0 0 ⎥⎦ ⎢⎣0 0 0 ⎥⎦
⎢⎣ 1⎥⎦ ⎢0 ⎥
⎣ ⎦
⎡1 2 3 ⎤ ⎡ 1 2 −6⎤
[Ans: (a)]
(c) ⎢0 −3 −6⎥ (d) ⎢0 −1 −6⎥
T8. Identity matrix is _________. ⎢ ⎥ ⎢ ⎥
⎢⎣0 0 0 ⎥⎦ ⎢⎣0 0 0 ⎥⎦
(a) Scalar matrix (b) Diagonal matrix
(c) Both (a) and (b) (d) Neither (a) nor (b) [Ans: (c)]
[Ans: (c)]
„„„„

www.madeeasypublications.org © Copyright
 7 Calculus

© 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.
3x + 1 + 4
Q.5 Which of the value of lim ?
x→∞ 3x + 2 + 4

Y
(a) 0 (b) 1
x −2
Q.1 What is the value of lim ?
x−4

S
x→4 1 1
(c) (d)
(a) 0 (b) ∞ 3 4

1 (e) ∞
(c) 1

(e)
1
(d)
2

A Q.6 If f (x) = 2x2 + x – 3, then the value of

f ( x) − f (2)
E
4 lim is equal to
x→2 x−2
(3x2 + 5) (a) 9 (b) 5
Q.2 What is the value of lim ?
x→∞ 5x + 3 (c) 2 (d) 1
E

(e) Does not exist

3 5
(a) (b)
5 3 Q.7 The function f (x) = x3 – 3x 2 + 3x + 2 is
D

(a) monotonically increasing in [0, 1] and

3 5
(c) (d) monotonically decreasing in [2, 3]
5 3
(b) monotonically decreasing in [0, 1] and
A

(e) 0
monotonically increasing in [2, 3]
1 (c) monotonically decreasing in every interval
Q.3 Find the value of ∫ x log x d x (d) monotonically increasing in every interval
M

(a) log x + c (b) log(log x) + c Q.8 The maximum value of 2x3 – 15x2 + 36x + 10 is
1 (a) 37 (b) 38
(c) log(log(log x)) + c (d) +c (c) 49 (d) 60
log x
(e) x + c Q.9 f (x) = (x – 1) (x – 2) (x – 3) has maximum value
when x is equal to
28 2
Q.4 f (t ) = 112 t − t − 600 , then f (t ) is maximum 1 1
15 (a) 2 − (b) 2 +
3 3
at t =?
(a) 0 (b) 15 2 2
(c) 30 (d) 112 (c) 1 + (d) 1 −
3 3
(e) 600

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

π /4 1
Q.10 If f (n) = ∫0 tann x d x then f (3) + f (1) equals Q.15 ∫ sin2 d x is equal to
x + sin 2 x
1

© 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.
(a) 1 (b) 1 tan x 1 ⎛ tan x + 2 ⎞
2 log log ⎜
(a) (b) ⎟
3
2 tan x + 2 2 ⎝ tan x ⎠
(c) 2 (d)
2 1 cot x 1 ⎛ cot x + 2 ⎞
(c) log (d) log ⎜ ⎟
Q.11 The Langrange’s mean value theorem is applicable 2 cot x + 2 2 ⎝ cot x ⎠
[JNU]
1
to f (x) = sin in the interval.
x dy
(a) [–3, 3] (b) [–2, 5] Q.16 If x sin y = y sin x, then is equal to
dx
(c) [2, 3] (d) [–1, 4]

Y
x2 cos x log x − y sin y
(a)
Q.12 What is the maximum value of the function x2 cos x log x − x sin x
f (x) = 2x 2 – 2x + 6 in the interval [0, 2]?
y 2 cos y log y − x sin x

S
(a) 6 (b) 10 (b)
(c) 12 (d) 5.5 y 2 cos y log y − y sin y
[GA TE-1997]
[GATE-1997] xy cos x cos y − y sin y

Q.13 Consider the function y = ⏐x⏐ in the interval

[–1, 1]. In this interval, the function is A (c)

(d)
xy cos x cos y − x sin x
xy cos x log y − y sin y
E
(a) continuous and differentiable xy log x cos y − x sin x
(b) continuous and not differentiable [JNU]
(c) differentiable but not continuous
Q.17 Consider the function f (x) = x3 – 3x + 2. Assume
(d) neither continuous nor differentiable
E

that as x moves from left to right through a point

[GA TE-1998]
[GATE-1998]
c = 2, what is the behaviour of the graph of
Q.14 Consider the following statements: f (x)?
D

1. If f is a function such that a = 9, f (a) = 9 (a) Rising

f ( x) − 3 (b) Falling
and f ′(a) = 4, then lim = 4. (c) Growing parallel to x-axis after c
x −3
A

x→9
(d) None of the above
2. If f (x) has derivative at the point x0 ; then [JNU]
the function F (x) = f (x) g (x) will not be
M

differentiable at x0. Q.18 Consider the following two statements:

1. If f (x) has derivative at the point x0 and g (x)
⎧ −2 for − 3 ≤ x ≤ 0
3. Let f (x) = ⎨ and has no derivative there, then the function
⎩ x − 2 for 0 < x ≤ 3 F (x) = f (x) g (x) will not be differentiable at
g (x)= f (⏐ x ⏐) + ⏐f (x)⏐, then g (x) is x0 where f (x) and g (x) are real-valued
differentiable in (–3, 3) except at x = 0.
functions of the real variables.
Identify the valid option from the following, 2. The function f (x) defined by
relating the number of correct statements
⎧ x when x is rational
(a) All the three statements are correct f (x) = ⎨ is Riemann
(b) Exactly two statements are correct ⎩ − x when x is irrational
(c) Exactly one statement is correct integrable over the interval [a, b].
(d) All the statements are incorrect Which of the following options is correct for the
[JNU] above two statements?

www.madeeasypublications.org © Copyright
 Workbook 55

(a) 1 is true but 2 is false

(a) 2 (b) 2
(b) 1 is false but 2 is true
(c) Both 1 and 2 are true 1 3

© 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.
(c) (d)
(d) Both 1 and 2 are false 2 2
[JNU] [JNU]

Q.19 If f ( a ) = a 2, ϕ( a ) = b 2; f ′( a ) = ϕ′(a ), then Q. 24 The maximum and minimum values of

Q.24
2(x2 – y 2) – x 4 + y 4 respectively are
f ( x) − a (a) +1, –1 (b) –1, –2
lim is equal to
x→a ϕ( x) − b (c) +2, –1 (d) +2, –2
[JNU]
a b
(a) (b) Q.25 An open box is to be made from a rectangular

Y
b a
piece of metal sheet, 12 cm by 18 cm, by cutting
(c) 0 (d) ∞ out equal squares from each corner and folding
[JNU] up the sides. Then the side of the cut-out

S
squares, such that the open box is of largest
⎪⎧ x sin x(log x2 ); x ≠ 0 volume, is equal to
Q.20 If f (x) = ⎨
⎪⎩ 0 ; x=0
, then

(a) f (x) is discontinuous and differentiable at A (a) 7 +

(c) 5 –
5 cm

7 cm
(b) 7 –

(d) 5 +
5 cm

7 cm
E
x=0 [JNU]
(b) f (x) is continuous but differentiable at x = 0 ⎛πx⎞ ⎛ 1⎞
(c) f (x) is continuous and not differentiable at
Q.26 If f (x) = R sin⎜ ⎟ + S, f ′ ⎜ 2 ⎟ = 2 and
⎝ 2 ⎠ ⎝ ⎠
x=0
E

1
(d) f (x) is discontinuous and not differentiable 2R
at x = 0
∫ f (x)d x = π
, then the constants R and S are,
0
D

[JNU] respectively
2 16 2
⎛ sin(3x)(2x − 1) ⎞ (a) and (b) and 0
π π π
A

Q.21 lim ⎜ ⎟ =
x →0 ⎜ x2 ⎟
⎝ ⎠
4 4 16
(c) and 0 (d) and
(a) 3 log2 (b) 2 log3 π π π
M

(c) 6 (d) 0 [GATE-2017]

[GATE-2017]

⎧⎪ x2 + 3a ; x ≤ 1
Q.22 For f (x) = ⎨ , what are the values
⎪⎩bx + 2; x > 1

of a and b for f (x) to be derivable at x ∈ R ? Q.27 What is the Cauchy’s mean value for the
(a) a = 1, b = 2 (b) a = 2, b = 1 functions e x and e–x between (0, 1)? [Please
(c) a = 1, b = 1 (d) a = 2, b = 2 enter the value in x ⋅ y format]
[JNU]
x2
Q.23 If x and y are real and + x2 y2 = 1, find the Q.28 Let f (x) = x ⋅ ∫ y 2 + 3 ⋅ dy . Find f (1)
maximum value of (x + y)2 1

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

8
(a) (b) 4
3
10

© 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.
(c) (d) None of these
3
T1. Consider the following statements:
[Ans: (c)]
Assertion (A): The function f (x) = x – [x], x ∈ Z
is discontinuous at x = 1 T6. Find the x values for which the following function
is increasing.
Reason (R): lim f ( x) ≠ lim f ( x)
x →1− x →1+ x
f (x) =
Choose the correct option. x +4
2

(a) Both A and R are true and R is the correct (a) x < 2 (b) x > 2
explanation of A (c) x < –2 and x > 2 (d) x > –2 and x < 2

Y
(b) Both A and R are true and R is not the [Ans: (d)]
correct explanation of A
(c) A is true but R is false T7. Consider the function f (x) = x + ln x and f is

S
(d) Both A and R are false differentiable on (1, e) and f (x) is continuous
[Ans: (d)] on [1, e]. Determine the c value using mean

T2. Which of the following is correct?

⎛ 1⎞
(a) ⎜ 1 + ⎟
n +1
→ e as n → ∞ A value theorem. [By computing f ′(c) =
f (b) − f (a)
b −a
]
E
⎝ n⎠ (a) e (b) e – 1
n2 e e −1
⎛ 1⎞ (c) (d)
(b) ⎜ 1 + ⎟ → e as n → ∞ e −1 e
⎝ n⎠
[Ans: (b)]
E

n
⎛ 1 ⎞
(c) ⎜ 1 + ⎟ → e as n → ∞ T8. Let z = x siny – y sin x. The total differential
⎝ n2 ⎠
dz = ________.
D

(d) None of these

(a) (sin y + y cos x) d x + (x cos y + sin x) dy
[Ans: (a)]
(b) (sin y – y cos x) d x + (x cos y + sin x) dy
A

3+ x − 3− x (c) (sin y + y cos x) d x + (x cos y – sin x) dy

T3. lim = _________
x →0 x (d) (sin y – y cos x) d x + (x cos y – sin x) dy
(a) 0 (b) 1 [Ans: (d)]
M

(c) 2 (d) None of these

T9. Consider the following statements:
[Ans: (d)]
S1 : f (x) = x5 + 3x – 1 is an increasing function
Linked Answer for T4 and T5: for all values of x.
Given a function f (x, y) = 4x2 + 6y 2 – 8x – 4y + 8 S2 : f (x) = 1 – x3 – x9 is a decreasing function for
all values of x where x ≠ 0.
T4. The minimal point in the given function is
Which of the above statements are TRUE?
(a) (1, 0) (b) (1, 0.33)
(a) S1 only (b) S2 only
(c) (0.33, 0) (d) None of these
(c) Both S1 and S2 (d) Neither S1 nor S2
[Ans: (b)]
[Ans: (c)]
T5. The optimal value of f (x, y ) at the above minimal
point is „„„„

www.madeeasypublications.org © Copyright