CBSE CLASS 12 MATHS MCQ’S & CASE STUDY 4) Let f, g and h be functions from R to R, then

(a) (f+g)𝑜h = f𝑜h+g𝑜h

(b) (f+g)𝑜h = f𝑜h+h𝑜g
Ch.1 : RELATIONS & FUNCTIONS (c) (f+g)𝑜h = h𝑜(f+g)
(d) (f+g)𝑜h = h𝑜f+g𝑜h
View Explanations
Multiple Choice Questions
5) Let f : {1, 3, 4}→ {1, 2, 5} and g : {1, 2, 5} →{1, 3} be given by
1) If f : R→ R be given by f(x) = (3－x3)1/3, then f𝑜f(x) is f = {(1, 2), (3, 5)(4, 1)} and g = {(1, 3), (2, 3)(5, 1)}. Then g𝑜f is
(a) x3 (a) {(1, 3), (3, 1), (4, 1)}
(b) x1/3 (b) {(1, 3), (3, 1), (4, 3)}
(c) x2 (c) {(1, 3), (3, 3), (4, 3)}
(d) x (d) {(1, 3), (3, 3), (4, 1)}

View Explanations View Explanations

2𝑥－1 6) Let f : [2, ∞)→ R be the function defined by f(x) = x2－4x+5, then the range of f is
2) Let f : N → R be the function defined by f(x) = and g : Q→R be another function
2
3 (a) [4, ∞)
defined by g(x) = x+2. Then (g𝑜f) is ?
2 (b) [5, ∞)
(a) 2 (c) R
(b) 1 (d) [1, ∞)
(c) 3
(d) 7/3 View Explanations
View Explanations
7)Let us consider the function f : R+ →[4, ∞) given by f(x) = x2+4, then
3) Let f : [0, 1] →[0, 1] and g : [0, 1] →[0, 1] be two functions defined by (a) f is not invertible
1－𝑥
f(x) = and g(x) = 4x(1－x), then (f o g)(x) equal (b) f is many – one
1+𝑥
(c) f is many – many
𝟒(𝟏－𝒙) (d) f is invertible
(a)
𝟏+𝒙
View Explanations
𝟖𝒙(𝟏－𝒙)
(b)
(𝟏+𝒙)𝟐
𝑎𝑥
𝟏－𝟒𝒙+𝟒𝒙𝟐 8) Let f(x)= , x≠1. Then for what value of a is f(f(x)) = x?
𝑥+1
(c)
𝟏+𝟒𝒙+𝟒𝒙𝟐
(a) －√2
𝟏－𝟒𝒙+𝟒𝒙𝟐 (b) －1
(d)
𝟏+𝟒𝒙－𝟒𝒙𝟐 (c) 1
View Explanations (d) √2

View Explanations
9) Let Y = {n2 : n ∈ N} ⊂ N. consider f : N →Y as f(n)= n2. Inverse of f is
(a) y2 13) If f : R→R and g: R→R defined by f(x) = 2x+3 and g(x) = x2+7, then the value of x for
(b) y2+2 which f(g(x)) = 25 is
(c) y2+1 (a) ±2
(d) √𝑦 (b) ±1
(c) ±4
(d) ±3
View Explanations
View Explanations
10) Let f : {2, 3, 4, 5} → {3, 4, 5, 9} and g : {3, 4, 5, 9} →{7, 11, 15} be
functions defined as f(2) = 3, f(3) = 4, f(5) = 5 and g(3) = g(4) = 7 14) If f : R→R and g : R→R are given by f(x) = cosx and g(x) = 3x2. Then
and g(5) = g(9) = 11. Then g𝑜f is (a) f is odd
(a) {7, 7, 15, 11} (b) g is odd
(b) {15, 15, 11, 11} (c) g𝑜f≠f𝑜g
(c) {7, 7, 11, 11} (d) g𝑜f=f𝑜g
(d) {7, 7, 5, 11} View Explanations
View Explanations
3𝑥+2
15) If f(x) = , then
5𝑥－3
11) Let a function f : R → R be given by f(x) = x3－3, then f－1is given by (a) f－1(x) = f(x)
(a) √𝑥+3 (b) (f𝑜f)(x) = －x
(b) √𝑥 + 3 (c) f－1(x) =－f(x)
(c) x+3 1
(d) f－1(x)= － f(x)
(d) x+√3 19

View Explanations
View Explanations 𝑥2
16) If the function 𝑓: 𝑅 → 𝐴 given by 𝑓(𝑥) = 2 is a surjection, then 𝐴 =
𝑥 +1
a) R
12) Let f : N →Y be a function defined as f(x) = 4x+ 3, where b) [0,1]
Y = {y∈N : y = 4x + 3} for some x∈ N. then f is c) (0,1]
(a) Many-many d) [0,1)
(b) Non invertible
(c) Invertible View Explanations
(d) Even
17) The function 𝑓(𝑥) = 𝑙𝑜𝑔(𝑥 + √𝑥 2 + 1) is
View Explanations
a) An even function
b) An odd function
c) Periodic function
d) None of these
View Explanations
 22) Let f : A → B and g : B →C be two functions. Then the composition of f and g, denoted by g 𝑜
f, is defined as
1+𝑥
18) The function 𝑓(𝑥) =𝑙𝑜𝑔 ( ) satisfies the equation (a) f(g(x)), ∀x∈ A
1－𝑥
(b) g(f(x+2)), ∀x∈ A
a) 𝑓(𝑥 + 2)－2𝑓(𝑥 + 1) + 𝑓(𝑥) = 0
(c) g(f(x)), ∀x∈ A
b) 𝑓(𝑥) + 𝑓(𝑥 + 1) = 𝑓{𝑥(𝑥 + 1)} (d) g(f(x2)), ∀x∈ A
𝑥+𝑦
c) 𝑓(𝑥) + 𝑓(𝑦) = 𝑓 ( )
1+𝑥𝑦
View Explanations
d) 𝑓(𝑥 + 𝑦) = 𝑓(𝑥)𝑓(𝑦)

23) Let R be the relation on N defined as xRy if x+2y = 8. The domain of R is

View Explanations (a) {2, 4, 6, 8}
1+𝑥 3 𝑥+𝑥 3 (b) {2, 4, 8}
19) Given 𝑓(𝑥) = 𝑙𝑜𝑔 ( ) and 𝑔(𝑥) = , then 𝑓𝑜𝑔 (𝑥) equals (c) {1, 2, 3, 4}
1－𝑥 1+3 𝑥 2
(d) {2, 4, 6}
a) －𝑓(𝑥)
b) 3𝑓(𝑥) View Explanations
c) [𝑓(𝑥)]3 24) Let f : A→B and g : B→C be the two bijective functions. Then (g𝑜f)－1 is
d) None of these (a) g𝑜f
View Explanations (b) f－1𝑜g－1
(c) g－1𝑜f－1
(d) f𝑜g
20) Let f and g be two functions such that Rg ⊂Df, then domain of the function (f𝑜g)(x)=
f(g(x)) is View Explanations
(a) Φ
(b)Df
25) Let f and g be two functions from R to R defined as
(c)Dg
f(x) = {0, 𝑥 𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 1, 𝑥 𝑖𝑠 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 ,
(d) Rg
g(x) = {－1, 𝑥 𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 0, 𝑥 𝑖𝑠 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙
View Explanations then, (g o f)(e) + (f 𝑜 g)(π) =
(a) 1
21) Let f : R→R be given by f(x) = tanx. Then f－1 (1) is (b) 2
(a) 2π (c) －1
(b) 23π (d) 0
𝜋
(c)
4
(d) π View Explanations

View Explanations
26) Let A = {1, 2, 3, …, n} and B = {a, b}. then the number of surjections from A to B is 31) Let R = {(x, y) : x2 +y2 = 1 and x, y, ∈R} be a relation in R. The relation R is
(a) nP2 (a) Symmetric
(b) 2n (b) Anti-symmetric
(c) 2n－2 (c) Reflexive
(d) 2n－1 (d) Transitive

View Explanations
View Explanations

27) Number of relations can be defined on the set A = {a, b, c, d} is 32) Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is
(a) 24 (a) Reflexive
(b) 44 (b) Symmetric
(c) 16 (c) Transitive
(d) 216 (d) None of these

View Explanations View Explanations

28) Let A = {1, 2, 3, 4, 5, 6}. Which of the following partitions of A to an equivalence relation 33) Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is
on A? (a) {1, 3}
(a) {1, 2, 3}, {4, 5, 6} (b) {1, 2}
(b) {1, 2, 3}, {3, 4, 5, 6} (c) None of these
(c) {1, 2}, {3, 4}, {2, 3, 5, 6} (d) {1, 2, 3}
(d) {1, 3}, {2, 4, 5}, {6}
View Explanations
View Explanations
34) Let us define a relation R in R(set of real numbers) as aRb is a≥b. Then R is
29) R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is (a) neither transitive nor reflexive
(a) not antisymmetric (b) an equivalence relation
(b) symmetric (c) symmetric, transitive but nor reflexive
(c) Anti symmetric (d) reflexive, transitive but not symmetric
(d) Reflexive View Explanations

View Explanations
35) Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}.
30) Which of the following is not an equivalence relation on I, the set of integers : x, y Then R is
(a) xRy, x+y is an even integer (a) neither symmetric, nor transitive
(b) xRy, x = y (b) symmetric and transitive
(c) xRy, x ≤y (c) reflexive but not symmetric
(d) reflexive but not transitive
(d) xRy, x－y is an even integer
View Explanations
View Explanations
36) Let f : A →B, (for any two non-empty sets A and B), then f is invertible is 41) S function f : X →Y is said to be one－on and onto is
(a) f is many-one (a) f is one-one
(b) f is both one-one and onto (b) f is onto
(c) f is one-one (c) f is both one-one and onto
(d) f is onto (d) f is either one-one or onto

View Explanations View Explanations

37) If R is a relation from a non-empty set A to a non-empty set B, then 42) If A is a finite set containing n distinct elements, then the number of relations on A is equal
(a) R⊂A×B to
(b) R=A∩B (a) 2𝑛
2

(c) R=A∪B (b) 2n

(d) R=A×B (c) n2
(d) 2×2
View Explanations
View Explanations
38) Given an arbitrary equivalence relation R in an arbitrary set X, R divides X into
(a) Intersecting sets 43) Let L be the set of all lines in a plane and R be the relation on L defined as R = {(L1, L2): L1
(b) two sets is perpendicular to L2}. Then R is
(c) mutually disjoint subsets (a) symmetric and transitive but not reflexive
(d) three sets (b) reflexive and transitive but not symmetric
(c) symmetric and reflexive but not transitive
View Explanations (d) symmetric but neither reflexive nor transitive

39) A relation R on a non-empty set A is an equivalence relation if it is View Explanations

(a) reflexive, symmetric and transitive
(b) reflexive 44) Let A = {a, b, c} and R = {(a, a), (b, b), (c, c)} be a relation on A. here, R is
(c) reflexive, anti-symmetric, transitive (a) Transitive
(d) symmetric and transitive (b) Anti－symmetric
(c) Symmetric
View Explanations (d) Reflexive

40) The void relation (a subset of A×A) on a nonempty set A is View Explanations
(a) reflexive
(b) Transitive, symmetric 45) A relation R on the set N of natural numbers is defined as
(c) only symmetric R = {(a, (b):a+b is even, ∀a, b∈N}, then R is
(d) only transitive (a) a reflexive relation but not symmetric
(b) an equivalence relation
View Explanations (c) symmetric but not transitive
(d) not an equivalence relation

View Explanations
46) Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
(a) {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
(b) {(1, 1), (2, 2), (3, 3)}
CASE STUDY QUESTIONS
(c) none of these
49) A relation 𝑅 on a set 𝐴 is said to be an equivalence relation on 𝐴 iff it is
(d) {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
• Reflexive i.e., (𝑎, 𝑎) ∈ 𝑅∀𝑎 ∈ 𝐴
• Symmetric i.e., (𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅∀𝑎, 𝑏 ∈ 𝐴
View Explanations
• Transitive i.e., (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅∀𝑎, 𝑏, 𝑐 ∈ 𝐴
Based on the above information, answer the following questions.
47) If a relation R on the set A = {1, 2, 3} be defined by R = {(1, 2)}, then R is (i) If the relation 𝑅 = {(1,1), (1,2), (1,3), (2,2), (2,3), (3,1), (3,2), (3,3)} defined on the set
(a) transitive 𝐴 = {1,2,3}, then 𝑅 is
(b) symmetric (a) reflexive
(c) reflexive but not symmetric (b) symmetric
(d) reflexive (c) transitive
(d) equivalence
View Explanations
(ii) If the relation 𝑅 = {(1,2), (2,1), (1,3), (3,1)} defined on the set 𝐴 = {1,2,3}, then 𝑅 is
48) Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined (a) reflexive
as aRb if a is congruent to b, a, b∈T. Then R is (b) symmetric
(a) an equivalence relation (c) transitive
(d) equivalence
(b) neither reflexive nor symmetric
(c) transitive but not symmetric (iii) If the relation 𝑅 on the set 𝑁 of all natural numbers defined as 𝑅 = {(𝑥, 𝑦): 𝑦 = 𝑥 + 5
(d) reflexive but not transitive and 𝑥 < 4}, then 𝑅 is
(a) reflexive
View Explanations (b) symmetric
(c) transitive
(d) equivalence

(iv) If the relation 𝑅 on the set 𝐴 = {1,2,3, … … . ,13,14} defined as 𝑅 = {(𝑥, 𝑦): 3𝑥 − 𝑦 = 0},
then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) None of these

(v) If the relation 𝑅 on the set 𝐴 = {1,2,3} defined as 𝑅 = {(1,1), (1,2), (1,3), (2,1)
(2,2), (2,3), (3,1), (3,2), (3,3)}, then 𝑅 is
(a) reflexive only
(b) symmetric only
(c) transitive only
(d) equivalence

View Explanations
 𝑥−1
50) Consider the mapping 𝑓: 𝐴 → 𝐵 is defined by 𝑓(𝑥) = such that 𝑓 is a bijection. Based on
𝑥−2
the above information, answer the following questions.
(i) Domain of 𝑓 is
(a) 𝑅 − {2}
(b) 𝑅
(c) 𝑅 − {1,2}
(d) 𝑅 − {0}

(ii) Range of 𝑓 is
(a) 𝑅
(b) 𝑅 − {1}
(c) 𝑅 − {0}
(d) 𝑅 − {1,2}

(iii) If 𝑔: 𝑅 − {2} → 𝑅 − {1} is defined by 𝑔(𝑥) = 2𝑓(𝑥) − 1, then 𝑔(𝑥) in terms of 𝑥 is

𝑥+2
(a)
𝑥
𝑥+1
(b)
𝑥−2
𝑥−2
(c)
𝑥
𝑥
(d)
𝑥−2

(iv) The function 𝑔 defined above, is

(a) One-one
(b) Many-one
(c) into
(d) None of these

(v) A function 𝑓(𝑥) is said to be one-one iff

(a) 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ −𝑥1 = 𝑥2
(b) 𝑓(−𝑥1 ) = 𝑓(−𝑥2 ) ⇒ −𝑥1 = 𝑥2
(c) 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑥1 = 𝑥2
(d) None of these

View Explanations