SOLVED EXAMPLES

MULTIPLE CHOICEQUESTIONS (MCas)

EXAMPLE 1 Let CfxeR:x20} Further
A= {reR:-1sxs1}= B and, let
S={(x,y) e Ax B:2+=) and S. =l(x. )eA xC:x+ y 1}. Then,
(a) S defines a function from A to B
(b) So defines afunction from A to B
(c) S defines a function from AtoC
(d) Sdefines afunction from A to C
Ans. (c)
SOLUTION We observe that S is the set of all noints on the circle x +y = las shown in
Fg. 2.1(a) and So is the set of all points on the semi-circle x +y=1 shown in Fig- 2.1 (b). In
Fig. 21(a), we can draw vertical lines intersecting x +y=1at two points. So, by
using vertica
me test, S does not define a function from Ato B. Clearly, Fig. 2.1
(b) shows that S defines
function from A to C.
Y
(0, 1) Y^
(0, 1)
B
(-1,0), (1,0)
X< X
(-1,0)|
X< (1, 0)
X
A
(0,-1)
Y
(a)
(b)
Fig. 2.1
 FUNCTIONS 2.3

2x ; X>3
TNAMOLE lt f:R -’ Rbe defined by f() *; 1<xs3.Then, f(-1) +f(2) +f(4) is
3* ;
(a) 9 (b) 14 (c) 5 (d) none of these
Ans. (a) INCERT EXEMPLARJ
sOLUTION We find that -1<1 and f(x) =3x for xs1. Therefore, f(-1) =-3. Similarly,
f(2) =2 =4 and f(4) =2x 4 =8. Therefore, f(-1) +f(2) + f(4) =-3+4+ 8 =9.
EVAMPLE 3 Letf:RR be defined as f(x) =cos [a] x +cos [-x, then
(a) 0 (b) -1 (c) 1 (d) 2
Ans. (c)
SOLUTION We have, f(x) =cos [lx+ cos -]x for all xeR
3T
f(x) = cos 3x+ cos-4x) = cos 3x +cos4x ’ + cos 2=0+1 =1
2

EVAMPLE 4 ff() =coslel x+ cos[-elx, then fl 4 -

1 1
(a) 1 (b) 0 (c) (a)
Ans. (d)
SOLUTION We have e ~ 2.71
f() =cos[e]x + cos -ex= cos 2x+ cos(3x) = cos2x+ cos 3x
COS + cOS 3r 1
2 42
EXAMPLE5 Let f:[2, o) ’ Rbe the function defined by f(x)=x-4x+5. Then the range off is
(a) R (6) 1, 0) () (4, o) (d) 5, o)
Ans. (b) [NCERT EXEMPLAR)
SOLUTION We have, f(x) =x-4x +5=(x-2) +1
Now, x e[2, o) => x-220 ’ (-2)+121 ’ f() 21 »f() e1, o)
Hence, range (f) =[l, o).
ALITER We have, f(r) =x-4x +5 for all x e 2, oo)
f(x) =2x-420 for all xe[2, o)
f(x) is increasing function on (2, o) ’ Range (f) =f(2), f()) =1, o)
EXAMPLE 6 Letf:R ’Rbe defined by f(x) =x+1.Then, pre-images of 17 and-3, respectively, are
(a) ¢, (-4, 4) (b) (-3, 3),¢ (c) (-4, 4), (a) (-4, 4,(-2, 2}
Ans. (c)
[NCERT EXEMPLARJ
SOLUTION Let the pre-images of 17 and-3 be a andb respectively. This means that the
of aand bare respectively 17 and -3. images
ie. f(a) =17 and f(b) =-3.
a+1=17 and b +1=-3 ’ a= 4 and b +1= 3is not pOssible for
any b e R.
Thus, the pre-images of 17 and-3 are (-4, 4 and o
respectively.
 MATHEMATICS-XII
2.4

N’N be defined byf) =2n+3

EXAMPLE 7 Let Nbe the set of natural numbers and the function f :
for all n eN. Then, fis
() bijective (d) none of these
(a) surjective (b) injective INCERT EXEMPLARI
Ans. (b)
SOLUTION Letm, ne N be such that f(m) = f(r). Then,
f(m) =f ) ’ 2n+3=2n +3’ m=n
So, f:N’Nis injective.
2n2 ’21 + 325 >
f(n) 25
Let nbe any natural number. Then, n>1
J’Nis not surjective.
Thus, range(f) =5,7,9,..} *Co-domain = N. So,f:N-
is
EXAMPLE8 The equivalent definition of f :R-{0}’ Rgiven by j(*) = |x|

(a) f() =0for all x eR-{0) (b) f() =-2 for allx eR-{0)
0, x>0
0, x>0
|-2, x <0 (a) f() =|2, x<0
Ans. (c)
SOLUTION We know that : |x= , x<0
=0, x>0

x-(-)-2, x<0
EXAMPLE 9 Iff(x) =4r°+3x+3x+4, then.
1
(a) f(-x) (b) (d) f()
f(x)
Ans. (d)
SOLUTION We have, f(x) =4x+3x+3x+4
3
7t+4’
2

EXAMPLE 10 Letf:R’R be defined as f(*) =2x +|x|,then f(2*) +f(-)-f(*) =

(a) 2x (b) 2|| () -2x (d) -2|x|
Ans. (b)
sOLUTION f(2x) +f(-*)-f*) = 2(2:) +|2x|+(-2:) +-x|-(2x +| x)
= 4x +2|2x-2x+|x|-2x -| x|=2|x|
EXAMPLE11 -for allallxv eR. Then, f is
Let f:R ’R be defined buf()=for
(a) one-0ne (b) onto (c) bijective (d) not defined
Ans. (d) [NCERT EXEMPLARJ
SOLUTION We find that f(x) is not defined at x=0. So, option (d) is correct.
 FUNCTIONS 2.5

EXAMPLE12 Let f:R -(O ’ Rbe defined by f(x) -.Then, f is

(a) oneOne (b) onto (c) bijective (d) not defined
Ans, (a)

sOLUTION For any x,yeR-(0, we find that: f(x) =f(y) »2=r=y. So, fis one-one.
For any xeR-{0,f() =y» =y»x=-.Since x+ 0. So, ytakes all real values except 0. So,
Range (f) =R-{0 # Co-domain. Hence f is not onto.
EXAMPLE13 Let A=(0, 1) and Nbe the set of naturalnumbers. Then the mayping f:N’A defined
by f(21 1) =0, f(2ri) =1 for all neN,is
(a) one-one (b) onto () abijection (d) one-one but not onto
Ans. (b) [NCERT EXEMPLARJ
SOLUTION The mapping frelates all odd natural numbers to 0 and all even natural numbers
to 1. So, it is not one-one. But, it is onto because range () =(0,1} =A.
EXAMPLE 14 LetA =1, 2, 3, ....) and B=\a, b). Then the number ofsurjectionsfromAinto Bis
(a) "P (b) 2" -2 (c) 2-1 (d) none of these
Ans. (b) [NCERT EXEMPLARJ
SOLUTION Each element of set Acan be mapped to either a orbi.e. in twoways and there are n
elements in A.So, total number of functions fromA to B is 2".Out of these only twwo functions are
intoone in which all elements of A are mapped to a and the other under which all elements are
mapped to b. Hence, the total number of onto functions is 2-2.
ALITER Total number of onto function = (-1)'- c, =-C+C, x2" =2"-2
r=1
EXAMPLE15 Ifthe set A contains 5 elements and set B contains 6 elements, then the number of
one-0ne
mappings from A to Bis
(a) 720 (b) 120 () 65 (d)56
Ans. (a)
SOLUTION The number of one-one mappings is equal to the number of ways of
elements in Bby taking 5at a time, which is equal to "C; x5!=720. arranging6
EXAMPLE 16 Ifthe set A contains 5 elements and set Bcontains 6 elenents,
then the number of one-one
and onto mappings from AtoBis
(a) 720 (b) 120 (c) 0
Ans. (c) (d) none of these
SOLUTION We find that the set Bhas more elements than the set A. [NCERT EXEMPLARJ
So there cannot be an onto
mapping from Ato B. Hence, the number of one-one onto
mappings is
EXAMPLE 17 Which of the following functions from Z to Z is a bijection? zero.
(a) f(x) =x3 (b) g(x) =X+2 (c) f(x) =2x +1 (d) f(x) =+1
Ans. (b)
SOLUTION f:Z’ Zgiven by f(x) =x° is an injective map but it is
range (f) ={0, ±1, 8, ± 27,..]+ Z not surjective, because
Function g:Z’Zgiven by g(x) =x+2 (Co-domain). option (a) is not correct.
So,
is
It is also onto, becausefor any every y eZ one-one, because gl) =g(y) =+2=y+2’ *=y.
fy-2) =y. So, gis abijection. (Co-domain) there exists y-2 eZ (domain) such that
 2.6 MATHEMATICS-XII

Function h:2 ’Z given by h(a) 2+1 is one-one, because

h(x) =hy) 2x+1 2y +1 =>x=y.
Itis not onto, because even integers in co-domain do not have there pre-images in the domain.
:2’Z given by oa) =+1is many-one, because (-2) = (2). So, option (d) is incorrect.
2x-1
EXAMPLE 18 Letf:N’ Rbethe function defined by f(x) = -and g:Q ’Rbe anotherfunction
2

defined by s(a) =*+2. Then, gofis

(a) 1 (b) 2 C) (d) none of these
2
Ans. (d) [NCERT EXEMPLAR.
SOLUTION We have, f(x) =2x-1
2 and g(:) =x+2 > f=1 and g1) =3

..
1) = 3

x-1) 2x-1-+2 =x+’

ALITER gf() =gf(«) =g 2 2 2

EXAMPLE 19 Letf:R ’R,g:R’ Rbe defined by f(*) =3x-5 and g(*) =2, .Then, gof() is
3x-5 3x-5 332 3z2
(a) (b) (c) (d)
9x-30x+26 9x-6x+26 +2x-4 9 +30x'-2
Ans. (a) [NCERT EXEMPLAR]
3x-53*-5
SOLUTION gof() =g¯()) =g(3x-5) =
(3x-5)+1 9x*-30x+26
EXAMPLE 20 Let f:R R be given by f(x) =tan x. Then, f ) is
T
(d) none of these
(a) 4
() n+neZ} (c) does not exist
Ans. (b) [NCERT EXEMPLAR)

SOLUTION Let f(1) =x.Then, f(x) =1’ tanx=1’ tan x =tan

4

rw=*nez
EXAMPLE 21 Function f:R ’Rgiven by f(x) =x+Vx is
(a) injective (b) surjective () bijective (d) none of these
Ans. (d)
2x, x 0
sOLUTION We have, f(x) =x+v*² =x+|x\ =4 0, x<0
Graph off(x) is shown in Fig. 2.2. Clearly, it is not one-one because all negative real numbers are
mapped to zero. Also, f(r) is not onto because range (f) =[0, o) +R(co-domain).
 FUNCTIONS 2.7

YN
A y=2x

y=0
X

Fig. 2.2 Graph of f(x) =x+

EXAMPLE 22 Iff(r) =sinxandthe compositefunction g(f() =|sin x|, then g(x) is equal to
(a) vr-1 (b) Vz (c) Vx+1 (d) -vr
Ans. (b)
SOLUTION We have,
f() =sinx and g(f() =|sin x| > g(sinx) =| sin x=Vsinx ’ g) =wz
EXAMPLE 23 Let f:R ’Rbegiven by f(x) = 3x+4, then f() =
x+4 x+3 X-3
(a) (b) (d)
3 4 3 4
Ans. (c)
SOLUTION Clearly,f:R ’R is a bijection. So,fexistssuch that
fof ()=x» ff) =x 3f)+4 =x*f9= 3

EXAMPLE 24 Ifgf(x) =| sin x| andf(g()= (sin x), then

(a) f(x) =sinx, g(r) =Vr (b) f(x) = sin x, g() =|x|
(c) f() =r, g) =sin r (d) fand g cannot be determined.
Ans. (a)
SOLUTION We have,
sf() =|sin x and f (a{2) =(sin V
’
gð(0) =Vsin'x and f(g(*)) =sin f)=sin?x and g()-t
ASSERTION-REASON BASED MCQs
Each of the following examples contains STATEMENT-1 (Assertion) and STATEMENT-2
(Reason) has following four choices (a), (b), (c) and (d), only one of which is the correct answer.
Mark the correct answer.
(a) Statement-1 is true, Statement-2 is true; Statement-2 is acorect explanation for Statement-1.
(b) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for
Statemernt-1.
(c) Statement-1 is true, Statement-2 is false.
(d) Statement-1 is false, Statement-2 is true.
EXAMPLE 1Statement-1 (Assertion): IfAand Bare tw0 sets having 3and 5 elements respectively,
then the total number offunctions that can be defined fromA to
Bis 53
 2.8
MATHEMATICS-X
Stalement-2 (Reason): Afunction from set Ato set B relates elements of set A.
elements of set B.
Ans. (c)
SOLUTON Afunction from set Ato Brelates everyelement of set Ato a unique element insetB
Consequently, statement-2 is not true.
Since, each element of set A can be associated to any one of five elements in Band there are 3
elements in set A.
Total number of functions from A to B=5 x 5x5 =5°
So, statement-1 is true.
EXAMPLE 2 Statement-1 (Assertion): If two set Xand Ycontain 3and 5elements respectively, hen
°C3 x 3! one-one functions can be defined from Xto Y.
Statement-2 (Reason): Aone one function from Xto Yrelates different elements of set
Xto different elements of set Y.
Ans. (a)
SOLUTION A one-one fnction from set X toset Y associates distinct elements of X to distinct
elements of Y. This can be done in Ca x 3! ways. Hence, C, x 3! one-one functions can be
defined from Xto Y. So,statements-1 &2are true and statement-2 is a correct explanation for
statement-1.
EXAMPLE 3Statement-1 (Assertion): Let A and Bbe two sets having mand n elements respectively
such that m <n. Then,

Number of surjections from Ato B= r=1 "c, (-1)"

Statement-2 (Reason): If f:A’B is a surjection, then every element in B has a
pre-image in A.
Ans. (d)
SOLUTION Since Bhas more elements than A. So, melements in set A can be related to at mostm
in A.
elements in B. Consequently, remaining(n -m) elements in Bwillnot have their pre-imagesfalse.
statement-1 is a
So, it is not possible to define an onto function from A to B. Hence,
However, statement-2 is true.
is a
EXAMPLE 4Statement-1 (Assertion): The function f:R ’R defined by f(x) =x+4x-5
bijection.
Statement-2 (Reason): Every odd degree polynomial has at least one real root.
Ans. (a)
sOLUTION For anyx, yeR
f() =f() +4x-5 =y+4y-5 ’-y+4(x-y) =0
(r-) (+ xy+y +4) =0
-+4>0for all x, y eR
X=y 2) 4

f:R’ Ris an injective map.

Let ybe an arbitrary element in R(Co-domain of f). Ther,
 FUNCTIONS 2.9

f() y 4r-5 -y -> r+4r-(5+y) 0

F'orgivenvalue of y,this equation has at least one real root, say a, as every odd degree equation
has at least one real root.
a'4a -(5+ y) 0 f(a)-y
Thus, for cach ye R(Co-domain) there exists a e(domain f) such that f(«) =y.So,f :R ’ Ris
a surjetion. Hence, f is a bijection.
Also, statement-2 is a correct explanation for statement-1.
EXAMTE &Statement-1 (Assertion): ff:R’R and g:R ’R be two functions such that
f() =xand g(x) =x, then fog (2) =gof (x).
Statement-2 (Reason): The composition of functions is commutative.
Ans, (c)
SOLUTION We have,
fog (1) =f (g (1)) =f(r°) =(r° = and, gof (2) =gf()) =g (a?) =(°=
fog (x) =gof(x). So, statement-1is true.
Iff(1) = x and g() =sin x, then fog (x) = sin x and gof (x) =sin x".
fog(*) * gof(3).
So, the composition of functions is not commutative. Hence, statement-2 is false.

EXAMPLE 6 Letf:A’Aandg:A ’A be twofunctions such that fog(*) =gof(x) = xfor all x e A.

Statement-1 (Asertion): xeA:f) =g(} -feA:f)=*} ={eA:g() =*}
Statement-2 (Reason): f:A’Ais abijection.
Ans. (a)
SOLUTION We have,
fog(x) =gof(x) =x for all x eA fog (r) =gof (x) =I() for all x eA
fog =gof =I» fis invertible such that g=ffis a bijection
Curves y=f(x) and y=g(*) meet at y =x
(xeA:f(x)=g ()) =(xeA:f() =x)=eA:g(x)=*}
Thus, both statemnents are true and statement-2 is a correct explanation for statement-1.

EXAMPLE 7 Letf:[-1,o) e-1, o) be afunction given f() =(r+1)-1, x 2-1.

Statement-1 (Assertion): The set (x:f (r) =f()} ={0, -1}
Statement-2 (Reason): fis abijection.
Ans. (a)
solutions
SOLUTION It can be checked that f is abijection and hence invertible. Therefore, the
of equations f(x) =f() and f(x) =x are same.
Now, f(x) = x’ (x+1)-1 =xt+x=0=> x(x +1) =0’ x=-1, 0
(x:f() =f))=1, 0
correct explanation for statement-1.
Thus, both the statements are true and statement-2 is a
2.10 MATHEMATICS-XI
EXAMPLE 8 Statement-1 (Assertion): Thefunction f:N’ Ngiven byf (n) =1-(-1) for allneN
is invertible.
a.
Statement-2 (Reason): The successor and predecessor of an even natural number
odd natual numbers and that of an odd natural number are
even natural numbers.

Ans. (a)
J ,I n1s even
We have, f() =-(-1 =n+1,
SOLUTION if nis odd

Injectivity Letn, mbe any two even natural numbers. Then,

f(n) =f(m) ’n-1=m-1n=m
Ifn, mare any two odd natural numbers. Then, fln) = f(m) ’ n+1=m+1 ’ n=m.
Thus, in boththe cases, we obtain: f(n) =f(m) ’n=m.
Ifn is even and mis odd, then n*m. Also, f() is odd and f(m) is even. So, f) =f(m)
Thus, n* m ’ f() * f(m).So, fis an injective map.
Surjectivity Let nbe an arbitrary natural number.
Ifnisan odd natural number, then there exists an even natural number n +1 such that.
f(n +1) =n +1 -1 =n
Ifnis an even natural number, then there exists an odd natural number (n -1) such that
f(n-1) =n-1+1=n
Thus, every neN has its pre-image in N.So,f:N’Nis asurjection.
Hence, f:N’Nis abijection.
EXAMPLE 9 Let f:-1, 3]-’ Rbe defined as f(x) =4x-12x
Statement-1(Assertion): Theimage ofl-1, 3]under fis not the intervallf (-1),f(3).
Statement-2 (Reason): fis not an injective map.
Ans.(a)
SOLUTION We have, f() =4x°-12x ’ f() =12x-12=12(x-1) (x+1)
The signs of f() for different values of x are as shown below. S

So
-1 1
(ii
Fig. 2.3 Signs off"(x)
m
So,f(x) attains alocal maximumatx =-1 and local minimumat x=1.Clearly,f (x) isdecreasn;
in (-1,1] and increasing in [1, 3]. So, f is not an injective map and the image of l , J" (i
f(),f(3)]=(-8,72, (iv
EXAMPLE 10 Let fbe afunction defined by f(x) =(x-1) +1,(x>1). At

Statement-1 (Assertion): The set (x:f(2) =f- ()) =1 2) (v)

Statement-2 (Reason): fis a bijection and f() =1+x-1,x21.
EXA
Ans. (a) the
SOLUTION It is evident from the graph of f (x) that f (x) is a bijection for all x land ne wer
invertible.
 FUNCTIONS
2.11

Now, of (1) =r for all x 1

f )) =x for all x>1
r(a)-1j' +=r for all x21 > f'()=1+-1 for all x>1
So, Statement-2 is correct.

Since fis a bijection. Therefore, equations f(x) =fx) and f(x) =xhave the same solution set.
(x:f(1) =f)) =fxf() =x}-(x:(-1)' +1=x)=(1,2)
Hence, Statement-1 is also correct and Statement-2 is a correct explanation of statement-1.

CASE STUDY BASED MCQs

EXAMPLE 1 In two diferent societies, there are some school going students including boys as well as
girls. Ranan forms two sets with these students as his college project. Let A ={a,, ay, ag, A4, a5} and
B-b,b, b3, b¡), where a;'s andb;'s are schol going students offirst and second society respectively.
Using the above information, answer thefollowing questions:
() The mayping f ={(a4, by), (ay, b), (ag,by), (a4, b¡). (5,b)l 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-0ne and onto both (d) neither one-one no onto
(ii) The number of functions from Ato Bis
(a) 20 (b) 54 () 45 (d) P
(i) The number offunctions from Bto Ais
(a) 20 (b) 54 () 4 (a) °P4
(iv) The number of one-onefunctions from Ato Bis
(a) Pa (b) 5 (c) 4 (d) 0
(v) The number of onto function from Ato Bis
(a) 240 (b) 480 (c) 1024 (d) 512
SOLUTION (i) Ans. (b): We observe that f(a4) =f(a5) =b and range (f) =B=co-domain.
So,f is many one ontofunction.
(ii) Ans. (c): Each element inA can be mapped to any element in B. So, each element in Acan be
mapped in 4ways. There are 5elements in A. So, number of functions fromÁto Bis 45
(ii) Ans. (b): The number functions from Bto Ais (nlA)) 5)i.e. 5.
(iv) Ans. (d): Set A has more elements than set B. So, one-one functions cannot be defined from
A to B.

(v) Ans. (a): Number of onto functions from A to B=

}y4r t,F =240.
r=1

EXAMPLE2 An organization conducted bike race under 2different categories-boys and girls. Totally
there were 250 participants. Among all of them finally three from Category 1and two from Category 2
were selected for the final race. Ravi forms twO sets Band Gwith these participantsfor hiscollege project.
2.12
MATHEMATICS-X
who
b,, bal G-lRlvhere Brepresents the set of boys selected and Gthe set of girls
Let B ,
selected for the final race.

Fig. 2.3

Ravi decides to explore these sets for various types of relations and functions
are possible?
(i) Raviwishes to form all the relations possible from Bto G. How nany such relations
(b) 25 (c) 0 (d) 23
(a) 2
from B to G?
(iü) Ravi wants to knowamong those relations, how many functions can be formed
(a) 22 (b) 212 (c) 32 (d) 23
(ii) Let f:B’Gbe defined by f ={(b1 8), (62, 82), (b3 8)}, then f is
(a) injective (b) surjective
(c) neither surjective nor injective (d) surjective and injectioe
(iv) Ravi wants to find the number of injectivefunctions from Bto G. How many numbers of injact
functions are possible?
(a) 0 (b) 2! (c) 3! (d) 0!
(v) The number of surjecive functions from Bto Gis
(a) 8 (b) 6 (c) 4 (d) 64
sOLUTION (G) Ans. (a): Number of relations from Bto G=23*2 -26
(ii) Ans. (d): Number of functions from Bto G=n (G) b)=23
(i) Ans. (b): We observe that flb) =f(bz) =g1 and range () =G (co-domain). Therefore,f
surjective but not injective.
(iv) Ans. (a): We find that set Bhas more elements tharn set G.So, a one-one function caru
defined from B
to G.

(v) Ans. (b): The number of surjections from Bto Gis > (-1)2- ,32C, =-2+2° =6
r=1
EXAMPLE3 Raji visited the exhibition along with her family. The exhibition had a huge swny
attracted many children. Raiji found that theswing traced aparabolic path given by y
=*.
 FUNCTIONS
2.13

Fig. 2.4

Answer the following questions using the above information.

) Let f:R’R be defined by f(x) =x? is
(a) neither surjective nor injective (b) surjective
(c) injective (d) bijective
(i1) Letf:N ’ Nbe defined by f()=x* is
(a) surjective but not injective (b) surjective
(c) injectioe (d) bijective
(ii) Letf:1,2, 3,..) ’1, 4,9,..} be defined by f(z) =xis
(a) bijective (b) surjective but not injective
(c) injective but surjective (d) neither surjective nor injective
(iv) Let f:N’Nbe defined by f() =x. Range of the
function among the following is
(a) {1,4, 9, 16, ...) (b) {1, 4, 8,9, 10,...] (c) {1, 4,9, 15,
16..}(d) {1,4, 8, 16, ...
(v) The function f: Z ’Z defined by f(x) =x is
(a) neither injective nor surjective (b). injective
(c) surjective (d) bijective
SOLUTION Ans. (a): We find that f(-2) =f(2) = 4 and range () =[0, o) * R
(i)
So, f is neither injective nor surjective. (Co-domain).
(i) Ans. (c): Let x,y e Nbesuch that f(x) =f(y). Then,
f(x) =f()>=y’x=y.
So, is injective. Clearly, range (f) =(1, 4, 9, 16,..]#N
f
(co-domain). So, f is not surjective.
(iii) Ans. (a): f:(1, 2, 3, .. ’(1, 4,9, ..}defined by f(*)
=x is injective as well as surjective.
Hence, it is bijective.
(iv) Ans. (a): The range of f:N’R defined by f(x) =x is
(:xe N} ={1, 4,9, 16, .J.
 MATHEMATICS-XI
2.14
4and
the function f:2 ’Z defined by f(x) =x,we find that f(-2) =f(2) =
(v) Ans. (a): For
16...)*Z (co-domain). So, it is neither injective nor surjective.
range()=0, 1, 4, 9,
PRACTICE EXERCISES

MULTIPLE CHOICE QUESTIONS (MCQs)

Mark the correct alternative in each of the following:
1. The function f :N’ Ngiven by f(x) =3x is
(a) one-one and onto (b) one-one but not onto
(c) marny one onto (d) many one into
2. The function f:R ’ R given by f(2) =2x-3 is
(a) one-one onto (b) many-one onto
(c) one-one into (d) marny one into
3. Let f:R ’R be defined by f(x) =**. Then,f is
(a) one-one onto (b) many-one onto
(c) one-one but not onto (d) many one into
4. Which of the following function from R to R is one-one function?
(a) f(x) =e (b) g() = (c) hx) = sin x (d) ) =cOS*
5. The range of the function f:R -’ R given by f() =x-]is
(a) [0, 1] (b) R (c) R-Z (d) [0, 1)
6. Let f:R ’Rbe a function defined by f(x) =x° +1, then fis
(a) injective but not surjective (b) surjective but not injective
(c) bijective (d) neither injective nor surjective
7. Iff:(3, o) ’ Bgiven by f(x) =-6x+14 is a bijection, then Bis equal to
(a) (3, o) (b) 5, o) (c) (5,o) (d) R
8. Let A={1,2, 3,4 and B= (, y,z, t, u, . Then, the number of
one-one functions from Ato
B is
(a) 15 (b) 24 (c) 360 (d) 6
9. Let A= (1, 2,3,4, 5)and B= (2,4). Then, the number of onto
(a) 30
functions from A to Bis
(b) 32 (c) 25 (d) 10
10. if x is even
Letf:Z’Z be given by f(x) =2 .Then f is
0,if x is odd
(a)
one-one but not onto (b) onto but not one-one
(c)
one-one and onto (d) neither one-one nor onto
11. Which of the following
function from A=(xeR:-1sx<1 to itself are bijections?
(a) f() =|x| (b) f() =sin
2 (c) f() =sin- (d) none of these
12. 4
Letf:-1,1]’[-1,
(a) abijection
1] be defined by f(*) = x]x|.
Then, f is
() asurjection only (b) an injection only
(d) neither an injection nor a
surjection
 FUNCTIONS 2.15

13. The function f: R ’ Rdefined by f(x) =(x-1) (*-2) (* - 3) is

(a) one-one but not onto (b) onto but not one-one
(c) both one-one and onto (d) neither one-one nor onto
14. Iff:R’R is given by f() 3x-5, thenf(2)
1 X+5
(a) is given by (b) is given by 3
3x-5
(c) does not exist because fis not one-one (d) does not exist because fis not onto
15. If the function f: R’Rbe such that f(*) =x-[*], where [«] denotes the greatest integer
less than or equal to x, then f(x) is
1
(a) (b) []-x (c) not defined (d) none of these
x-[x]
16. If the set A contains 7 elements and the set B contains 10 elements, then the number of
one-one functions from A to B is
(a) 2°cC, (b) 1°C, x7! () z10 (d) 10
3x+2 Then,
17. Letf:R-’R be defined by f() =:5x-3
1
(a) f)=f(y) (b) f()=-f(s) (c) fof(x) =1) (a) f)=f)
19

18. Let f: R’ Rbe given by f()=x-3. Then, fis given by

(a) Vx+3 (b) Vr+3 (c) x+/3 (d) none of these
19. Iff:R ’Ris given by f() =x°+3,thenf () is equal to
(a) x33 (b) /3+3 (c) (-3V3 (a) (*+3)/3
20. Let f(x) =x°bea function with domain (0, 1, 2, 3}. Then the domain of fis
(a) (3, 2, 1, 0} (b) 0,-1, -2,-3} (c) {0, 1, 8, 27) (d) {0, -1,-8,-27}
21. Let f(z) =*and g(x) =2.Then, the solution set ofthe equation fogtx) =gof() is
(a) R (b) {0} (c) (0, 2} (d) none of these
22. The total number of functions from set A=1, 2, 3} to the set B=(x, y, z, is
(a) 3 (b) 43 (c) 3 x 4 (d) 23x4
23. Iff:R’(0, o) is given by f() = 3*, thenf)=
(a) 3-* (b) 3 (c) log3x (d) log, 3
24. If f:R’R is defined by f(x) =2x-3, then ff(«) is equal to
(a) 2x+3 (b) 3x+2 (c) 4x+9 (d) 4x-9
25. If the mappings f:1, 2, 3, 4 ’ {2, 5,7,9) and g:(2,5,7, 9) ’ {1, 2, 4} are given by
f={(1,9), (2,7), (3,5), (4, 2)) and g=(2, 1), (5, 2), (7, 1)(9,4), then fog =
(a) {(2,9), (5,7), (7,9), (9, 2)) (b) {(2,7), (5,3), (7, 2), (9, 7))
(c) {(1,4), (2, 1), (3, 2), (4, 1)) (d) none of these
26. Let f() =- x*-1.Then, for what value of a is ff(*) =x?
x+1
(a) 1 (b) 1 (c) 0 (d) none of these
2.16
MATHEMATICS-XI
defined as f(x) = sin 2x is asurjection, then B=
27. HA=0 ';andf:A -’ B,
(d) none of these
(a) (b)

28. If f(r) =ax +b, g(x) =cx+ d, then fog(x) =(gof) (x) iff (d) flo)=gla)
(a) f(a) =s(o) (b) f(b) =g(c) () f(a) =g(b)
(3,5), (4, 7)) is described by the formula g(x) = X+B,then (a, B) =
29. lfg = (1,1), (2, 3), (-2, -1)
(c) (2, 1) (d)
(a) (2, 1) (b) (2, -1)
injective map with domain (x, y, 2 and range (1, 2, 3)such that exactly one of the
30. Letf be an false: f(x) =1, f ) 1 f(2)=2.
following statements is correct and the remaining are
Then, f =
(a) {(x, 2), (y, 1), (z, 3)) (b) ((x, 1), (y, 2), (z, 3)}
(c) {(x, 3), (y, 1), (z, 2)) (d) {(x, 2), (y, 3), (z, 1))
there be a set Sconsisting ofnelements.Then, the number of functions from Sx Sto Sis
31. Let
(a) n? (b) (c)
total number of relations
32. Two finite sets A and Bhave n and 2 elements respectively. The
value ofnis
from A to Bis 56 more than the total number of function from A to B. Then the
(a) 3 (b) 5 (c) 7 (d) 9
ASSERTION-REASON BASED MCQs

Each of the following questions contains statement-1 (Assertion) and STATEMENT-2 (Reasor)
and has following four choices (a), (b), () and (d), only one of which is the correct answer. Mark
the correct choice.

(a) Staternent-1 is true, Statement-2 is true; Statement-2 is acorrect explanation for Statement-1.
(b) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for
Statement-1.
(c) Statement-1 is true, Statement-2 is false.
(d) Statement-1 is false, Statement-2 is true.
1. Statement-1 (Assertion): Let m, nbe natural
numbers other than 1. Then,
(i) 2"" > and (ii) 2" >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 mand n
such that n>m. Then, n" >"Cm Xm! elements respectively
Statement-2 (Reason): A function f from set A to
set B is an
elements of A are related to distinct injection if distinc
3. Statenment-1 (Assertion): elements of set B.
Iff:(x, y, ’1, 2, 3} is a one-one
of the following function such that only one
false: statements is correct and the remaining ar
 FUNCTIONS 2.17

() f()+ 2 (i) f(y) =2 (ii) f(z) 1

Then, f=((x,2), (y1), (2,3))
Statement-2 (Reason): Every injective map from a finite set to itself is a bijection.
4. Let f:Z ’Z be afunction defined by f(x) =ax+bx +c.
Statement-1 (Assertion): cis an integer.
Statement-2 (Reason): a+b is a integer.
5. Statement-1 (Assertion): The functionf:Z ’ Z defined by f(x) =5x+12 isasurjection.
Statement-2 (Reason): The functionf:R -’ Rdefined by f(x) =5x+12 is abijection.
6. Statenment-1 (Assertion): The functionf:R ’ R defined by f(r) =x] is neither one-one
nor onto.

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

7. Statement-1 (Assertion): If f:R’R and g:R’R are defined by f(x) =x+1 and
g{x) =*+2, then fog() =gof(r) for all x eR.
Statement-2 (Reason): The composition of functions is commutative.
8. Statement-1 (Assertion): Let A and B be two finite sets having m and n elements
respectively such that msn. Then, the number of one-one
functions from Ato Bis"Cm Xm!.
Statement-2 (Reason): A function f:A Bis aone-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, thenumber of functions from Ato Bisy".
Statement-2 (Reason): Every function from set A to set Bis asubset of A x B.
10. Statement-1 (Assertion): Afunction f:A’ Bcannot be an ontofunction, ifn(A) <B).
Statement-2 (Reason): A function 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-2 is an onto function, then B=-2, -1, 0).
Statement-2 (Reason): Iff:A ’ Bis an onto function, 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 polynomial function is a bijection.
13.
Statemernt-1 (Assertion): The functionf :R ’ R defined byf(*) = is not one-one.
x²+1
4
Statement-2 (Reason): f(4) = 17 and
2.18 MATHEMATICS-X

MULTIPLE CHOICE QUESTIONS (MCQs)

1. (b) 2. (a) 3. (d) 4. (a) 5. (d) 6. (c) 7. (b) 8. (c) 9. (a)
10. (b) 11. (b) 12. (a) 13. (b) 14. (b) 15. (c) 16. (b) 17. (a) 18. (d)
19. (c) 20. (c) 21. (c) 22. (b) 23. (c) 24. (d) 25. (a) 26. (b) 27. (a)
28. (c) 29. (b) 30. (a) 31. (c) 32. (a)

ASSERTION-REASsONBASED MCQs
1. (a) 2. (a) 3. (b) 4. (b) 5. (d) 6. (c) 7. (c) 8. (a)
9. (b) 10. (a) 11. (a) 12. (c) 13. (a)
ACTIVITIES