SY

Corporate Office (Delhi): 44-A/1 Kalu Sarai (Sarvapriya Vihar), New Delhi-16, Ph: 011-45124612, 9958995830
Visit us at: www.madeeasy.in | E-mail us at: info@madeeasy.in

Delhi | Hyderabad | Noida | Bhopal | Jaipur | Lucknow | Indore | Pune | Bhubaneswar | Kolkata | Patna
EA
Lockdown Period
Open Practice Test Series
(Also useful for Other Exams)
E

CS & IT : COMPUTER SCIENCE & IT

AD

TEST No. -12 | DISCRETE MATHEMATICS

Read the following instructions carefully

1. This question paper contains 33 MCQ’s & NAQ’s. Bifurcation of the questions are given below:
M

17 to 28

29 to 33

2. Choose the closest numerical answer among the choices given.

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Multiple Choice Questions : Q.1 to Q.10 carry 1 mark each

Q.1 Let satsifiable (x) be a predicate which denotes that x is satisfiable logic. Let Valid (x) be a predicate which
denotes that x is valid logic. Which of the following first order logic sentences does not represents the
statements:
“Not every satisfiable logic is Valid”
(a) ¬∀x (satisfiable (x) ⇒ Valid (x)) (b) ∃x (satisfiable (x) ∧ ¬ Valid (x))
(c) ¬∀x (¬ satisfiable (x) ∨ Valid (x)) (d) ∀x (satisfiable (x) ⇒ ¬ Valid (x))

1. (d)
“Not every satisfiable logic is Valid”
= Not (every satisfiable logic is Valid)

SY
= Not ( ∀x (satisfiable (x) ⇒ Valid (x)) option (a)
= Not ( ∀x (¬ satisfiable ∨ Valid (x)) option (c)
= ∃x (satisfiable (x) ∧ ¬ Valid (x)) option (b)
Statement (d) says every satisfiable logic is invalid.
So option (d) is not represent given statement.
EA
Q.2 Which of the following statement is incorrect?
(a) A graph of 6 vertices can be 1-chromatic.
(b) Every tree with 2 or more vertices is 2-chromatic.

⎛ ⎢n ⎥ ⎞
(c) A wheel graph of n-vertices is ⎜ ⎢ ⎥ + 1⎟ chromatic.
⎝ ⎣2⎦ ⎠

(d) A graph which has no circuit of odd-length and has atleast 1 edge is 2-chromatic.
E

2. (c)
Consider a wheel graph of 7 vertices.
A
AD

F B
G
E C
D
But the chromatic number of graph is 3.
Color 1 for G
M

Color 2 for A, E, C
Color 3 for F, B, D
All other statements are true.

Q.3 Which recurrence relation satisfy the sequence: 2, 3, 4, . . ., for n ≥ 1.

(a) an = 2an–1 – an–2 (b) an = an–1 + an–2
(c) an = n + 1 (d) None of these

3. (a)
Clearly, an = n + 1
⇒ an–1 = n
⇒ an–2 = n – 1
⇒ an = 2an–1 – an–2 [∵ 2(n) – (n – 1) = n + 1]

2 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.4 Consider statements:

S1 : A finite lattice is always bounded.
S2 : Complemented lattice is a proper subset of bounded lattice.
S3 : A bounded and complemented lattice may or may not be a distributive lattice.
Which of the following is/are true?
(a) S1 and S2 (b) S2 and S3
(c) S1 and S3 (d) S1, S2 and S3

4. (d)
• A lattice is bounded iff the lattice has a greatest and a least element.
∴ A finite lattice is always bounded.
• Complemented lattice is defined only for bounded lattice. A bounded lattice is complemented iff
atleast one complement of every element exist in lattice. An element should one or more complements.

SY
• A complemented lattice is distributive iff every element has a unique complement.

Q.5 Consider a function f from A to B such that f : A → B is bijective. f –1 represents inverse of f. Which of the
following is incorrect?
(a) f –1 : B → A exist (b) f –1 : B → A is unique
(c) f –1 : B → A is bijective EA (d) None of these

5. (d)
f : A → B is bijective.
⇒ f : A → B is one-one (injective) f onto (surjective)
1. f : A → B is one-one ⇒ f –1 : B → A exists and it is unique.
⇒ f –1 is also one-one ...(1)
2. f : A → B is onto ⇒ f (A) = B
⇒ A = f –1(B) or f –1(B) = A ⇒ f –1: B → A is also onto ...(2)
E

from (1) and (2) f : B → A is bijective.

–1

Q.6 Consider of the following is/are valid:

1. ((p ⇒ q) ∧ (r ⇒ s) ∧ (p ∨ r)) ⇒ (q ∨ s)
AD

2. ((p ⇒ q) ∧ (r ⇒ s) ∧ (~q ∨ ~s) ⇒ (~p ∨ ~r)

3. ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r)
(a) 1 and 2 (b) 2 and 3
(c) 1 and 3 (d) 1, 2 and 3

6. (d)
M

1. is valid by constructive dilemma.

2. is valid by disjunctive dilemma.
3. hypothetical syllogious.
All of the above are known rules of inference.

3 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.7 Consider two sets A and B such that:

A∪B ⊆ A∩B
Then, which of the following is incorrect?
(a) A = { }, B = { } always (b) ⎪A⎪ = ⎪B⎪
(c) A = B (d) None of these

7. (a)
A ∪ B ⊆ A ∩ B holds true when A = B. It is true for empty as well as nonempty sets.
⇒ ⎪A⎪ = ⎪B⎪ is true ⎪A⎪ ≥ 0 eg. A = B {a, b}
Hence A = { }, B = { } “always” is false.

n
Q.8 Define a recursive function such that : f (n) = 102 , n ≥ 0 .

SY
(a) f(n) = f(n – 1) ∗ f(n – 2) (b) f(n) = f(n – 1) + f(n – 2)
(c) f(n) = (f(n – 1))2 (d) f(n) = 100 f(n – 1)

8. (c)
n n−1
f (n) = 102 , f (n − 1) = 102 EA n
f (n) (10)2
⇒ = n −1
f (n − 1) (102 )

f(n) = f (n − 1) ⎡⎢10
2n −2n −1 ⎤
⇒
⎣ ⎦⎥
n −1
⇒ f(n) = f (n − 1) ⎡⎢102 (2−1) ⎤⎥
⎣ ⎦
E

n−1
⇒ f(n) = f (n − 1) ⎡102 ⎤ ⇒ f (n) = ⎡f (n − 1)2 ⎤
⎣ ⎦
⎢⎣ ⎥⎦
AD
M

4 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.9 Which of the following statements are equivalent for graph with atleast 1 edge?
1. G is bipartite 2. A graph G is 2 colourable
3. Graph G has a Hamiltonian circuit 4. Every cycle of G is of even length
(a) 1 and 3 (b) 1, 2 and 3
(c) 1, 2 and 4 (d) 3 and 4

9. (c)
• If a graph is bipartite, then its two colourable. Because a bipartite graph can be represented as two
groups of vertices such that vertices in same graph are not adjacent.
Similarly, statement 2 is equivalent to statement 1.
• If a bipartite graph has a cycle, then it has to be of even length. Graph G is bipartite iff no odd length
cycle.
A

SY
B C This graph has a Hamiltonian circuit, but the cycle is of odd length.
∴ 3≡ 4

Q.10 Consider sets A, B and C such that ⎪A⎪, ⎪B⎪, ⎪C⎪ ≥ 0

A −C ⊆ A −B −C
1.

3.
A ∩ (B − A) = φ

( A ∩ B) ∪ ( A ∩ B ) = A
EA 2.

4. (A − C ) ∩ (C − B) = φ
Which of the above statements is/are always True?
(a) 1 and 3 (b) 1, 2 and 3
(c) 2 and 4 (d) 1, 3 and 4

10. (d)
E
All the statements are true when A, B, C, are empty sets.
Let us consider the case when A, B, C are non-empty.
1. A ∩ (B − A) = φ is true. B–A is the set of elements of B which are not in A. So, B–A and A has no
AD

common elements and hence A ∩ (B – A) = φ is always true.

2. Let A = {a, b, c}, B = {b}, c = {c}, A – C = {a, b} A – B – C = {a} clearly, A − C ⊆ A − B − C . Proof by
contradiction/example.
∪ ∪ A∩B=A
B=U –B
A B A B A∩B=φ
3. (A ∩ B) ∪ (A ∩ B) = A
(A ∩ B) ∪ (A ∪ B) = A
M

A∩B A∩B
4. A – C = elements of A which are not in C.
C – B = elements of C which are not in B.
∪
A B
C

A–B C–B
Clearly, A – C and C – B do not have common elements.

5 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Numerical Data Type Questions : Q. 11 to Q. 16 carry 1 mark each

Q.11 Consider complete graphs K5 and K6. Let X5 and X6 are number of perfect matching of K5 and K6
respectively. Then X5 + X6 = ________.

11. (15)
Number of perfect matching in a complete graph with even number of vertices, Xn = 1, 3, 5, . . . (n –1).
∴ X6 = 1, 3, 5 = 15
Number of perfect matching in a complete graph of odd number of vertices = 0.
∴ X5 = 0

∴ X5 + X6 = 15.

Q.12 Assumed undirected graph G is connected. G has 6-vertices and 10 edges. Find the minimum number of

SY
edges whose deletion from graph G is always guarantee that it will become disconnected.

12. (6)
Complete graph has nC2 edges (worst case) to make a connected graph atmost (n – 1) edges required.
To make it disconnected graph should contain (n – 2) edges.
EA ⇒

m = nC2 = 4C2 = 6 edges

nC– n + 2 = 6 – 4 + 2 = 4 edges deleted
2
∴ (m – n + 2) edges deletion always guarantee that any graph will become-disconnected.
E

i.e. 10 – 6 + 2 = 6 edges

Q.13 The number of solutions are there to the equation x1+ x2 + x3 + x4 + x5 + x6 = 31, where x1 ≥ 1, x2 ≥ 2, x3 ≥
2, x4 ≥ 4, x5 ≥ 6, x6 ≥ 5 are __________.
AD

13. (4368)
x′1 = x1 – 1 ; x1 ≥ 0
x′2 = x2 – 2 ; x2 ≥ 0
x′3 = x3 – 2 ; x3 ≥ 0
x′4 = x4 – 4 ; x4 ≥ 0
x′5 x5 – 6 ; x5 ≥ 0
M

=
x′6 = x6 – 5 ; x6 ≥ 0
The solution for an equation of type x′1 + x′2 + . . . + x′n = r
where, x′1, x′2, . . . , x′n ≥ 0 is n+r–1Cr
Number of solutions = n+r–1Cr
Here r = 31 – (1 + 2 + 2 + 4 + 6 + 5) = 11
x′1 + x′2 + x′3 + x′4 + x′5 + x′6 = 11
n = 6, r = 11
∴ Number of solutions = 6+11–1C11
= 16C11 = 4368

6 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.14 Let f and g : R → R be defined on R (R is a set of real numbers) as: f(x) = x + 2, g(x) = (1+x2)–1
Find the value of f–1g (3) _________?

14. (–1.9)
f(x) = x+2 Let y = f(x)
y = x+2 ⇒ x = f –1(y)
⇒ x = y–2
⇒ –1
f (y ) = y–2 or f –1(x) = x – 2
g(3) = 2 –1 –1
(1 + (3) ) = (1 + 9) = 1/10
–1
f g(3) = g(3) – 2
⇒ f–1 g(3) = 1/10 – 2 = –1.9

Q.15 The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = φ

SY
________.

15. (729)
When X = φ then y can be 26 = 64 choices.
X = 1 then y can be 25 = 32. Since 1 element of X can be any of 6 element,
X contain 1 element = 6c × 25 = 192
1
X = 2 then y can be 24 = 6c × 24 = 240
2
EA
X = 3 then y can be 23 = 6c × 23 = 160
3
X = 4 then y can be 22 = 6c × 22 = 60
4
X = 5 then y can be 21 = 6c × 21 = 12
5
X = 6 then y can be 20 i.e. φ = 6c × 20 = 1
6
Total pairs are = 64 + 192 + 240 + 160 + 60 + 12 + 1 = 729

Q.16 Number of ways to paint 16 offices such that 2 of them are red, 10 of them are green and remaining 4 are
E
blue ______?

16. (120120)
This problem reduces to selecting 10 offices from 16, then 4 from remaining 6.
AD

16

2 10 4
R G B

16!
i.e., number of ways = 120120 .
10! 4! 2!
M

7 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Multiple Choice Questions : Q.17 to Q.28 carry 2 marks each

Q.17 A binary relation R on Z × Z is defined as follows:

(a, b) R (c, d) iff a = c or b = d
Consider the following propositions:
1. R is reflexive. 2. R is symmetric.
3. R is antisymmetric.
Which one of the following statements is True?
(a) Both 1 and 2 are true (b) 1 is true and 2 is false
(c) 1 is false and 3 is true (d) Both 2 and 3 are true

17. (a)
R is reflexive: Since (a, b) R (a, b) for all elements (a, b) because a = a and b = b are always true.

SY
R is symmetric: Since (a, b) R (c, d) and a = c or b = d which can be written as c = a or d = b.
So, (a, b) R (a, b) is true.
R is not antisymmetric: Since (1, 2) R (1, 3) and 1 = 1 or 2 = 3 true b/c 1 = 1.
So (1, 3) R (1, 2) but here 2 ≠ 3 so (1, 2) ≠ (1, 3).
So, only statement 1 and 2 are correct. EA
Q.18 In how many different ways can 8 identical balls be distributed among three children if each receives at
least two balls and no more than four balls ________?
(a) 3 (b) 9
(c) 6 (d) 12

18. (c)
Let a, b, c be the number of balls distributed among 3 children respectively.
a + b + c = 8, a, b, c ≥ 2 and a, b, c ≤ 4
E

Let a = a′ + 2, b = b′ + 2, c = c′ + 2, a′, b′, c′ ≥ 0 and a′, b′, c′ ≤ 2

⇒ a′ + 2 + b′ + 2 + c′ + 2 = 8
⇒ a′ + b′ + c′ = 2
AD

Since a′, b′, c′ ≥ 0 a′, b′, c′, can never exceed 2, such that above equation holds true.
This is equivalent to integral solutions of
x1 + x2 + x3+ . . . xn = r ,
x1, x2, x3, . . . xn ≥ 0
which is equal to n+r–1Cr
n = 3, r = 2 ∴ n+r–1C = 3+2–1C = 4C
r 2 2
M

4×3
4C
2 = =6
2

8 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.19 Let {p, q, r, s} be the set. A binary operation ∗ is defined on the set and is given by the following table
∗ p q r s
p p r s p
q p q r s
r p q p r
s p q q q
Which of the following is true about the binary operation?
(a) It is commutative but not associative
(b) It is associative but not commutative
(c) It is both associative and commutative
(d) It is neither associative nor commutative

SY
19. (d)
The operation is not commutative as since upper and lower triangle is not same.
q ∗ p = p and p ∗ q = r
The operation is not associative as p ∗ (q ∗ r) ≠ (p ∗ q) ∗ r
LHS p ∗ r = s
RHS r ∗ r = p EA
Q.20 Consider the following statements.
Let G be a connected graph of order n where n ≥ 3.
S1: If d(V) ≥ n/2 for each vertex V in G, then G is hamiltonian. [d(V) is the degree of a vertex V]
S2: If every vertex in G has even degree then G is eulerian.
Which of the above statements are correct?
(a) Only S1 (b) Only S2
(c) Both S1 and S2 (d) Neither S1 nor S2
E

20. (c)
S1 is true but converse of S1 is not true. (Dirac theorem)
S2 is true and converse of S2 is also true because G is connected graph. (Eular graph theoram)
AD

Q.21 Consider the following graph:

B
A C

G D
H
M

F E

Which of the following will represents the chromatic number of the graph?
(a) 3 (b) 4
(c) 5 (d) 6

9 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

21. (b)
d(i) = Degree of node i. d(A) = 4, d(B) = 4, d(C) = 5 d(D) = 4, d(E) = 3, d(F ) = 6, d(G) = 4, d(H) = 6 using
Welsh-powell’s algorithm.

B
R G

G B
R

B G
Chromatic number = 4.

Q.22 Let X, Y, Z be sets. ⎮X⎮ is cardinality of X represents number of elements in X and P(X) is power set of X.
Assume ⎮Y⎮ = k and ⎮Z⎮ = n. If X = Y × Z and W = P(X) then find the number of functions from X to W.

SY
2
(a) 22nk (b) n(kn)
2
(c) 2(kn) (d) None of these

22. (c)

X = Y×Z ⇒ ⎮X⎮ = kn

W = P(x) ⇒
EA ⎮W⎮ = 2kn

f : X→W

( )
kn 2
# functions = ⎮W⎮⎮X⎮ = 2kn = 2(kn)

So option (c) is correct.

E

Q.23 The function f is mapped from natural numbers to integer numbers and f (x) = x2 – 2x + 3. Consider N =
{0, 1, 2, 3, . . .} and Z = {. . . , –2, –1, 0, 1, 2, . . . }. What is the function f ?
(a) Injective function (b) Surjective function
AD

(c) Bijective function (d) None of these

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

10 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.24 Consider the following lattice

g

h i
j

a f e d b

SY
c

How many number of complements for the element ‘b’?

(a) 1 (b) 3
(c) 5 (d) 7

24. (a)
LUB = g, GLB = c
b ∨ h = g and b ∧ h = c
EA
∴ b has only 1 complement [complement of a = h]
[Note: x and y are complement to each other iff x ∨ y = 1 (Greatest element) and x ∧ y = 0 (least element)]

Q.25 In an examination of 9 papers a candidate has to pass in more papers than the number of papers in which
he fails in order to be successful. The number of ways in which he can be unsuccessful is ______________
E
9! 9!
(a) +1 (b) −1
2 2
(c) 28 (d) 28 – 1
AD

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

{ }
Q.26 Let G be a graph with V(G) = i ⎥ 1 ≤ i ≤ 4n, n ≥ 1 where V(G) is the set of vertices of G. Such that two
M

numbers x and y in V(G) are adjacent if and only if (x + y) is a multiple of 4. Assume there are k components
each component Ck has mk vertices, then what is the maximum value of mk in the graph G?
(a) n (b) 2n
(c) 3n (d) None of these

11 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

26. (b)
Let n = 2 ⇒ # vertices = 8 [∵ # vertices in G = 4n]

1 2 3 4

5 6 7 8

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

V(C1) = {1, 3, 5, 7} ⇒ m1 = 4⎫

SY
⎪
V(C2) = {2, 6} ⇒ m2 = 2 ⎬ max = 4
V(C3) = {4, 8} ⇒ m3 = 2 ⎪⎭

Q.27 Consider there are n courses and 2n toppers. Each course has 2 toppers. Which of the following represent
no. of way to assign 2n topper for n courses?

(a)
(2n)!
2n
EA (b)
(2n)!
n!
(2n)!
(c) (d) (2n )!
2n n !

27. (a)
There are n courses i.e. c1, c2, c3 ... cn.
The no. of ways to select toppers of course 1 = 2nc2 ways
E

The no. of ways to select toppers of course 2 = (2n – 2)c2 ways

The no. of ways to select toppers of course 3 = (2n – 4)c2 ways
The no. of ways to select toppers of course 4 = (2n – 6)c2 ways
AD

.
.
.
The no. of ways to select toppers of course n = 2c2 ways
So total number of ways to assign 2n toppers for n courses are =
2nc × (2n – 2)c × (2n – 4)c .... × 2c
2 2 2 2
(2n)!
=
2n
M

OR
This is ordered problem two divided ‘2n’ toppers to ‘n’ cource with each cource ‘2’ toppers
2n

2 2 2 2.....2

(2n)!
=
2n

12 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.28 Solve the following recurrence relation:

T(n) = 9T(n – 1) – 20T(n – 2), T(0) = –3, T(1) = –10
(a) 2.5n – 5.4n (b) 3.5n – 4.3n
(c) 3.4n – 2.5n (d) 4.5n – 2.3n

28. (a)
T(n) – 9T(n – 1) + 20T(n – 2) = 0
Let an = T(n)
⇒ an – 9an–1 + 20an–2 = 0
t2 – 9t + 20 = 0
t2 + 5t – 4t + 20 = 0
t(t – 5) – 4(t – 5) = 0

SY
(t – 4)(t – 5) = 0
t = 4, 5
Homogenous equation become
an = c1. 5n + c2.4n ...(1)
Put n = 0 in eq. (1)
a0 = c1. 50 + c2.40
EA
–3 = c1 + c2 ...(2)
Put n = 1 in eq. (1)
a1 = c1. 51 + c2.41
–10 = 5c1 + 4c2 ...(3)
Solving equation (2) and (3) and get c1 and c2
(c1 + c2 = –3) × 5
5c1 + 4c2 = –10
5c1 + 5c2 = −15
E

5c1 + 4c2 = −10

c2 = − 5 and c1 = 2
AD

Put value of c1 and c2 in eq. (1)

an = 2.5n – 5.4n

Numerical Data Type Questions : Q.29 to Q.33 carry 2 marks each

Q.29 Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive
relation set S}. The number of relation which are symmetric _______.
M

29. (6)
Set S = {a, b}
2 2
Total number of binary relation = 2n = 22 = 24 = 16
16 binary relations are given below.
{ } {(a, a)} {(a, b)} {(b, a)} {(b, b)}
{(a, a), (a, b)} {(a, a), (b, a)}
{(a, b), (b, a)} {(a, b), (b, b)} {(b, a), (b, b)} {(a, a), (a, b), (b, a)}
{(a, a), (a, b), (b, b) {(a, a), (b, a), (b, b)} {(a, b), (b, a), (b, b)}
Out of 16 binary relation only 8 are symmetric relation but only 6 relations are there which are symmetric
but not reflexive.

13 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.30 A permutation group ‘P ’ is defined as a one-one mapping of non-empty finite set X, onto itself i.e.,
P : X → X.
where X = {1, 2, 3, . . ., n}
S is the set of all permutations ‘P ’ on X.

⎛ 1 2 3  n ⎞ ⎛ 1 2 3  n ⎞
P1 = ⎜ , P2 = ⎜ and so on
⎟
⎝ P1(1) P1(2) P1(3)  P1(n)⎠ ⎝ P2(1) P2(2) P2(3)  P2(n)⎟⎠
What is the cardinality of power set of S ________? Given n = 3

30. (64)
Permutation ‘P ’ is bijective mapping from X to X.
⇒ Number of possible permutations = n !
when n = 3

SY
Number of possible permutations = 3! = 6
∴ ⎪S⎪ = 6 where S = set of all permutations ‘P ’ on X.
Number of elements in power set of S = 26 = 64

Q.31 Consider the set S = {1, 2, 3, . . . , 25}. The number of subsets T ⊆ S of size five such that T has at least
one odd number in it is _________. EA
31. (52338)
Total number of subset of 5 element = 25C5

25 × 24 × 23 × 22 × 21
=
5 × 4 × 3 × 2 ×1
= 23 × 22 × 21 × 5 = 53130
T be a subset contain no odd number = 12C5
12 × 11 × 10 × 9 × 8
E

= = 792
5 × 4 × 3 × 2 ×1
So number of subset with atleast 1 odd number
AD

T ⊆ S = 25C5 – 12C5
= 53130 – 792 = 52338

Q.32 The number of positive integer less than or equal to 1000 that are relatively prime to 15 are _____.

32. (533)
A number is relatively prime to 15 iff it is not divisible by 3 and not divisible by 5.
M

Set of integer from 1 to 1000 divisible by 3 = ⎢⎢

1000 ⎥
⎥ = 333 .
⎣ 3 ⎦

Set of integer from 1 to 1000 divisible by 5 = ⎢⎢

1000 ⎥
⎥ = 200
⎣ 5 ⎦
So, number of integer not relatively prime to 15 are
⎢1000 ⎥
⎪A ∪ B⎪ = A + B − A ∩ B ⎢ 15 ⎥ = 66
⎣ ⎦
= 200 + 333 – 66
= 467
So, number of integer relatively prime to 15 are

A ∪ B = 1000 – 467 = 533

14 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY

 Delhi | Noida | Bhopal | Hyderabad | Jaipur | Indore
Lucknow | Pune | Bhubaneswar | Kolkata | Patna GTOCS17

Q.33 Consider a bit-string of length 10 containing only 0 and 1. The number of string contain exactly 3 0’s or
exactly 3 1’s are ________

33. (240)
⎪A ∪ B⎪ = A + B − A ∩ B

= 10C3 + 10C3 – 0
= 2 × 10C3

10 × 9 × 8
= 2×
1× 2 × 3
= 30 × 8 = 240

SY
„„„„

EA
E
AD
M

15 • Discrete Mathematics (Basic Level) www.madeeasy.in © Copyright : MADE EASY