RELATIONS AND FUNCTIONS

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]
 36) Which of the following is not an equivalence relation on Z?
a) a R b  a  bisan evenint eger c) a R b a  b
d)
a R b a  b
b)
a R b  a  bisan evenint eger

37) Therelation 'R 'in NxNsuch that (a,b)R(c,d)  a  d  b  cis

a) Reflexive but not symmetric c) An equivalence relation
b) Reflexive and transitive but not d) None of these.
symmetric
38) R isa relation on theset Zof int egersandit isgiven by(x, y) R | x  y | 1.
Then, R is
a) Reflexive and transitive c) Symmetric and transitive
b) Reflexive and symmetric d) An equivalence relation
39) Let A={1,2,3}. Then, the number of relation containing (1,2) and (1,3) which are reflexive and
symmetric but not transitive is
a) 1 b) 2 c) 3 d) 4
40) Let R be the relation on the set A = {1,2,3,4} given by R = {(1,2), (2,2), (1,1), (4,4) , (1,3), (3,3), (3,2)}.
Then,
a) R is reflexive and symmetric but not transitive
b) R is reflexive and transitive but not symmetric.
c) R is symmetric and transitive but not reflexive.
d) R is an equivalence relation.
41) Let R be the relation defined on N of natural numbers by the rule the x R y iff x+2y=8, domain of R is
a) {2,4,8) b) {2,4,6} c) {2,4,6,8} a. {1,2,3,4}

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

 42) If R is relation on the set A = {1,2,3,4,5,6,7,8,9} given by xRy  y  3x, then R 
a){(3,1),(6,2),(8,2),(9,3)} c) {(3,1), (2,6), (3,9)}
b) {(3,1),(6,2),(9,3)} d) None of these.
43) If R is the largest equivalence relation on set A and S is any relation on A, then
a) R  S b) S  R c) R = S d) None.
44) If f is a function from a set A to A , then f is invertible iff f is
a) One-one c) Both one-one and onto
b) Onto d) None of these.
45) Let R = { (a,a) , (b,b) (c,c) (a,b)} be a relation on set A = {a,b,c} . Then , R is
a) Identity relation c) Symmetric
b) Reflexive d) antisymmetric
46) S is relation over the set R of all real numbers and it is given by (a,b)  S  ab  0.ThenSis
a) Symmetric and transitive only c) A partial order relation
b) Reflexive and symmetric only d) An equivalence relation.
47) If A ={1,2,3,4}, B={1,4,6,9} and R is a relation from AtoB defined by ‘x’ is greater than ‘y’.The range of R is
a) {1,4,6,9} b) {4,6,9} c) {1} d) None
48) The relation R = {(1,1), (2,2) ,(3,3) } on the set {1,2,3} is
a) Symmetric only c) An equivalence relation
b) Reflexive only d) Transitive only
49) Let A = {2,3,4,5,……..,17,18}. Let ‘=’ be the equivalence relation on A x A , Cartesian product of A with
itself, defined by (a,b) = (c,d) iff ad= bc . Then , the number of ordered pairs of the equivalence class of
(3,2) is
a) 4 b) 5 c) 6 d) 7
50) Let A and B be finite sets containing m and n elements respectively. The number of relations that can be
defined from A to B is
a) Mm mm m n d) None .
b) 2 c) 2
51) Let R be the relation over the set of all straight lines in a plane such that
l1Rl2  l1  l2 .Then R is
a) Symmetric c) Transitive
b) Reflexive d) An equivalence relation.
52) Let A be a finite set containing n elements. The number of one-one functions that can be defined from A
to B is
n2
a) 2n c) 2
b) n2 d) None .
53) Let R be a relation on the set N given by R ={(a,b) : a=b-2, b>6} . Then ,
a) (2,4)  R b) (3,8)  R c) (6,8)  R d)
(8,7)  R
54) Let A = {1,2,3} and R ={(1,1), (2,2) , (1,2), ( 2,1), (1,3) }, then R is
a) Reflexive b) Symmetric c) Transitive d) None

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

55) If f(x) = ax+b and g(x) =cx+d, then f(g(x)) = g(f(x)) for all x  R if and only if
a) F(a) = g(c) b) F(b) = g(b) c) F(d)=g(b) d) F (c ) = g(a)
56) Let A = {1,2,3}. Which of the following functions on A is invertible?
a) F = {(1,1), (2,1), (3,1)} c) F={(1,2), (2,3), (3,2)}
b) F= {(1,2), (2,3), (3,1)} d) F={(1,1),(2,2),(3,1)}
57) If R is relation on the set A = {1,2,3} given by R = {(1,1),(2,2),(3,3)}, then R is
a) Reflexive c) Transitive
b) Symmetric d) All the three options
58) Let f : R  R be defined by the rule f (x)  x 2  3x  4for all x  R, then f 1 (2) is =
a) (1,2) b) [1,2] c) {1,2} d) None.
59) Let R1 and R 2 be equivalence relations on a set A, then R1  R 2 may or may not be
a)reflexive c)transitive
b)symmetric d) None of these.
60) In the set Z of all integers, which of the following relation R is not an equivalence relation?
a) xRy:if x  y c) xRy:if x  yisan evenint eger
b) xRy:if x  y d)
xRy:if x  y(mod3)
61) Let R be a relation on N defined by x+2y = 8 . The domain of R is
a) (2,4,8} b) {2,4,6,8} c) {2,4,6} d) {1,2,3,4}
62) A relation R is defined from {2,3,4,5} to { 3,6,7,10} by : xRy  x is relatively prime to y. Then domain
of R is
a) {2,3,5} b) {3,5} c) {2,3,4} d) {2,3,4,5}
63) Let A = {1,2,3} and B={2,3,4} , then which of the following is a function from A to B ?
a) {(1,2), (1,3), (2,3), (3,3)} c) {(1,3), (2,3), (3,3)}
b) {(1,3), ((2,4)} d) {(1,2), (2,3), (3,4), (3,2)}
64) Let A = {1,2,3}. Then, the number of equivalence relations containing (1,2) is
a) 1 b) 2 c) 3 d) 4
65) Thefunction f :[0,3]  [1,29],defined byf (x)  2x 3  15x 2  36x  1,is
a)one-one and onto c) one-one but not onto
b) onto but not one-one d) neither one-one nor onto
66) Let R be the real line. Consider the following subsets of the plane R x R:
S = {(x,y) : y= x+1 and 0 < x < 2}
T = {(x,y) : x-y is an integer}. Which one of the following is true?
a) Neither S nor T is an equivalaence relation on R. b) Both S and T are equivalence relations on R.
b) S is an equivalence relation on R but T is not c) T is an equivalence relation on R but S is not.
 2x 
67) Let f : (1,1)  B , be a function defined by f(x) = tan 1  2 
, then f is both one-one and
1 x 
onto when B is the interval:

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

          
a)  ,  b)
  2 , 2  c)
0, 2   0, 
 2 2 d)  2
68) A real valued function f(x) satisfies the function equation
F(x-y) = f(x) f(y) – f(a-x) f(a+y) , where a is a given constant and f (0) = 1. f (2a-x) is equal to :
a) f (-x) b) f (a) + f (a-x) c) f (x) d) –f (x)
69) Let f : N  Ybea function defined byf (x)  4x where
Y  {y  N :y  4x  3forsome x  N},inverseof f is
3y  4 y3 y3 y3
a) g(y)  b) g(y)  4  c) g(y)  d) g(y) 
3 4 4 4

2
70) Let f :(1,1)  R besuch that f (cos 4)  for
2  sec2 
    1
  0,    ,  , then the valueof f   is
 4 4 2  3
d) (a) and (b)
3 3 2
a) 1 b) 1  c) 1  both.
2 2 3
71)

72)

73) The relation R in the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)} is
(a) reflexive and symmetric but not transitive
(b) reflexive and transitive but not symmetric
(c) symmetric and transitive but not reflexive
(d) an equivalence relation
74) If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is
(a) symmetric only (b) transitive only (c) reflexive and transitive (d) symmetric and transitive only

75) Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and
symmetric but not transitive is
(a) 1 (b) 2 (c) 3 (d) 4

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

76) Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is/are
(a) 1 (b) 2 (c) 3 (d) 4
77) Let A and B be finite sets containing m and n elements respectively. The number of relations that can be
defined from A to B is
(a) 2mn (b) 2m+n (c) mn (d) 0
78) The function f : R → R defined by f(x) = 2x + 2|x| is
(a) One-one and onto (b) Many-one and onto (c) One-one and into (d) Many-one and into

79) Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is
a) reflexive and symmetric (b) transitive and symmetric
(c) equivalence (d) reflexive, transitive but not symmetric
80) Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is
(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric nor transitive

81) If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is

(a) reflexive (b) transitive (c) symmetric (d) none of these
82) In the set Z of all integers, which of the following relation R is not an equivalence relation?

(a) x R y : if x ≤ y (b) x R y : if x = y (c) x R y : if x – y is an integer (d) x R y : if x ≅ y (Mod 3)

83) Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on set A. Then R is
(a) neither reflexive nor transitive (b) neither symmetric nor transitive (c) transitive (d) None of these
84) Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4,4),
(1, 3), (3, 3), (3, 2)
(A) R is reflexive and symmetric but not transitive. (B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive. (D) R is an equivalence relation
.
85) Let f : R → R be defined as f(x) = x4.
(A) f is one-one onto (B) f is many-one onto
(C) f is one-one but not onto (D) f is neither one-one nor onto
86) Let f : R →R be defined as f (x) = 3x.
(A) f is one-one onto (B) f is many-one onto
(C) f is one-one but not onto (D) f is neither one-one nor onto.

87) Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and
symmetric but not transitive is
(A) 1 (B) 2 (C) 3 (D) 4
88) Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is

(A) 1 (B) 2 (C) 3 (D) 4

89) The number of all onto functions from the set {1, 2, 3,......, n} to itself.is
a. n! b. 0 c. 2n -1 d. 2n - 2
90) the total number of equivalence relations containing (1, 2) and (2, 1) is
a. 1 b. 2 c. 3 d. 4
91) Let A = {1, 2, 3}. Then show that the number of relations containing (1, 2) and (2, 3) which are
reflexive and transitive but not symmetric is
a. 1 b. 2 c. 3 d. 4

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]

92) The number of all one-one functions from set A = {1, 2, 3} to itself.
a. 2 b. 4 c. 6 d. 8

93) The total number of relations on a finite set having n elements is

n 2 -n
2 2
n n -n 2
a. 2 b) 2 c) 2 d) n
94) The total number of reflexive relations on a finite set having n elements is
n 2 -n
2 2
n -n n 2
a. 2 b) 2 c) 2 d) n
b.
95) The symmetric relations on an n element set are there____
n(n+1) n 2 -n
2 2 n2
a. 2 b) 2 c) 2 d) n
96) The total number of reflexive and symmetric relations on a finite set having n elements is
n 2 -n n(n+1)
2 n2 2
a. 2 b) 2 c) 2 d) n
97) Let A and B be finite sets containing m and n elements respectively. The number of functions that can
be defined from A to B is
n 2 -n n(n+1)
m 2 n2 2
a. n b) 2 c) 2 d) 2
98) Let A and B be finite sets containing m and n elements respectively. The number of one to one
functions that can be defined from A to B is (n≥m)
n 2 -n n(n+1)
2 n2 2
a. np m b) 2 c) 2 d) 2
99) Let A and B be finite sets containing m and n elements respectively. The number of one to one
functions that can be defined from A to B is (n<m)
n 2 -n
2 n2
a. 0 b) np m c) 2 d) 2
100) Let A and B be finite sets containing m and n elements respectively. The number of onto functions
that can be defined from A to B is (n≥m)
2
a. n m - n C1 (n-1)m + n C2 (n-2)m - n C3 (n-3) m +... c. 2n
n(n+1)
2
n 2 -n d. 2
2
b. 2
101) Let A and B be finite sets containing m and n elements respectively. The number of onto functions
that can be defined from A to B is (n<m)
a. 0 b. np m n 2 -n n2
d. 2
c. 2 2
102) Let A and B be finite sets containing m and n elements respectively. The number of bijective
functions that can be defined from A to B is (n=m)
a. n! n 2 -n n2 n(n+1)
c. 2
b. 2 2 d. 2 2

Prepared by C . VELUSAMY MSc., BEd., PGT MATHS [Mobile : 9865660308]