Saturday, April 16, 2016

Relation and Function - NCERT Exemplar Problems and Solution (Short Answer Type)

Short Answer Type NCERT Exemplar Problems and Solution
Question – 1 LetA=(a,b,c)A=(a,b,c) and the relation RR  be defined on AA  as follows:
R=((a,a),(b,c),(a,b)).R=((a,a),(b,c),(a,b)).
Then, write minimum number of ordered pairs to be added in RR to make RR reflexive and transitive.
Solution:
In order to make R reflexive,(b,b)(b,b) and (c,c)(c,c) will be added to RR
And in order to make RR  transitive,(a,c)(a,c) will be added to R.R.
Therefore, The minimum number of order pair to be added to RR will be (b,b),(c,c)(b,b),(c,c) and (a,c)(a,c) 
Question – 2  Let DD be the domain of real-valued function f defined by f(x)=25x2f(x)=25x2 then, write D.D.
Solution:
Here given D is the domain of f(x)=25x2f(x)=25x2
Therefore, 25x2025x20
25x225x2
5x55x5
Therefore, D=[5,5]D=[5,5] 
Question - 3   Let f,g:RRf,g:RR  be defined by  f(x)=2x+1f(x)=2x+1 and g(x)=x22,xR,g(x)=x22,xR,  respectively. Then find gof.gof.
Solution: Given f(x)=2x+1f(x)=2x+1 and g(x)=x22,g(x)=x22,  xRxR
Therefore, gof(x)=g(f(x))gof(x)=g(f(x))
=g(2x+1)=g(2x+1)
=(2x+1)22=(2x+1)22 =4x2+4x1=4x2+4x1 
Question -4  Let f,g:RRf,g:RR be the function defined by f(x)=2x3f(x)=2x3 xRxR. Write f1f1
Solution: 
Given, y=2x3y=2x3 2x=y32x=y3 x=y+32x=y+32 Therefore f1(x)=x+32f1(x)=x+32 
Question – 5 If A=a,b,c,dA=a,b,c,d and the function f=(a,b),(b,d),(c,a),(d,c)f=(a,b),(b,d),(c,a),(d,c) write f1f1
Solution:
Given, f=(a,b),(b,d),(c,a),(d,c)f=(a,b),(b,d),(c,a),(d,c)
Therefore, f1=(b,a),(d,b),(c,a),(c,d)f1=(b,a),(d,b),(c,a),(c,d) 
 Question – 6  If f:RRf:RR is defined by f(x)=x23x+2f(x)=x23x+2 write f(f(x))f(f(x))
Solution:
Given, f(x)=x23x+2f(x)=x23x+2 therefore f(f(x))=f(x23x+2)f(f(x))=f(x23x+2)
=(x23x+2)23(x23x+2)+2=(x23x+2)23(x23x+2)+2
=x46x3+10x23x=x46x3+10x23x  
Question – 7   Is g=((1,1),(2,3,(3,5),(4,7))g=((1,1),(2,3,(3,5),(4,7)) a function? If gg is described by g(x)=αx+βg(x)=αx+β, then what value should be assigned to αα and ββ?
Solution:
Given, g=((1,1),(2,3,(3,5),(4,7))g=((1,1),(2,3,(3,5),(4,7))
Therefore, each of the element of domain will be have unique image.
Consequently, g is a function. Since g(x)=αx+βg(x)=αx+β therefore
g(1)=α×1+βg(1)=α×1+β thus 1=α+β1=α+β Also g(2)=α×2+βg(2)=α×2+β therefore solving these two equations we get α=2α=2 and β=1β=1 
Question-8: Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
(i) {(x,y)(x,y):xx is a person and yy is mother ofxx}
(ii) {(a,b)(a,b): aa is a person , bb is an acestor of aa}.
Solution:
(i) Let's check whether the relation defined in (i) is a function or not. For this, check whether it maps every element of domain uniquely or not. Which is easy to verify since xx cannot have two mothers. So if (x,y)R(x,y)R then its not possible for any zcodomainzcodomain such that (x,z)R(x,z)R So clearly it's a function. Next to check, R is injective or not. For this Let mother yy has two children x1,x2x1,x2 then for x1x2x1x2 f(x1)=f(x2)f(x1)=f(x2) that is mother is same. so RR is not one-one.(Injective)
(ii) Similarly, check whether it is a function or not so look here it is possible that one element is mapped to 2 or more elements. For this let's take an example  aa is ancestor of bb and bb is ancestor of cc.
(a,b)R(a,b)R clearly also cc is ancestor of both aa and bb.So (a,c)R(a,c)R. So it's not a Function.
Question -9: If the mapping ff and gg are given by
ff={(1,2),(3,5)(4,1)(1,2),(3,5)(4,1)} and gg={(2,3),(5,1),(1,3)(2,3),(5,1),(1,3)}, Write fogfog.
Domain of fogfog is domain gg. So fog(2)=f(g(2))=f(3))=5fog(2)=f(g(2))=f(3))=5
fog(5)=f(g(5))=f(1)=2fog(5)=f(g(5))=f(1)=2 fog(1)=f(g(1))=f(3))=5fog(1)=f(g(1))=f(3))=5
so fogfog={(2,5),(5,2),(1,5)(2,5),(5,2),(1,5)}
Question-10: Let CC be the set of complex numbers. Prove that the mapping f:CRf:CR given by
f(z)=|z|,zCf(z)=|z|,zC, is neither one-one nor onto.
Solution:  For 1,i1,i C, clearly 1i1i  |1|=|i||1|=|i| So it's not one-one.  Now there exsist no preimage of negative real numbers. Since, there exist no complex number whose modulus is negative. So it's not Onto.
Question-11: Let the function f:RRf:RR be defined by f(x)=cosx,xR.f(x)=cosx,xR. Show thatff is
neither one-one nor onto.
Solution:  For 02π02π cos0=cos2πcos0=cos2π so it's not one-one. Also Preimage of 22 does not exist. We know that Range of cos(x)cos(x) is [1,1][1,1]. Alternatively, since Range codomain. Therefore cos(x)cos(x) is not onto.
Question-12: Let XX = {1,2,31,2,3}and YY = {4,54,5}. Find whether the following subsets of X×YX×Y are
functions from XX toYY or not.
(i) ff = {(1,4),(1,5),(2,4),(3,5)(1,4),(1,5),(2,4),(3,5)} (ii) gg= {(1,4),(2,4),(3,4)(1,4),(2,4),(3,4)}
(iii)hh = {(1,4),(2,5),(3,5)(1,4),(2,5),(3,5)} (iv) kk = {(1,4),(2,5)(1,4),(2,5)}.
Solution: (i) is not Function. Since, 11 is mapped to 44 and 55. So image of 11 is not unique.
(ii) It is a Function, Since every element of Domain Mapped Uniquely.
(iii) Image of 1,2,31,2,3are unique.So it is a function.
(iv) Similarly, It is also a function.
Question-13: If functions f:ABf:AB and g:BAg:BA satisfy gof=Igof=I AA, then show that ff is one-one
and gg is onto.
Solution:  Given gof=Igof=I Let f(x1)=f(x2)f(x1)=f(x2)g(f(x1))=g(f(x2))g(f(x1))=g(f(x2)) [Since gg is a function, gg is Well-defined] x1=x2x1=x2 [Since gof(x)=xgof(x)=x]
Next , To prove onto, Let there exist xAxA  Now g(f(x))=xg(f(x))=x For f(x)Bf(x)B So,gg is Onto.
" This question is important for Board Examination"
Question-14: Let f:RRf:RR be the function defined by f(x)=12cos(x)f(x)=12cos(x) xRxR.Then, find
the range offf.
Solution: 1cos(X)11cos(X)1 1cos(x)11cos(x)1 , 32cos(x)132cos(x)1 So 13112cos(x)113112cos(x)1. So Range= [1/3,1][1/3,1]
Question-15: Let nn be a fixed positive integer. Define a relation RR in ZZ as follows: a,bZa,bZ,
aRbaRb if and only if abab is divisible by nn . Show that RR is an equivalence relation.
Solution:
(i) Since aa=0aa=0 is divisible by nn For every aZaZ Therefore (a,a)R(a,a)R for every aZaZ. So RR is Reflexive.
(ii) Let (a,b)R(a,b)R that is abab is divisible by nn Then (ab)(ab) is also divisible by nn. i.e., baba is divisible by nn. So (b,a)R(b,a)R. So, RR is Symmetric.
(iii) Let (a,b),(b,c)R(a,b),(b,c)R then  ab=r×nab=r×n .....(1)
ab=r×nab=r×n                                       .....(1)
and   bc=r×mbc=r×m                              ....(2)
for some n,mZn,mZ. So , Substracting (2) from (1) we get, ac=r×(nm)ac=r×(nm). and nmZnmZ [Clousure law of addition of Z]
Therefore acac is divisible by nn i.e. (a,c)R(a,c)R Therefore RR is transitive.
So. RR is an Equivalence Relation.  



Related Posts:

2 comments :

  1. Here you can get the ncert exemplar based on the latest syllabus of NCERT.
    In order to get good marks in your upcoming NCERT examination, these ncert exemplar are good.
    Here you can download these exemplar - https://fullmarks.org/cbse-support-books/exemplar-series/

    ReplyDelete
  2. Really helpful practice paper thanks for sharing this, for best CSIR NET tuition join our online coaching to prepare for CSIR NET 2020.

    ReplyDelete