Adobe Scan Feb 21, 2025
Adobe Scan Feb 21, 2025
77. Iet ' be the reatlon deincd on the set of all real Which oDe of the following is
(a) Tis an equivaence
relation on Rbut
(b) Neither S nor Tis an equivalence Sis non
relatrioenSlatiTions
"hen P
(u) rellexive and nypmetrie but pot trapsijve (c) IBoth Sand Tare equivalence oY
M (b) retlexive and transittve but ot
nymetric (d) Sis an equivalence relation on Rbut on
() nymere and rapsitive but no rellexive not
(d) an cqulvalence relation (Online 2014) 84. Let Wdenote the words in the English (246;
7H. Lct R- ((3, 3), (5, 5), (9, 9), (02, I2), (5, 12), (3, 9),
(3, 12), (3, 5)| be arelation on the set
Define the relation R by:
R={(x, y) e Wx W|the words xand yy dictiona:
'lhen, RiN
3,5,9, 12). one letter in common}. have al le
(a) rellexive, synmeric bul not transitive Then Ris
(b) symmetrkc, transitive bul not rellexive (a) not reflexive, symmetricand transitive
(<) an cqulvalence veatlon (b) reflexive, symmetric and not transitive
(d) reflexive, transitive but not symmetric (c) reflexive, symmetric and transitive
(Onllne 2013) (d) reflexive, not symmetric and transitive /
79. Let A and Bbe two sets containing 2elements and 85. Let R= (3, 3), (6, 6), (9, 9), (12, 12),, (6,
4clements respectively. "The number of subsets of (3, 12), (3, 6)} be arelation ontthe set A 12), (3,3
Ax B having 3 or more elements is The relation is =3,6,9,1)
(a) 211 (b) 256 (c) 220 (d) 219 (a) reflexive and symmetric only
(2013) (b) anequivalence relation
80. Let X ={1, 2, 3, 4, 5). The number of different (c) reflexive only
ordered pairs (Y, Z) that can be formed such that (d) reflexive and transitive only
(200;
Yc X, ZcXand YoZis empty is 86. Let R= {(1,3), (4, 2), (2, 4), (2, 3),(3, 1)} be arelatir:
(a) 29 (b) 5 (c) 52 (d) 3° (2012) on theset A = {1, 2, 3, 4). The relation Ris
81. Let Rbe the set of real numbers. (a) not symmetric (b) transitive
Statement-1 ={(x, y)e Rx R:y-xis an
:A integer} (c) a function (d) reflexive(204
is anequivalence relation on R.
Statement-2: B= ((x, v) e RxR:x= ay for some Numerical Value Type
rational number a) is an equivalence relation on R. 87. Let A={2,3,6, 7} and B={4,5,6,8}. Let Rbearelatin
(a) Statement-1 is true, Statement-2 is
false. defined on Ax Bby (a,, b,) R(a,, b,) if and oni
(b) Statement-1is false, Statement-2 is true. a, t a, = b, + b,. Then the number of elements in
(c) Statement-1 is true, is
Statement-2 is true; (9h April 1 Shift20:
Statement-2 is a correct explanation for 88. Let A={1, 2, 3, . 20). Let R, and R, betwo relatit
Statement-1. on A such that R, ={(a, b):b is divisible by a}
(d) Statement-1 is true,
Statement-2 is true; R, = {(a, b) :a is an integral multiple of b
Statement-2 is not acorrect explanation for Then, number of elements in R - R, is equa
Statement-1. (2011) (1" Feb 1 Shift 20!
Sets, Relations and Functions 7
89. The number of
symmetric
set {1, 2, 3, 4} which are not relations defined on the value of 8g(2) is
reflexiveis (a) 4 (b) 16 (c) 8 (d) 2
(30" Jan 2hd Shift 2024)
90. Let A ={1,2, 3, 4) andR=
((1,2), (2, 3). (1,4)} be a (4" April 1" Shift 2024)
relation on A. Let Sbe the equivalence 100. Let A= {1,3,7,9, 11}and B= (2, 4,5,7, 8, 10, 12}.
such that Rc Sand the number of relation on A Thenthe total number of one-one mapsf: A-’ B,
n. Then, the minimum value of n elements in S is such that f) +f3) = 14, is:
is
(31" Jan 1" Shift 2024) (a) 180 (b) 480 (c) 120 (d) 240
91. Let A=, 2, 3, ....
on Adefined by (x, y) eR if ,100), Let R be a relation (5h April I" Shift 2024)
R, be a symmetric and only if 2x = 3y. Let 101. Let f,.g:R’ Rbe defined as :
and the number of relation on A such that Rc R,
elements in R, is n. Then, the e, x20
minimum value of nis fx) =[x - 1| and g(x) =
2024) (31" Jan 2hd Shift |x+1, xS0
92. Let A= {1, 2, 3, 4, ...,10} Then the function fgx)) is
and B
number of elements in the relation=R={0, {(a,
1, 2,3, 4}. The
b)e AxA:
(a) onto but not one-one.
(b) neither one-one nor onto.
2(a b)+3(a - b)e B} is (c) both one-one and onto.
(6th April 1"Shift 2023) (d) one-one but not onto. (3" April 2nd Shift 2024)
93. Let A = {0, 3, 4, 6, 7, 8,9, 10}
and R
defined on A such that R={(x, y) ¬ beAthe relation 102. The function f()x+2x-15 ,XERis
is odd positive integer or x
-y= 2}.
xA:x- y r-4x+9
number of elements that must be added The minimum (a) both one-one and onto.
relation R, so that it is a symmetric relation, isto the (b) neither one-one nor onto.
to equal (c) onto but not one-one.
(8h April 1 Shift 2023) (d) one-one but not onto. (6" April 1 Shift 2024)
94. The number of relations, on
the set {1, 2, 3}
containing (1, 2) and (2, 3), which are reflexive and 103.Let f(x)= 1 be a function defined on R.
transitive but not symmetric, is 7-sin 5x
(12h April 1" Shift 2023) Then the range of the function f(x) is equal to :
95. Let A ={-4, -3, -2, 0 1, 3, 4} and R= {(a, b) E (b)
A:b=\al or b = a + 1} be a relation on A. ThenAx the
minimum number of elements, that must be added
to the relation R so that it
becomes reflexive and
symmetric, is (13h April 2nd Shift 2023)
96. Let A= {1, 2, 3, 4} and R be a relation on the set A (6h April 2nd Shift 2024)
>x 104.Let t) be the greatest integer less than or
Adefined by R={((a, b), (c, d):2a + 3b =4c+ 5d}. t. Let A be the set of all prime equal to
Then the number of elements in R is factors of 2310 and
(15th April 1* Shift 2023) f:A’Zbe the function f(x) =
97. The minimum number of elements that
must be
added to the relation R= {(a, b), (b, c), (b, d)} on the The number of one-to-one functions from A to the
set fa, b, G, d} so that it is an equivalence relation is range of fis
(24h Jan 2d Shift 2023) (a) 25 (b) 24 (c) 20 (d) 120
98. Let R, and R, be relations on the set {1, 2, ..., 50} (8h April 1 Shift 2024)
such that -a if -asxs0
105. Let f)= where a >0 and gx)
R={(p,p"):p is a prime and n20 is an integer} and x+aif 0<r[a
R, ={(P, p"):p is a prime andn=0 or l}.
Then, the number of elements in R, - R, is =((*) -)D/2. Then the function g:
(28th June 1 Shift 2022) [-a, a]’ (-a, a] is
1.3 (a) onto.
Functions (b) both one-one and onto.
(c) one-one.
99. Let f(x) = *+2e for all xe R. Consider afunction
(d) neither one-one nor onto.
g(x) such that (gof) (x) = x for all x eR. Then the
(8" April 2hd Shift 2024)