c. f(x) = 2x + 1 Q107.

If the functions f and g are defined by

d. f(x) = x + 1 f(x) = 3x − 4, g(x) = 3x + 2 for x ∈ R,
Q103. If R denotes the set of all real numbers, then respectively then f(g(2))
the function f: R → R defined by f(x) = |x| a. 1 b. 8
is c. 20 d. 2
a. One-one only Q108. The function f: R → R given by f(x) = x −
b. Onto only 1 is
c. Both one-one and onto a. A one-one function
d. Neither one-one nor onto b. An onto function
Q104. The function f: R → R given by f(x) = x + c. A bijection
x, is d. Neither one-one nor onto
a. One-one and onto Q109. If a function f ∶ [2, ∞) → B defined by
b. One-one but not onto f(x) = x − 4 x + 5 is a bijection, then B =
c. Many-one and onto a. R b. [1, ∞)
d. Many one but not onto c. [4, ∞) d. [5, ∞)
Q105. A mapping f: N → N, where N is the set of Q110.
natural numbers is defined as f(n) = f: R → R is defined by f(x) = , is
n , for n odd a. One-one but not onto
For n ∈ N. Then, f is b. Many-one but onto
2n + 1, for n even
a. onto but not one-one c. One-one and onto
b. Neither one-one nor onto d. Neither one-one nor onto
c. one-one and onto both Q111. Let A = R − {3}, B = R − {1}. Let f: A →
d. one-one but not onto Bbe defined by f(x) = .Then
Q106. The number of bijective functions from set a. f is bijective
A to itself when A contains 106 elements is b. f is one-one but not onto
a. 106 b. (106) c. f is onto but not one-one
c. 106 ! d. 2 d. None of the above
 Level – II ☆☆
Q1. Assertion (A): Let A = (a, b, c), B = (4, 5, 6, Reason (R): Any relation R is an
7) and let f = ((a, 4), (c, 5), (b, 7)) be a equivalence relation, if it is reflexive,
function from A to B. Then f is one-one. symmetric and transitive.
Reason (R): f is bijective function Choose the correct option in the following
Choose the correct option in the following questions of Assertion - Reason Questions.
questions of Assertion - Reason Questions. a. Both A and R are correct; R is the correct
a. Both A and R are correct; R is the correct explanation of A.
explanation of A. b. Both A and R are correct; R is not the
b. Both A and R are correct; R is not the correct explanation of A.
correct explanation of A. c. A is correct; R is incorrect.
c. A is correct; R is incorrect. d. R is correct; A is incorrect
d. R is correct; A is incorrect Q6. Assertion: If 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) =
Q2. Assertion (A): Let A = (a, b, c), B = (4, 5, 6, 𝑠𝑖𝑛 𝑥 is a bijection.
7) and let f = ((a, 4), (c, 5), (b, 7)) be a Reason: If f is both one-one and onto. It is
function from A to B. Then f is one-one. bijection.
Reason (R): f is bijective function Choose the correct option in the following
Choose the correct option in the following questions of Assertion - Reason Questions.
questions of Assertion - Reason Questions. a. Both A and R are correct; R is the correct
a. Both A and R are correct; R is the correct explanation of A.
explanation of A. b. Both A and R are correct; R is not the
b. Both A and R are correct; R is not the correct explanation of A.
correct explanation of A. c. A is correct; R is incorrect.
c. A is correct; R is incorrect. d. R is correct; A is incorrect
d. R is correct; A is incorrect Q7. Assertion: Let L be the set of all lines in a
Q3. Assertion(A): T is the set of triangle such plane and R be the relations in L defined as
that ((T1, T2): T1 is congruent to T2). Then 𝑅 = ((𝐿 , 𝐿2): 𝐿 is perpendicular to 𝐿 ).
R is an equivalence relation. This relation is not equivalence relation.
Reason(R) Any relation R is an equivalence Reason: A relation is said to be equivalence
relation, if it is reflexive, symmetric and relation, if it is reflexive, symmetric and
transitive transitive
Choose the correct option in the following Choose the correct option in the following
questions of Assertion - Reason Questions. questions of Assertion - Reason Questions.
a. Both A and R are correct; R is the correct a. Both A and R are correct; R is the correct
explanation of A. explanation of A.
b. Both A and R are correct; R is not the b. Both A and R are correct; R is not the
correct explanation of A. correct explanation of A.
c. A is correct; R is incorrect. c. A is correct; R is incorrect.
d. R is correct; A is incorrect d. R is correct; A is incorrect
Q4. Assertion(A): The function 𝑓: 𝑅 → 𝑅, given Q8. Assertion: Domain and range of the relation
by 𝑓 (𝑥) = 2𝑥, is one-one and onto. 𝑅 = {(𝑥, 𝑦) 𝑥 − 2𝑦 = 0} defined on the
Reason(R): A function 𝑓: 𝑋 → 𝑌 is said to set 𝐴 = {1, 2, 3, 4} are respectively
be one-one and onto (or bijective), if f is (1,2,3,4) and (2,4,6,8)
both one-one and onto Reason: Domain and Range of a relation R
Choose the correct option in the following are respectively the sets (𝑎: 𝑎 ∈ 𝐴 and
questions of Assertion - Reason Questions. (𝑎, 𝑏) ∈ 𝑅) and (𝑏: 𝑏 ∈ 𝐴 𝑎𝑛𝑑 (𝑎, 𝑏) ∈
a. Both A and R are correct; R is the correct 𝑅)
explanation of A. Choose the correct option in the following
b. Both A and R are correct; R is not the questions of Assertion - Reason Questions.
correct explanation of A. a. Both A and R are correct; R is the correct
c. A is correct; R is incorrect. explanation of A.
d. R is correct; A is incorrect b. Both A and R are correct; R is not the
Q5. Assertion(A): The relation R on the set correct explanation of A.
𝑁x𝑁, defined by (𝑎, 𝑏) 𝑅 (𝑐, 𝑑) 𝑎 + 𝑑 = c. A is correct; R is incorrect.
𝑏 + 𝑐 for all (𝑎, 𝑏), (𝑐, 𝑑)𝜀 𝑁 × 𝑁 is an d. R is correct; A is incorrect
equivalence relation.
Q9. Assertion: The Greatest integer Function 𝑓 ∶ Q13. Assertion (A): Let 𝑓: 𝑅 → 𝑅 be defined by
𝑅 → 𝑅 is given by (𝑥) = (𝑥) is not onto. 𝑓(𝑥) = 𝑥² + 1, then the pre-image of 17
Reason: A function 𝑓 ∶ 𝐴 → 𝐵 is said to be are ±4.
injective if 𝑓(𝑎) = 𝑓(𝑏) ⇒ 𝑎 = 𝑏 Reason (R): A function 𝑓: 𝐴 → 𝐵 is called
Choose the correct option in the following one-one function, if distinct elements of A
questions of Assertion - Reason Questions. have distinct images in B.
a. Both A and R are correct; R is the correct Choose the correct option in the following
explanation of A. questions of Assertion - Reason Questions.
b. Both A and R are correct; R is not the a. Both A and R are correct; R is the correct
correct explanation of A. explanation of A.
c. A is correct; R is incorrect. b. Both A and R are correct; R is not the
d. R is correct; A is incorrect correct explanation of A.
Q10. Assertion: For two sets 𝐴 = 𝑅 − {3} and c. A is correct; R is incorrect.
𝐵 = 𝑅 (1) defined a function 𝑓: 𝐴 → 𝐵 as d. R is correct; A is incorrect
𝑓(𝑥) = is bijective Q14. Assertion (A): Let a relation R defined from
𝐴 = {1, 2, 5, 6} to itself as
Reason: A function 𝑓: 𝐴 → 𝐵 is said to be
𝑅 = {(1, 1), (1, 6), (6, 1)} , then R is
surjective if for all 𝑦 ∈ 𝐵, ∃ 8 , 𝑥𝜖𝐴 A such
symmetric relation
that 𝑓(𝑥) = 𝑦
Reason (R): A relation R in set A is said to
Choose the correct option in the following
be symmetric
questions of Assertion - Reason Questions.
(𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅, 𝑎, 𝑏 ∈ 𝐴.
a. Both A and R are correct; R is the correct
Choose the correct option in the following
explanation of A.
questions of Assertion - Reason Questions.
b. Both A and R are correct; R is not the
a. Both A and R are correct; R is the correct
correct explanation of A.
explanation of A.
c. A is correct; R is incorrect.
b. Both A and R are correct; R is not the
d. R is correct; A is incorrect
correct explanation of A.
Q11. Assertion (A): The relation R in the set 𝐴 =
c. A is correct; R is incorrect.
{1, 2, 3, 4, 5, 6} defined as
d. R is correct; A is incorrect
𝑅 = {(𝑎, 𝑏): bis divisibleby a} is not an Read the passage carefully and answer
equivalence relation. the questions
Reason (R): The relation R will be an Q15. Sherlin and Danju are playing Ludo at home
equivalence relation, if it is reflexive, during Covid-19. While rolling the dice,
symmetric and transitive. Sherlin’s sister Raji observed and noted the
Choose the correct option in the following possible outcomes of the throw every time
questions of Assertion - Reason Questions. belongs to set {1,2,3,4,5,6}. Let A be the set
a. Both A and R are correct; R is the correct of players while B be the set of all possible
explanation of A. outcomes.
b. Both A and R are correct; R is not the
Let 𝑅: 𝐵 → 𝐵 be defined by 𝑅 = {(𝑥, 𝑦): 𝑦
correct explanation of A.
is divisible by 𝑥 } is
c. A is correct; R is incorrect.
a. Reflexive and transitive but not
d. R is correct; A is incorrect
symmetric
Q12. Assertion (A): If 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}
b. Reflexive and symmetric and not
and R is the relation in A given by
transitive
𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏}, then the set of all c. Not reflexive but symmetric and transitive
elements related to 1 is (1.2). d. Equivalence
Reason (R): If 𝑅 and 𝑅 are equivalence Q16. Raji wants to know the number of functions
relation in a set A, then 𝑅 ∩ 𝑅 is an from A to B. How many number of
equivalence relation. functions are possible?
Choose the correct option in the following a. 6 b. 2
questions of Assertion - Reason Questions.
c. 6! d. 2
a. Both A and R are correct; R is the correct
Q17. Let R be a relation on B defined by R =
explanation of A.
{(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}.
b. Both A and R are correct; R is not the
Then R is
correct explanation of A.
a. Symmetric
c. A is correct; R is incorrect.
b. Reflexive
d. R is correct; A is incorrect
c. Transitive
d. None of these three
Q18. Raji wants to know the number of relations d. Symmetric but not transitive
possible from A to B. How many numbers Q21. Let 𝑅 = {(𝐿1, 𝐿2) ∶ 𝐿1┴𝐿2 where
of relations are possible? 𝐿1, 𝐿2 € 𝐿 } which of the following is true?
a. 6 b. 2 c. 6! d. 2 a. R is Symmetric but neither reflexive nor
`Q19 Let 𝑅: 𝐵 → 𝐵 be defined by 𝑅 = transitive
. {(1,1), (1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, b. R is Reflexive and transitive but not
then R is symmetric
a. Symmetric c. R is Reflexive but neither symmetric nor
b. Reflexive and Transitive transitive
c. Transitive and symmetric d. R is an Equivalence relation
d. Equivalence Q22. The function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) =
Read the passage carefully and answer 𝑥 − 4 is___________
the questions a. Bijective
Q20. Students of Grade 9, planned to plant b. Surjective but not injective
saplings along straight lines, parallel to each c. Injective but not Surjective
other to one side of the playground ensuring d. Neither Surjective nor Injective
that they had enough play area. Let us Q23. Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑥 − 4.
assume that they planted one of the rows of Then the range of 𝑓(𝑥) is ________
the saplings along the line 𝑦 = 𝑥 − 4. Let a. R b. Z
L be the set of all lines which are parallel on c. W d. Q
the ground and R be a relation on L. Q24. Let 𝑅 = {(𝐿 , 𝐿 ) ∶ 𝐿 is parallel to 𝐿
1. Let relation R be defined by 𝑅 = and 𝐿 ∶ 𝑦 = 𝑥 – 4} then which of the
{(𝐿1, 𝐿2): 𝐿1║𝐿2 where 𝐿 , 𝐿 € 𝐿} then R following can be taken as 𝐿 ?
is______ relation a. 2𝑥 − 2𝑦 + 5 = 0
a. Equivalence b. 2𝑥 + 𝑦 = 5
b. Only reflexive c. 2𝑥 + 2𝑦 + 7 = 0
c. Not reflexive d. 𝑥 + 𝑦 = 7

LEVEL – III (PYQ) ☆☆☆

Q1. The relation R on the set A = Q6. The relation R in the set A = {1, 2, 3} given by
{1,2,3,4,5}, given by R {(a, b): |a − b| is even}, R= {(1,2), (2, 1)} is:
is a. Reflexive
a. Reflexive only b. Symmetric
b. Reflexive and symmetric only c. Reflexive but not symmetric
c. Symmetric and transitive only d. Equivalence Relation
d. Equivalence Q7. Let the relation R defined on the set {a, b, c} be
Q2. The relation = {(a, b) : both a and b are either such that R = {(a, b), (b, b), (a, a), (a, c), (c, c)
odd or even} on the set {1, 2, 4, 5, 7, 8} is ,(c, b)}
a. reflexive and symmetric but not transitive Choose the correct option from the options
b. reflexive and transitive but not symmetric given below:
c. symmetric and transitive but not reflexive a. R is symmetric and transitive but not reflexive
d. an equivalence relation b. R is reflexive and symmetric but not transitive
Q3. On the set A = {1, 2, 3} a relation R = {(1, 1), c. R is reflexive and transitive but not symmetric
(1, 3), (3, 1), (2, 2), (2, 1), (3 , 3)}, then R : d. R is an equivalence relation
a. is equivalent
b. is reflexive and symmetric
c. is symmetric but not reflexive Q8. If there is a relation in R = {(x, y)|x, y ∈ ℤ, x +
d. is reflexive but not transitive y ≤ 4}ℤ then the domain of R is
Q4. The maximum number of equivalence relations a. {0,1,2} b. {0, −1, −2}
in the set A = {a, b, c} is: c. {−2, −1,0,1,2} d. {−1,0,2}
a. 1 b. 2 c. 5 d. 3 Q9. Let R be a relation on the set of natural numbers
Q5. Let R form an eulivalence relation on with the N defined by nRm if n divides m. Then R is:
set A = {1,2,3,4,5}. If R = {(x, y) : (x -y) is (A) Reflexive Relation
divisible by 2} then the equivalence class of 3 is (B) Symmetric Relation
a. {1,5} b. {1, 3, 5} (C) Transitive Relation
c. {3,5} d. {2,4} (D) Identity Relation