ASSERTION -REASON BASED MCQs

STATEMENT-1 (Assertion) and STATEMENT-2

Each of the following questions contains
has following four choices (a), (b)., (c) and (d), only one of which is the correct
(Reason) and
answer. Mark the correct choice.
acorrect explanation for statement-1.
(a) Statement-1 is true, Statement-2 is true: Statement-2 is
a correct explanation for
(b) Statement-1 is true, Statement-2 is true: Statement-2 is not
statement-1.
(c) Statement-1 is true, Statement-2 is false.
(d) Statement-1 is false,Statement-2 is true.
1. Statement-1 (Assertion): LetA and Bbe twosets having mand n elements respecthvely,
then the number of relations form A to B is 2m"
Statement-2 (Reason): A relation from A
to Bis a subset of AxB.
2. Statement-1 (Assertion): Let A be a setconsisting ofnelements. The number of reflexive
relations on A is 2n (7-1)
Statement-2 (Reason): A relation on setA is a non-empty subset of Ax A.
3. Statement-1 (Assertion): Thenumber of reflexive relations on set A={1, 2, 3, 4, 5}
is 2 .
Statement-2 (Reason): The number of reflexive relations on a set A
elements is 271(1-1) consisting of n
4. Statement-1 (Assertion): The number of reflexive
relations on a set A consisting of n
elements is 21-n
Statement-2 (Reason): A relation R on set A is
5.
Statement-1 (Assertion): reflexive if (a, a) e R for all a e A.
The identity relation on a
set A is an
Statement-2: (Reason): The universal
relation on a set A is an
equivalence relation.
6. Statement-1 (Assertion): The
relation I ={(x, x), (y, y),
on set
equivalence
relation.
(z, z),(t, t)} is the
A=(x, y,z, t}.
Statement-2 (Reason): A
relation Ion a set A identity relation
is
Ais related to
itself. the identity relation if
7. Statement-1 (Assertion): For the every element of
A={1, 2, relation R
Statement-2 (Reason):
3 to be =(1,1),
transitive, (2, 2), (3, 3),
we (1, 2),
A
relation R ona set A is must have (1,3) (2,
e R.
3)) on set
(a, b) e R and
(b, c) transitive. if
8. Statement-1 (Assertion): Atransitive eR»(a, c) e R.
Statement-2 (Reason): If Ris a relat
transitive
io n on aset A
is
relati on on a setalways a
9. Statement-1 (Assertion):
(a, b) e Rand
The relation R
(b, a) e
R>(a, a) e
A,
Rfor
then reflexiv e relation.
A={1,2, 3). =(1,1), all a, b e A.
Statemernt-2 (Reason): Arelation Ron a
set A
(2,2), (3,3),(1, 3)| is
itself only.is a
reflexive relation if reflexive on the set
is related to
RELATIONS 1.17

10. Statement-1(Assertion): The relation R ={(p, p)} on set A={p, q, r) is an equivalence

relation.
Statement-2 (Reason): The relation R ={(p, p)} on set A =\p,q, r} is symmetric and
transitive but not reflexive.

CASE STUDY BASED MCQs

1. Mohit is persuing his B.B.A. Course from a reputed institute. For his college project he
Visited twosocieties in Gurugram and prepared the lists of school going kids from the two
societies. Let A =a, ay, ag, a4, a5) and B=b,, b, b3, b¡) be the sets of school going
students of societies S, and S respectively. Using the above information answer the
following questions:
(i) The number of relations from A to B is
(a) 20 (b) 29 (c) 210 (d) 220
(ii) Mohit wants to define areflexive relation on set A. The total number of such relations
is
(a) 225 (b)25 (c) 220 (d) 210
(iii) The number of symmetric relations on set Bis
(a) 210 (b) 216 (c) 212 (d) 26
(iv) The number of relations on A which are not reflexive is
(a) 220 (b) 220x 15 (c) 22x 31 (d) 220 x33
(v) The relation R ={(a, b) : a and bare students of the same age} on set A is
(a) reflexive only (b) reflexive and symmetric but not transitive
(c) symmetric and transitive but not reflexive (d) an equivalence relation
2. Aarushi and Mira are playing monopoly in their house during COVID. While rolling the
die their common friend Avni noted that the outcomes of throw every time is one of the
elements of the set {1, 2,3, 4, 5,6 }. Let A denote the set of players and Bbe the set of all
possible outcomes on the upper face of the die. Then, A=A, M and B={1, 2, 3, 4, 5, 6}.
Based on the above information answer the following questions:
(i) The total number of relations from A to B is
(a) 62 (b) 26 (c) 12 (d) 212
(ii) The relation R ={(1, 2) (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (5, 5)) on set Bis
(a) reflexive (b) symmetric (c) transitive (d) none of these
(ii) The relationR ={(1, 1), (1, 2), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)}) on set Bis
(a) reflexive and transitive (b) symmetric
(c) symmetric and transitive (d) an equivalence relation
(iv) The number of equivalence relations on set A is
(a) 4 (b) 6 (c) 2 (d) 8
(v) The number of symnetricrelations on Bis
(b) 221 (c) 212 (d)215
(a) 236
28. (c) 29. (d) 30. (c) 31. (b) 32. (a)
ASSERTION -REASON BASEDMCQs
1. (a) 2. (c) 3. (a) 4. (a) 5. (b) 6. (c) 7. (a) 8. (c) 9. (c)
10. (d)
CASE STUDY BASED MCQs
1. (i) (d) (ii) (c) (iii) (a) (iv) (c) (v) (d)
2. (i) (d) (ii) (d) (iii) (a) (iv) (c) (v) (b)

ACTIVITIES
 (1) =1+y?- for aII X 2I

So, Statement-2 is correct.

Since f is a bijection. Therefore, equations f(r) = f ) and f(r) =x have the same solution set.
(x:f() =f()) = (r:f(x) =x=|x:(r-1)+1 =x} ={1,2)
Hence, Statement-1 is also correct and Statement-2 is a correct explanation of statement-1.

CASESTUDY BASED MCQs

EXAMPLE 1 In two different societies, there are some school going students including boys as well as
girls. Raman forms two sets with these students as his college project. Let A =\a1, ag, az,
a4, as) and
B=b, b ,b3 b4l, where a's andb;'sare school goingstudents offirst and second society respectively.
Using the above information, answer the following
questions:
() The mapping f ={(a1,b), (az, bg), (a3, b2), (a4, b¡), (a5, b¡)} associating students of first
society to the students of second society is
(a) one-one but not onto
(b) only onto but not one-one
(c) one-one and onto both (d) neither one-one nor onto
(iü) The number of functions from A to B is
(a) 20 (b) 54 (c) 45 (d) 5P
(ii) The number of functions from B to A is
(a) 20 (b) 54 (c) 45 (d) 5PA
(iv) The number of one-one functions from A toB is
(a) (b) 54 (c) 45 (d) 0
(v) The number of ontofunction from A to B is
(a) 240 (b) 480 (c) 1024 (d) 512
SOLUTION (i) Ans. (b): We observe that f(a) =f(a5) =b, and range (f) =B=co-domain.
So,f is many one onto function.
(ii) Ans. (c): Each element in Acan be mapped to any element in B. So, each element in A can be
mapped in 4 ways. There are 5 elements in A.So, number of functions from A to Bis 45
(ii) Ans. (b): The number functions from BtoAis (xA)y B) ie. 5.
(iv) Ans. (d): Set A has more elements than set B. So, one-one functions cannot be
A to B.
defined fronm
4
(v) Ans.(a): Number of ontofunctions from AtoB= )(-1) C, =240.
r=1

EXAMPLE2 Anorganization conducted bike race under 2 different categories- boys and girls. Totally
there were 250 participants. Among allof them finally three from Category 1and two
were selected for the final race. Raviforms tuwO sets Band Gwith these from Category 2
participantsfor his college project.
 2.12

Let B=(b,b, bgl MATHEMATICS-XI

selected for the final G=81.82}
race.
where Brepresents the set of boys selected and Gthe set of girls who were

Fig. 2.3
Ravidecides to explore these sets for
various types of relations and functions
(1) Ravi wishes to form all the
relations possible from Bto G. How many such
(a) 26 (b) 25
relations are possible?
(c) 0 (d) 23
(ii) Ravi wants to know among
those relations, how many functions can be
(a) 22 formed from B to G?
(b) 212 (c) 32
(iüü) Letf:B’G be defined by f (d) 23
=\(b, 81)}, (b2 2), (b3. 8)), then f is
(a) injective
(b) surjective
(c) neither surjective nor
injective (d) surjective and injective
(iv) Ravi wants to find the number of
injective functionsfrom Bto G. How many numbers of
functions are possible? injective
(a) 0 (b) 2! (c) 3! (d) 0!
(v) The number of surjective functionsfrom Bto Gis
(a) 8 (b) 6 (c) 4 (d) 64
SOLUTION (i) Ans. (a): Number of relations from B to G=23 x2 6
(ii) Ans. (d): Number of functionsfrom Bto G= n(G)}B) -23
(iiü) Ans. (b): We observe that f(b) =fb) =81
and range () =G (co-domain). Therefore, f is
surjective but not injective.
(iw) Ans. (a): We find that set Bhas
more elements than set G.So, a one-one function cannot be
defined from B to G.

(v) Ans. (b): The number of surjections from BtoGis

}(-1)2- ,3 2c, =-2+23 =6
r=1

EXAMPLE 3 Raji visited the exhibition along with her

family. The exhibition had a huge swing. which
attracted many children. Raiji found that the swng traced a parabolic path
given by u=2
 from A to Bis 5b (c) 7 8
(b) 5
(a) 3
BASED MCQs
ASSERTION -REASON
statement-1 (Assertion)and STATEMENT-2(ReasOn
contains
Each of the following questions (d), only one of which is the correct answer. Mark
(b), (c) and
and has following four choices (a),
the correct choice.
9
is a correct explanation for Statemnent-1,
(a) Statement-1 is true, Statement-2 is true; Statement-2
explanation for
(b) Statement-1 is true, Statement-2 is true; Statement-2 is not acorrect
Statement-1.

(c) Statement-1 is true, Statement-2 is false. 1

(d) Statement-1 is false, Statement-2 is true.

1. Statement-1 (Assertion): Let m, n be natural numbers other than 1. Then,
(i) 2" > and (ii) 2n >m'.
Statement-2 (Reason): Every function is a relation but a relation need not be a
function.
2. Statement-1 (Assertion): Let Aand Bbe two sets having m
andnelements respectively
such that n>m. Then, n" >"Cy Xm!.
Statement-2 (Reason): A function f from set A to
set B is an injection if
elements are related to distinct
of A distinct
3. Statement-1 (Assertion): elements of set B.
Iff:(x, y, ’{1,2, 3} is aone-one
of the function suchthat only one
following statements is correct
false: and the remaining are
 (i) f(1) # 2 (ii) f(y) =2 (ii) f(z) +1
Then, f ={(x,2), (y,1), (2,3))
Statement-2 (Reason): Every injective map from a finite set to itself is a bijection.
4. Let f:Z ’Z be a function defined by f(x) =ax+bx +c.
Statement-1 (Assertion): cis aninteger.
Statement-2 (Reason): a+b is a integer.
5. Statement-1 (Assertion): The function f:Z Z defined by f(r) =5x+12isa surjection.
Statement-2 (Reason): The function f:R ’ Rdefined by f(x) =5x+ 12 is a bijection.
6. Statement-l (Assertion): The function f : R ’ Rdefined by f(x) =[x] is neither one-one
nor onto.

Statement-2 (Reason): The function f:R ’R defined by f(x) =| x| is onto.

7. Statement-1 (Assertion): If f:R ’R and g:R ’R are defined by f(x) =X+1 and
s(r) =x+2, then fog() =gof(x) for all x e R.
Statement-2 (Reason): The composition of functions is commutative.
8. Statement-1 (Assertion): Let A and B be two finite sets having mandnelements
respectively such that m sn. Then, the number of one-one
functions from A to Bis "Cm x m!.
Statement-2 (Reason): A function f: A ’ Bis a one-one function iff distinct elements
of set A are mapped to distinct elements of set B.
9. Statement-1 (Assertion): Let A and B be two finite sets having m and n elements
respectively. Then, the number of functions from A to B is".
Statement-2 (Reason): Every function from setA toset B is a subset of A xB.
10. Statement-1 (Assertion): A function f:A ’ Bcannot be an onto function, if n(A) <n(B).
Statement-2 (Reason): Afunction f:A ’ B is an onto function if each element in B
has at least one pre-image in A.

11. Statement-1 (Assertion): If A-{0, 1, 2} and the function f:A B defined by

f(x) =x-2 is an onto function, thern B=(-2, -1, 0}.

Statement-2 (Reason): If f:A ’ Bisan ontofunction, then f(A) = B.

12. Statement-1 (Assertion): The function f:R ’R defined by f(x) =x°+1 is a bijection.

Statement-2 (Reason): Every poiynomialfunction is a bijection.

is not one-one.
13. Statement-1 (Assertion): The function f:R ’R defined by f(x) = ²+1

4
Statement-2 (Reason): f(4) = and
17
 20. 31. (C)
19. (c) 30. (a)
29. (b) BASED MCQs
28. (c) -REASON 8. (a)
ASSERTION 7. (c)
6. (c)
4. (b) 5. (d)
2. (a) 3. (b) 13. (a)
1. (a) 12. (c)
10. (a) 11. (a)
9. (b) ACTIVITIES

ACTIVITY-1
ot.