ASPIRATIONS Institute, B 185, Sec 7, Dwarka || www.aspirationsinstitute.
com || 9818737605
12_Maths_Functions_WS02
Q1 𝑓 : 𝑅 → 𝑅, given by 𝑓(𝑥) = 𝑥 + √𝑥 2 is
a) Injective b) surjective c) bijective d) None of
these
Q2 If 𝑓 ∶ 𝐴 → 𝐵 given by 3𝑓(𝑥) + 2−𝑥 = 4 is a bijection, then
a. 𝐴 = {𝑥 ∈ 𝑅 ∶ −1 < 𝑥 < ∞}, 𝐵 = {𝑋 ∈ 𝑅 ∶ 2 < 𝑋 < 4}
b. 𝐴 = {𝑥 ∈ 𝑅 ∶ −3 < 𝑥 < ∞}, 𝐵 = {𝑋 ∈ 𝑅 ∶ 0 < 𝑋 < 4}
c. 𝐴 = {𝑥 ∈ 𝑅 ∶ −2 < 𝑥 < ∞}, 𝐵 = {𝑋 ∈ 𝑅 ∶ 0 < 𝑋 < 4}
d. None of these
Q3 Let 𝑓 ∶ 𝑅 → {𝑥 ∈ 𝑅: −1 ≤ 𝑥 ≤ 1} = 𝐵 . Then the mapping 𝑓 ∶ 𝐴 → 𝐵 given by 𝑓(𝑥) =
𝑥|𝑥| 𝑖𝑠
a) Injective but not b) Surjective c) bijective d) None of
surjective but not these
injective
Q4 𝑓 : 𝑅 → 𝑅 , be given by 𝑓(𝑥) = [𝑥]2 + [𝑥 + 1] – 3, where [x] denotes the greatest
integer less than or equal to x. Then 𝑓(𝑥) is
a) Many-one and b) Many-one c) One one and into d) One-one and
onto and into onto
Q5 A function f from the set of natural numbers to integers defined by
𝑛−1
, 𝑤ℎ𝑒𝑛 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑓(𝑛) = { 2𝑛
−2 , 𝑤ℎ𝑒𝑛 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
a) Neither one-one b) One-one but c) Onto but not d) One-one and
nor onto not onto one-one onto both
𝑥−𝑚
Q6 Let 𝑓 ∶ 𝑅 − {𝑛} → 𝑅 be a function defined by 𝑓(𝑥) = 𝑥−𝑛
, where 𝑚 ≠ 𝑛. Then
a) 𝐹 is one–one b) F is one-one c) F is many one d) F is many
onto into onto one into
Q7 𝑓 ∶ 𝑍 → 𝑍 be given by
𝑥
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑓(𝑥) = { 2 then ,𝑓 is
0 , 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
a) Onto but not b) One-one but c) One-one and d) Neither one-
one-one not onto onto one nor onto
Q8 If the set A contain 5 elements and the set B contains 6 elements, then the
number of one-one and onto mappings from A to B is.
a) 720 b) 120 c) 0 d) None of
these
Q9 Let 𝑓 ∶ 𝑅 → 𝑅 be defined
2𝑥 , 𝑖𝑓 𝑥 > 3
2
𝑓(𝑥) = { 𝑥 , 𝑖𝑓 1 < 𝑥 ≤ 3
3𝑥 , 𝑖𝑓 𝑥 ≤ 3
Then, 𝑓(−1) + 𝑓(2) + 𝑓(4)
a) 9 b) 14 c) 5 d) None of
these
Q10 Let 𝐴 = {1, 2, 3, … … , 𝑛} and 𝑏 = {𝑎, 𝑏}. Then the number of subjections
from A Into B is.
a) nP
2 b) 2𝑛 - 2 c) 2𝑛 -1 d) nC
2
Q11 If the set A contains 7 elements and the set B contains 10 elements, then
the number of one-one functions.
a) 10C
7 b) 10C
7 × 7! c) 710 d) 107
**************************************All The BEST****************************************