(c) SoR (d) RoS

THAMARAI INTERNATIONAL SCHOOL, KUMBAKONAM

14. If R be a relation < from A = {1,2, 3, 4} to B = {1, 3, 5} i.e.,
GRADE: -12-MATHEMATICS
TOPIC: CH-1 RELATION & FUNCTION (MCQs) (a , b )∈ R ⇔a<b , then RoR−1 is
(a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
Relations (b) {(3, 1) (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
(c) {(3, 3), (3, 5), (5, 3), (5, 5)}
1. Let A = {1, 2, 3}. The total number of distinct relations that can be (d) {(3, 3) (3, 4), (4, 5)}
defined over A is 15. A relation from P to Q is
9
(a) 2 (b) 6 (a) A universal set of P × Q
(c) 8 (d) None of these (b) P × Q
(c) An equivalent set of P × Q
2. Let
X={1, 2, 3, 4, 5} and
Y={1, 3, 5, 7 , 9}. Which of the following
(d) A subset of P × Q
is/are relations from X to Y 16. Let A = {a, b, c} and B = {1, 2}. Consider a relation R defined from set
R1 ={( x , y )|y =2+x , x ∈ X , y ∈Y } A to set B. Then R is equal to set
(a)
[Kurukshetra CEE 1995]
R2={(1, 1), (2, 1), (3, 3), ( 4, 3), (5, 5)}
(b) (a) A (b) B
R3={(1, 1), (1, 3)(3, 5), (3, 7), (5, 7)} (c) A × B (d) B × A
(c)
17. Let n(A) = n. Then the number of all relations on A is
R ={(1, 3), (2, 5), (2, 4), (7, 9)}
(d) 4 n (n )!
(a) 2 (b) 2
3. Given two finite sets A and B such that n(A) = 2, n(B) = 3. Then total
n2
number of relations from A to B is (c) 2 (d) None of these
(a) 4 (b) 8 18. If R is a relation from a finite set A having m elements to a finite set B
(c) 64 (d) None of these having n elements, then the number of relations from A to B is
4. The relation R defined on the set of natural numbers as {(a, b) : a mn mn
differs from b by 3}, is given by (a) 2 (b) 2 −1
n
(a) {(1, 4, (2, 5), (3, 6),.....} (b) {(4, 1), (5, 2), (6, 3),.....} (c) 2 mn (d) m
(c) {(1, 3), (2, 6), (3, 9),..} (d) None of these 19. Let R be a reflexive relation on a finite set A having n-elements,
5. The relation R is defined on the set of natural numbers as {(a, b) : a = and let there be m ordered pairs in R. Then
−1
2b}. Then R is given by (a) m≥ n (b) m≤ n
(a) {(2, 1), (4, 2), (6, 3).....} (b) {(1, 2), (2, 4), (3, 6)....} (c) m= n (d) None of these
−1 20. The relation R defined on the set A = {1, 2, 3, 4, 5} by
(c) R is not defined (d) None of these
2 2
6. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = R = {(x, y) : |x − y |<16 ¿¿ is given by
{1, 2, 3} is (a) {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)}
(a) Reflexive but not symmetric (b) {(2, 2), (3, 2), (4, 2), (2, 4)}
(b) Reflexive but not transitive (c) {(3, 3), (3, 4), (5, 4), (4, 3), (3, 1)}
(c) Symmetric and Transitive (d) None of these
(d) Neither symmetric nor transitive
21. A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by xRy ⇔ x is
7. The relation “less than” in the set of natural numbers is
[UPSEAT 1994, 98, 99; AMU 1999]
relatively prime to y. Then domain of R is
(a) {2, 3, 5} (b) {3, 5}
(a) Only symmetric (b) Only transitive
(c) {2, 3, 4} (d) {2, 3, 4, 5}
(c) Only reflexive (d) Equivalence relation
22. Let R be a relation on N defined by x +2 y=8 . The domain of R is
8. Let
P={( x , y)|x 2 + y 2 =1, x , y ∈ R}. Then P is
(a) {2, 4, 8} (b) {2, 4, 6, 8}
(a) Reflexive (b) Symmetric (c) {2, 4, 6} (d) {1, 2, 3, 4}
(c) Transitive (d) Anti-symmetric
23. If R={(x , y)|x , y∈ Z , x2 + y 2 ≤4} is a relation in Z, then domain of
9. Let R be an equivalence relation on a finite set A having n elements.
Then the number of ordered pairs in R is R is
(a) Less than n (a) {0, 1, 2} (b) {0, – 1, – 2}
(c) {– 2, – 1, 0, 1, 2} (d) None of these
(b) Greater than or equal to n
(c) Less than or equal to n 24. R is a relation from {11, 12, 13} to {8, 10, 12} defined by y=x −3 .
−1
(d) None of these Then R is
10. √
For real numbers x and y, we write xRy  x− y + 2 is an irrational
(a) {(8, 11), (10, 13)} (b) {(11, 18), (13, 10)}
(c) {(10, 13), (8, 11)} (d) None of these
number. Then the relation R is
25. Let A = {1, 2, 3}, B = {1, 3, 5}. If relation R from A to B is given by R
(a) Reflexive (b) Symmetric −1
(c) Transitive (d) None of these ={(1, 3), (2, 5), (3, 3)}. Then R is
11. Let X be a family of sets and R be a relation on X defined by ‘A is (a) {(3, 3), (3, 1), (5, 2)} (b) {(1, 3), (2, 5), (3, 3)}
disjoint from B’. Then R is (c) {(1, 3), (5, 2)} (d) None of these
(a) Reflexive (b) Symmetric 26. Let R be a reflexive relation on a set A and I be the identity relation on
A. Then
(c) Anti-symmetric (d) Transitive
12. If R is a relation from a set A to a set B and S is a relation from B to a (a) R ⊂ I (b) I ⊂ R
set C, then the relation SoR (c) R=I (d) None of these
(a) Is from A to C (b) Is from C to A 27. Let A = {1, 2, 3, 4} and R be a relation in A given by R = {(1, 1), (2, 2),
(c) Does not exist (d) None of these (3, 3), (4, 4), (1, 2), (2, 1), (3, 1), (1, 3)}.

13. If R ⊂ A×B and S ⊂B×C be two relations, then (SoR )

−1
= Then R is
(a) Reflexive (b) Symmetric
−1 −1 −1 −1
(a) S oR (b) R oS (c) Transitive (d) An equivalence relation
28. An integer m is said to be related to another integer n if m is a multiple (d) Possesses all the above three properties
of n. Then the relation is 43. The relation "congruence modulo m" is
(a) Reflexive and symmetric (b) Reflexive and transitive (a) Reflexive only (b) Transitive only
(c) Symmetric and transitive (d) Equivalence relation (c) Symmetric only (d) An equivalence relation
29. The relation R defined in N as aRb ⇔b is divisible by a is p∈Z,
44. Solution set of x≡3 (mod 7), is given by
(a) Reflexive but not symmetric
(b) Symmetric but not transitive (a) {3} (b)
{7 p−3 : p ∈ Z}
(c) Symmetric and transitive {7 p+3: p ∈ Z }
(d) None of these (c) (d) None of these
−1 45. Let R and S be two equivalence relations on a set A. Then
30. Let R be a relation on a set A such that R=R , then R is (a) R  S is an equivalence relation on A
(a) Reflexive (b) Symmetric (b) R  S is an equivalence relation on A
(c) Transitive (d) None of these
31. Let R = {(a, a)} be a relation on a set A. Then R is (c) R−S is an equivalence relation on A
(a) Symmetric (d) None of these
(b) Antisymmetric 46. Let R and S be two relations on a set A. Then
(c) Symmetric and antisymmetric (a) R and S are transitive, then R  S is also transitive
(d) Neither symmetric nor anti-symmetric (b) R and S are transitive, then R  S is also transitive
32. The relation "is subset of" on the power set P(A) of a set A is (c) R and S are reflexive, then R  S is also reflexive
(a) Symmetric (b) Anti-symmetric (d) R and S are symmetric then R  S is also symmetric
(c) Equivalency relation (d) None of these 47. Let R = {(1, 3), (2, 2), (3, 2)} and S = {(2, 1), (3, 2), (2, 3)} be two
33. The relation R defined on a set A is antisymmetric if relations on set A = {1, 2, 3}. Then RoS =
(a, b)∈R ⇒(b, a)∈R (a) {(1, 3), (2, 2), (3, 2), (2, 1), (2, 3)}
for (b) {(3, 2), (1, 3)}
(a) Every (a, b) ∈ R (b) No
(a, b)∈R (c) {(2, 3), (3, 2), (2, 2)}

(c) No
(a, b), a≠b, ∈R (d) None of these
(d) {(2, 3), (3, 2)}
48. Let L denote the set of all straight lines in a plane. Let a relation R be
34. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by
R = {(x, y)| x, y ∈ A and x < y}. Then R is defined by αRβ ⇔α ⊥ β, α , β∈ L . Then R is
(a) Reflexive (b) Symmetric (a) Reflexive (b) Symmetric
(c) Transitive (d) None of these (c) Transitive (d) None of these
35. Let A be the non-void set of the children in a family. The relation x is a 49. Let R be a relation over the set N × N and it is defined by
'
brother of y on A is (a, b)R (c , d)⇒ a+d=b+c. Then R is
(a) Reflexive (b) Symmetric (a) Reflexive only (b) Symmetric only
(c) Transitive (d) None of these (c) Transitive only (d) An equivalence relation
36. Let A = {1, 2, 3, 4} and let R= {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation 50. Let n be a fixed positive integer. Define a relation R on the set Z of
on A. Then R is
integers by,
aRb ⇔n|a−b |. Then R is
(a) Reflexive (b) Symmetric
(c) Transitive (d) None of these (a) Reflexive (b) Symmetric
37. The void relation on a set A is (c) Transitive (d) Equivalence
(a) Reflexive (b) Symmetric and transitive 51. Let
R={(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9),(3, 12), (3, 6)} be a
(c) Reflexive and symmetric (d) Reflexive and transitive
relation on the set
A={3, 6, 9, 12}. The relation is
R R ={(a , b )|a≥b , a , b ∈ R} R1
38. Let 1 be a relation defined by 1 . Then [AIEEE 2005]
is [UPSEAT 1999] (a) An equivalence relation
(a) An equivalence relation on R (b) Reflexive and symmetric only
(b) Reflexive, transitive but not symmetric
(c) Reflexive and transitive only
(c) Symmetric, Transitive but not reflexive
(d) Reflexive only
(d) Neither transitive not reflexive but symmetric
39. Which one of the following relations on R is an equivalence relation 52. x 2 =xy is a relation which is [Orissa JEE 2005]
a R 1 b ⇔|a|=|b| aR 2 b⇔ a≥b (a) Symmetric (b) Reflexive
(a) (b)
(c) Transitive (d) None of these
aR 3 b⇔ a divides b aR 4 b⇔ a<b 53. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A =
(c) (d)
−1 {1, 2, 3, 4}. The relation R is [AIEEE 2004]
40. If R is an equivalence relation on a set A, then R is (a) Reflexive (b) Transitive
(a) Reflexive only (c) Not symmetric (d) A function
(b) Symmetric but not transitive 54. The number of reflexive relations of a set with four elements is equal to
(c) Equivalence
(d) None of these 16 12
(a) 2 (b) 2
41. R is a relation over the set of real numbers and it is given by nm≥0 . 8 4
Then R is (c) 2 (d) 2
(a) Symmetric and transitive (b) Reflexive and symmetric 55. Let S be the set of all real numbers. Then the relation R = {(a, b) : 1 +
ab > 0} on S is
(c) A partial order relation (d) An equivalence relation
(a) Reflexive and symmetric but not transitive
42. In order that a relation R defined on a non-empty set A is an equivalence
(b) Reflexive and transitive but not symmetric
relation, it is sufficient, if R
[Karnataka CET 1990]
(c) Symmetric, transitive but not reflexive
(a) Is reflexive (d) Reflexive, transitive and symmetric
(e) None of the above is true
(b) Is symmetric
56. If A is the set of even natural numbers less than 8 and B is the set of
(c) Is transitive
prime numbers less than 7, then the number of relations from A to B is
 9 2 (c) reflexive and transitive
(a) 2 (b) 9
2 9−1 (d) symmetric and transitive
(c) 3 (d) 2 7. Let R be a relation on the set N defined by {(x, y): x, y ∈ N, 2x + y
1 a 2 a,b,c 3 c 4 b 5 b = 41}. Then R is
(a) reflexive
6 a 7 b 8 b 9 b 10 a
(b) symmetric
11 b 12 a 13 b 14 c 15 d (c) transitive
16 c 17 c 18 a 19 a 20 d (d) None of these.
8. Let S be the set of all real numbers. Then the relation
21 d 22 c 23 c 24 a 25 a
R = {(a, b): 1 + ab > 0} on S is
26 b 27 a,b 28 b 29 a 30 b (a) reflexive and symmetric but not transitive.
31 c 32 b 33 c 34 c 35 bc
(b) reflexive and transitive but not symmetric.
(c) symmetric and transitive but not reflexive.
36 c 37 b 38 b 39 a 40 c (d) reflexive, symmetric and transitive.
41 d 42 d 43 d 44 c 45 b 9. Let W denote the words in the English dictionary. The relation R is
a,b,c,d
defined by R = {(x, y) ∈ W × W: the words x and y have at least one
46 b,c,d 47 c 48 b 49 d 50
letter in common}. Then R is
51 c 52 b 53 c 54 d 55 a (a) not reflexive, symmetric and transitive
56 a (b) reflexive, symmetric and not transitive
(c) reflexive, symmetric and transitive
(d) reflexive, transitive and not symmetric
10. On the set N of all natural numbers define the relation R by aRb
if and only if the G.C.D. of a and b is 2, then R is
(a) reflexive but not symmetric
(b) symmetric only
(c) reflexive and transitive
(d) reflexive, symmetric and transitive

1. R is a relation over the set N × N and it is defined by (a, b) R(c, d)

⇒ a + d = b + c, then R is
(a) reflexive only
(b) symmetric only
(c) transitive only
(d) equivalence relation 1. A function f : N → N defined as y = x2 is
2. Let R be a relation over the set of straight lines in a plane (a) one-one
such that l1 R l2 such that l1 ^ l2, then R is (b) onto
(a) symmetric (c) bijective
(b) reflexive (d) None of these.
(c) transitive 2. Domain of the function: f : R → R defined as y = x + 4 is
(d) equivalence relation (a) Real numbers
3. A relation R is defined on plane A of triangles in a given planes (b) Natural numbers
defined as R = {(T1, T2): T1 congruent to T2 and T1, T2 ∈ A}, then R (c) Negative real numbers
is (d) None of these.
(a) reflexive
(b) symmetric 3. Domain of a real valued function f (x) = 36 − x2 is:
(c) transitive (a) [–6, 6] (b) (–6, 6) (c) (–6, 6] (d) [–6, 6)
(d) equivalence 4. Number of function from set {1, 2} into set {a, b, c} are
4. Consider the non-empty set consisting of children in a family and (a) (2)3 (b) (3)2 (c) (2)2 (d) (3)3
a relation R defined as a Rb if a is a brother of b. Then R is 5. Number of one-one functions that can be defined from a
(a) symmetric but not transitive set {3, 4, 5} into a set {1, 2} are
(b) transitive but not symmetric (a) 2P3 (b) 0 (c) 2P2 (d) 3P3
(c) neither symmetric nor transitive 6. The function f: R → [–1, 1] defined by f (x) = cos x is
(d) both symmetric and transitive. (a) both one-one and onto
5. Let R be the relation on the set R of all real numbers defined (b) not one-one, but onto
by a R b iff |a – b| ≤ 1. Then R is (c) one-one, but not onto
(a) reflexive and symmetric (d) neither one-one, nor onto
(b) symmetric only 7. Every function is a
(c) transitive only (a) relation.
(d) anti symmetric only (b) onto function
6. A relation R = {(a, b): a divides b} on the set N of all (c) injective function
natural numbers is (d) bijective function
(a) reflexive 8. A function which is injective and surjective is called
(b) symmetric (a) onto function only
(b) bijective function 48. If R denotes the set of all real numbers then the function f : R →R
(c) one-one function
(d) None of these. defined f ( x)= [ x ]
9. An onto function from set A to set B means every element (a) One-one only (b) Onto only
of set B has a pre-image in (c) Both one-one and onto (d) Neither one-one nor onto
(a) Set B × A 114. If the function f :[1, ∞)→[1, ∞) is defined by f ( x )=2 x ( x −1 ) , then f −1
(b) Set A (x) is
(c) Set A × B
()
x ( x−1)
1 1
(d) None of these. (1+ √ 1+4 log 2 x )
10. A function f : R → R is defined as f(x) = x3 + 1. Then the (a) 2 (b) 2
function has 1
(1−√1+ 4 log 2 x )
(a) no minimum value (c) 2 (d) Not defined
(b) no maximum value −1
(c) both maximum and minimum value 115. If f ( x )=3 x−5 , then f ( x )
(d) neither maximum value nor minimum value 1
(a) Is given by 3 x −5
x+5
x f (a )
f ( x )= = (b) Is given by 3
6. If x−1 , then f ( a+1) (c) Does not exist because f is not one-one

()
1 (d) Does not exist because f is not onto
f
(a) f (−a) (b)
a

(c) f (a2 ) (d)

f ( )
−a
a−1
x−|x| x
f ( x )= f ( x )= −1
13. If |x| , then f (−1)= 117. If 1+ x , then f ( x ) is equal to
(a) 1 (b) –2 ( 1+ x ) 1
(c) 0 (d) +2
(a) x (b) (1+ x )
2
28. The function f : R →R , f ( x)=x , ∀ x ∈ R is (1+x ) x
(a) Injection but not surjection (c) (1−x ) (d) (1−x )
(b) Surjection but not injection 118. Which of the following function is inverse function
(c) Injection as well as surjection 1
f ( x )=
(d) Neither injection nor surjection
(a) x−1 (b) f ( x )=x 2 for all x
29. If for two functions g and f, gof is both injective and surjective, then
which of the following is true (c) f ( x )=x 2 , x≥0 (d) f ( x )=x 2 , x≤0
(a) g and f should be injective and surjective
(b) g should be injective and surjective 121. Inverse of the function y=2 x−3 is
(c) f should be injective and surjective x+3 x−3
(d) None of them may be surjective and injective
(a) 2 (b) 2
2
32.Function f : R →R , f ( x )=x +x is 1
(a) One-one onto (b) One-one into (c) 2 x−3 (d) None of these
(c) Many-one onto (d) Many-one into 2 x+1
f ( x)=cos x , x∈ R will be f ( x )=
33. Mapping f : R →R which is defined as
−1
122. Let the function f be defined by 1−3 x , then f ( x ) is
(a) Neither one-one nor onto x−1 3 x +2
(b) One-one 3 x +2
(a) (b) x−1
(c) Onto
x+1 2 x +1
(d) One-one onto
f : R →R (c) 3 x −2 (d) 1−3 x
34. The function defined by f ( x)=(x −1) ( x−2 )(x−3) is
123. If f ( x )=x 2 +1 , then f −1 (17 ) and f −1 (−3) will be
(a) One-one but not onto (b) Onto but not one-one (a) 4, 1 (b) 4, 0
(c) Both one-one and onto (d) Neither one-one nor onto (c) 3, 2 (d) None of these
35. If f : R →R , then f ( x )=|x| is 128. If f ( x )=x 2 −1 and g( x )=3 x +1 , then ( gof )( x)=
(a) One-one but not onto (b) Onto but not one-one 2 2
(a) x −1 (b) 2 x −1
(c) One-one and onto (d) None of these 2 2
(c) 3 x −2 (d) 2 x +2
39. Set A has 3 elements and set B has 4 elements. The number of injection 129. If f is an exponential function and g is a logarithmic function, then
that can be defined from A to B is fog(1 ) will be
(a) 144 (b) 12
log e e
(c) 24 (d) 64 (a) e (b)
x−m (c) 0 (d) 2e
f ( x )= 2
40. Let f : R →R be a function defined by x −n , where m≠ n . 132. If f ( x )=x +1 ,then fof ( x ) is equal to
Then 2 2
(a) x +1 (b) x +2 x+ 2
(a) f is one-one onto (b) f is one-one into 4 2
(c) f is many one onto (d) f is many one into (c) x +2 x +2 (d) None of these
1 d 2 c 3 b 4 b 5 a
6 c 7 d 8 b 9 c 10 a

11 a 12 c 13 b 14 d 15 b

16 c 17 d 18 c 19 a 20 c

21 b 22 d 23 d 24 d 25 b

26 b 27 a 28 d 29 a 30 b

31 c 32 d 33 a 34 b 35 d

36 b 37 a 38 c 39 c 40 b

41 c 42 a 43 c 44 a 45 c

46 b 47 a 48 d 49 d 50 a

51 c 52 d 53 c 54 b 55 d

56 b 57 b 58 a 59 c 60 c

61 a 62 d 63 b 64 b 65 b

66 c 67 b 68 c 69 c 70 b

71 d 72 b 73 b 74 b 75 c

76 d 77 d 78 a 79 c 80 d

81 c 82 d 83 a 84 a 85 d

86 d 87 b 88 a 89 c 90 d

91 b 92 b 93 b 94 d 95 b

96 b 97 b 98 b 99 b 100 b

101 c 102 b 103 c 104 c 105 d

106 b 107 d 108 b 109 b 110 a

111 a 112 a 113 b 114 b 115 b

116 b 117 d 118 a 119 c 120 a

121 a 122 a 123 d 124 c 125 b

126 a 127 c 128 c 129 b 130 d

131 c 132 c 133 b 134 c 135 a

136 a 137 d 138 a 139 b 140 c

141 b 142 b 143 d 144 d 145 b

146 c 147 b 148 c 149 c 150 b

151 e 152 c 153 b 154 c 155 a

156 e 157 a,b,c 158 c 159 d 160 c

161 a 162 c 163 b 164 b 165 d