PRACTICE EXERCISES i MULTIPLE CHOICE QUESTIONS (MCQs) Mark the correct alternative in each of the following. The function f : N > N given by f(x) = 3x is (a) one-one and onto (b) one-one but not onto (c) many one onto (d) many one into 2. The function f : R > R given by f (x) =2x-3is (a) one-one onto (b) many-one onto (0) one-one into (4) many one into 3. Let f:R ~ R be defined by f(x) =x*. Then, fis (a) one-one onto (b) many-one onto (c) one-one but not onto (4) many one into +. Which of the following function from R to R is one-one function? (a) fx) =e* (b) gix)=e* (Mx) =sinx — (A) 6x) cos ©. The range of the function f : R > R given by f(x) = x-[x]is (a) [0,1] (b) R (c) R-Z (a) [0,1) © Let f:R + R be 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 "F513, 0) — Beiven by f(x) = x2 -6x +14 is a bijection, then Bis equal to aeMATHUR, 4%, 216 6 () 6) (d) K on ff 4, alane ety, Waele 1 te number of e-0Ne DCs s Let Ath 2 and yy ye tb Me - Bis : i 15 (b) 24 w 100) (d) ‘ , ) ys, a and B= [2A Ten rinber of onto functions fom A typ, _ (by 32 () 25 (d) 10 ‘ FIEP BOVE ae lo. Let fi: 2» Z be given by £0) ie ; Then 0, if vs odd (b) onto but not one-one (a) one-one but not onto her one-one nor onto (d) ne (c) one-one and onto fre R:-1 5x Si to itself are bijections 11. Which of the following funetion from A i (@ fedelrt (b) f@) sin Let f-[-1, 1] > f-1, Ibe defined by (0) = 11 ‘Then, f is (b) an injection only (d) neither an injection nor a surjection wo fox) =sin (d)_ none of these (a) a bijection (¢) a surjection only 1a. The function f:R > R defined by f(x) =(*-1) @=2) ("= 3) is (b) onto but not one-one (d) neither one-one nor onto (a) one-one but not onto ()_ both one-one and onto 14. ff: R > Ris given by f(x) = 3x~5, then f ta) 7 . x+5 a) is gir by = is gi = (a) isgiven by 5-5 (b) is given by *5 (6) does not exist because fis not one-one (d) does not exist because f is not on 15, If the function f: R > R be such that f(x) = x [x], where [x] denotes the greatest inte less than or equal to x, then f(x) is (a) (b) [xl-x (©) not defined (d) none of these 16. If the set A contains 7 elements and the set B contains 10 elements, then the sumbe ‘one-one functions from A to B is fa) Cy (b) cy x7! 7” (@) 0" v7 vet R~! 3) + R be define 3x42 eels) fined by fx) ==". Then, 1 (ay foo = fey) f= f0) (©) fof(x)=-G) (a) p= Rie 18, Let fs ~» R be given by f(x) = x" ~3. Then, fis given by (i x n ay vx (by vr¥3 (c) x43 (d) none of thes? If: R > Riv given by fx) =x" + 3, then f(x) is equal ti ‘a va ‘- (a) x33 (by e943 0 @-3"3 — @ ae”? Let 3 be 20. Let f(a) <2? bea function with domain (0, 1, 2,3). Then the domain of _FUNCTIONS oa (a) (3,2,1,0) (b) (0, -1, -2, -3) (c) (0, 1,8, 27} (d) (0, -1,-8,-27} 21. Let f(x) =x? and g(x) = 2*. Then, the solution set of the equation fog(x) = gof(x) is (a) R (b) {0} (©) (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, tis (@ 3* ) (0) 3x4 (d) 29*4 23. If: R — (0, 2) is given by f(x) = 3°, then f-Yx) = (@) 3* (b) x3 (©) log3x (d) log, 3 2a. Iff:R > Ris defined by f(x) = 2x-3, then f(f(x)) is equal to (a) 2x+3 (b) 3x42 (c) 4x49 (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, (© (0,4), 21), ,2),4,1)} (d) none of these 26, Let fla) = 2%, x# 1. Then, for what value of ais f(f(2)) = 2? oa wo (d) none of these a | and f : A > B, defined as f(x) = sin 2x is a surjection, then B = 3 v3 3 i } ©) {o. } © {oa} (4) none of these 2 g(x) = cx +d, then fog(x) = (gof) (3) iff @ fla =s0) &) f= (©) M=80) (A) fl) = (a) 29. Ifg=((1, 1), 2,3), (3,5), (4, 2) is described by the formula g(x) = ax +B, then (a, B) = fa) (2,1) (b) (2-1) (©) (2,1) (d) (-2,-1) 30. Let f bean injective map with domain (x, y, and range {1,2,3) such that exactly one of the following statements is correct and the remaining are false: f(x) =1, f(y) #1 f(z) #2. Then, f = (@) 1, 2,40, 9) ©) (ex, D,(y, 2), @ 3) (© Mx, 3),(y,0),@ Db (2) (,2),(y,3,@,D) 31. Letthere be a set Sconsisting ofnelements. Then, the number of functions from Sx Sto Sis () (b) or (@ 9" 52 Two finite sets A and B have n and 2 elements respectively. The total number of relations from A to Bis 56 more than the total number of function from A to B. Then the value of nis (a) 3 (b) 5 ©7 (a) 9 ASSERTION -REASON BASED MCQs Fach of the following questions contains statement-1 (Assertion) and STATEMENT-2 (Reason) and has following four choices (a), (b), (c) and (d), only one of which is the correct answer. Mark ‘he correct choice. (2) Statement-1 is true, Statement-2 is true; Statement-2.is a correct explanation for Statement-1, ee40. Assertion (A): The 8-- MATHEM Ang. % 218 oment-2 is nota correct explanation fo, (b) Statement-1 is true: Statement-2 is Ue! Statement-1. true, Statement-2 15 false. tement-2 is true. be natural numbers other than 1. Then, (©) Statement-1 is {@) Statement is false, Se Letm, f Pt >n and Gi) 2 > Every function isa relation buta relation need not be a function Let A and B be two sets having m and 1 elements respect, such that n>. Then, 17" >"Coy 433, Statement-1 (A): Statement-2 (R): 34, Statement-1 (A): 'A function f from set A to set Bis an injection if distinct elements are related to distinct elements of set B. 45, Statement-1 (A): IEf:f8, ya > 01,2, Vis aone-one function such that only one of following statements is correct and the remaining are false (@ fa) =2 «i fe (ii) f@) #1 Then, f ={(x.2),(020), 3) Statement-2(R): Every injective map from a finite set to itself is a bijection Statement-2 (R): 36, Let f:Z > Z bea function defined by f(x) sax? +brec. Statement-1 (A): cis an integer. Statement-2(R): a +bisa integer. 37. Statement-1 (A): The function f : Z > Z defined by f(x) =5x+ 12is a surjection. Statement-2(R): The function f: R > R defined by f(x) =5x + 12 is a bijection 438. Statement-l (A): The function f :8 > R defined by f(x) =[x] is neither one-one onto. Statement-2(R): The function f : K + R defined by f(x) =| x] is onto. 39, Statement-1 (A): If f:R > Rand g:R > Rare defined by f(x) =x+1and g(¥) then fog(x) = gof(x) for allx eR. Statement-2 (R): The composition of functions is commutative. 40. Statement-1 (A): Let A and B be two finite sets having m and m elements respect! such that m Bisa one-one function iff distinct elements! st are mapped to distinct elements of set B. 41. Statement-1 (A): Let A and B be two finite sets having m and n elements resP°"" ‘Then, the number of functions from A to B is 1". ‘Statement-2 (R): Every function from set A to set B is a subset of A x B. 42, Statement-1 (A): A function f: A Beannot be an onto function, if n(A) <4 Statement-2(R): A function f: A -> Bis an onto function Ld fone pre-image in A. we each element in Bhs"FUNCTIONS 43, Statement-1 (A): Statement-2 (R): 44, Statement-1 (A): Statement-2 (R): 45, Statement-1 (A): Statement-2 (R): 1) 2 @) 10. (b) 11. (b) Ww () 20. © 28. (ce) 29. (b) 37. @) 38. (@) 249 A=(0,1, | and the function f : A -> B defined by f(x) =x? -2is an onto function, then B ={-2, -1, 0}. If fA + Bis an onto function, then f(A) = The function f : R + R defined by f(x) = x +1 is a bijection. Every polynomial function is a bijection. The function f :R — R defined by f(x) =—* xt1 is not one-one. f(8) = ana 1(3)-4 r MULTIPLE CHOICE QUESTIONS (MCQs) 3. (d) 4. (a) 5. (d) 6. () 7. (b+) 8 (c) 9 a) 12. (a) 13. (b) 14. (by 15. (©) 16. (B) S17. (a)_—s18. (+) 21. (c) 22. (b) 23. (©) ~—24. (a) 25. (a) 26. (B) 27. (a) 30. (a) 31. ©) 32. (a) 33. (a) 34. (@) 35. (b) 36. (b) 39 () 40. (@) 41 (B} 42. (a) 43. (a) 445. @)