0% found this document useful (0 votes)
45 views8 pages

Holiday Assign

Relation and functions ws class 12

Uploaded by

tejasanand931
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views8 pages

Holiday Assign

Relation and functions ws class 12

Uploaded by

tejasanand931
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Class: XII

Subject: Mathematics (041)


Holiday Assignment
Questions Based on Relations
Q1. Let A = {0, 1, 2, 3} and define a relation R on A as follows:
𝑅 = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric?
transitive?
Q2. Let R be a relation on 𝐴 = {𝑎, 𝑏, 𝑐 } such that
𝑅 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑎, 𝑐 ), (𝑏, 𝑏), (𝑏, 𝑐 ), (𝑐, 𝑎), (𝑐, 𝑏), (𝑐, 𝑐)}
Find whether R is reflexive, symmetric and transitive.

Q3. Let R be a relation on 𝐴 = {1,2,3} such that 𝑅 = {(1,2), (2,1), (1,3), (3,1)}
Find whether R is reflexive, symmetric and transitive.

Q4. Let R be a relation on 𝐴 = {1,2,3} such that 𝑅 = {(1,2), (2,3), (3,1)}


Find whether R is reflexive, symmetric and transitive.

Q5. Let R be a relation on 𝐴 = {1,2,3} such that 𝑅 = {(1,1), (2,2), (3,3)}


Find whether R is reflexive, symmetric and transitive.

Q6. Check whether the relation R on the set 𝐴 = {1,2,3,4,5,6} as 𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 2} is
reflexive, symmetric and transitive.

Q7. Check whether the relation R on the set 𝑁 as 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏} is reflexive, symmetric and
transitive

Q8. Check whether the relation R on the set 𝑁 as 𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎2 } is reflexive, symmetric and
transitive.

Q9. Check whether the relation R on R defined by = {(𝑎, 𝑏): 𝑏 ≤ 𝑎 } is an equivalence relation or
not.

Q10. Check whether the relation R on R defined by = {(𝑎, 𝑏): 𝑎 < 𝑏 } is an equivalence relation or
not.

Q11. Let R be relation defined on the set of natural number N as follows:

1|VPS
𝑅 = {(𝑥, 𝑦): 𝑥 ∈ 𝑁, 𝑦 ∈ 𝑁, 2𝑥 + 𝑦 = 41}. Find the domain and range of the relation R.
Also verify whether R is reflexive, symmetric and transitive.

Q12. Show that the relation R in the set A = {1, 2, …,10} given by 𝑅 = {(𝑎, 𝑏) ∶ |𝑎 – 𝑏| 𝑖𝑠 𝑒𝑣𝑒𝑛},
is an equivalence relation. Show that all the elements of {1, 3, 5,7,9} are related to each other
and all the elements of {2, 4,6,8} are related to each other. But no element of {1, 3, 5,7,9} is
related to any element of {2, 4,6,8}

Q13. Show that each of the relation R in the set A = {x  Z : 0  x  12}, given by
R = {(a, b) : | a - b | is a multiple of 4} is an equivalence relation Find the set of all elements

related to 5 in each case. How many equivalence classes can R have?

Q14. If A = {1, 2, 3, 4, 6}, show that the relation R defined by R = {( a, b) : b is divisible by a , a, b  A}

is not an equivalence relation.

Q15. Check whether the relation R on R defined by R = {a, b) : a  b3}. is an equivalence relation or not.

Q16. Check whether the relation R in the set R of real numbers, defined by R = {(a, b) : 1 + ab > 0},
is reflexive, symmetric or transitive.

Q17. In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division
by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1,
2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets
determined by R.

Q18. If R 1 and R 2 are equivalence relations in a set A, show that R1  R 2 is also an equivalence

relation.

Q19. Let A = {1, 2, 3, ... 9} and R be the relation in A ×A defined by


(𝑎, 𝑏) 𝑅 (𝑐, 𝑑) 𝑖𝑓 𝑎 + 𝑑 = 𝑏 + 𝑐 𝑓𝑜𝑟 (𝑎, 𝑏), (𝑐, 𝑑) in 𝐴 × 𝐴. Prove that R is an
equivalence relation and also obtain the equivalent class [(1, 4)].

Q20. Prove that the relation R on the set N  N defined by


(a, b) R (c, d ) iff a 3 + d 3 = b 3 + c 3 for all (a, b), (c, d )  N  N is an equivalence relation.

Q21. Prove that the relation R on the set N  N defined by


(a, b) R (c, d ) iff ad = bc for all (a, b), (c, d )  N  N . is an equivalence relation.

2|VPS
Q22. Prove that the relation R on the set N  N defined by
(a, b) R (c, d ) iff ad (b + c ) = bc (a + d ) for all (a, b), (c, d )  N  N . is an equivalence relation

Q23. Let R be the equivalence relation in the set A = − 6,−5,−4,−3,−2,−1,0,1,2,3,4,5,6, of integers

given by R = (a, b ) : 2 divides a − b . Write the equivalence class [0] .

CBSE 2024 Paper Questions:

Q1. A relation R on set 𝐴 = {−4, −3, −2, −1,0,1,2,3,4} be defined as

𝑅 = {(𝑥, 𝑦): 𝑥 + 𝑦 𝑖𝑠 𝑎𝑛 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 2}. Show that R is an equivalence relation.


Also, write equivalence class [2].
Q2. A relation R on set 𝐴 = {𝑥: −10 ≤ 𝑥 ≤ 10, 𝑥 ∈ 𝑍 } is defined as

𝑅 = {(𝑥, 𝑦): (𝑥 − 𝑦) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 5}. Show that R is an equivalence relation. Also, write
equivalence class [5].
Q3. Check whether the relation S in the set of real numbers R defined by

𝑆 = {(𝑎, 𝑏): 𝑎 − 𝑏 + √3 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 } is reflexive, Symmetric or transitive.

Questions based on Functions

Q1. Find the domain of the function f : R → R defined by f (x ) = x 2 − 3x + 2 [Ans:


(− ,1  2,  ) ]
1
Q2. Let f : R → R be the function defined by 𝑓 (𝑥) = 𝑥 ∈ 𝑅. Then, find the range of 𝑓.
2 – 𝑐𝑜𝑠 𝑥

3 𝑥
Q3. If 𝑓: 𝑅 − { } → 𝑅 is a mapping defined by 𝑓(𝑥) = show that 𝑓 is not Bijective.
2 2𝑥−3

x −1
Q4. Let A = R − {2} and B = R − {1} . If f : A → B is a mapping defined by f ( x) = , show that f
x−2
is Bijective.

Q24. Are the following set of ordered pairs functions? If so, examine whether the mapping is
injective or surjective.

(i) {(x, y): x is a person, y is the mother of x}.


(ii) {(a, b): a is a person, b is an ancestor of a}.

Q5. Let 𝐴 = {𝑥𝜖𝑅: −1 ≤ 𝑥 ≤ 1} = 𝐵, Show that 𝑓: 𝐴 → 𝐵 given by 𝑓 (𝑥) = 𝑥 |𝑥| is a bijective.

Q6. If 𝑓: 𝑅 → 𝑅 be the function defined by 𝑓 (𝑥) = 3𝑥 3 + 5, Show that 𝑓 is bijective.

3|VPS
Q7. Prove that the function 𝑓: 𝑁 → 𝑁 , defined by 𝑓(𝑥) = 𝑥 2 + 𝑥 + 1 is one to one but not onto,

x
Q8. Show that the function f : R → R defined by f (x) = ,  x  R , is neither one-one nor
x +1
2

onto.

x2
Q9. Show that the function f : R → R defined by f (x) = ,  x  R , is neither one-one nor
x2 +1
onto.

n +1
 2 if n is odd
Q10. Let f : N → N be defined by f (n) =  for all n  N
 n
 2 if n even

State whether the function f is bijective. Justify your answer.

Q11. Show that the function f : N → N given by f (n) = n − (−1) n for all n  N . is a bijection

Q12. Let A and B be two sets. Show that f : A  B → B  A defined by f (a, b) = (b, a) is a bijective.

x
Q13. Show that the function f : R → {x : x  R, − 1  x  1} given by f ( x) = is one-one and onto
1+ x

Q14. Consider f : R+ → (− 9,  ) given by f (x ) = 5x 2 + 6 x − 9 . Check whether the function 𝑓 is

bijective or not.

Q15. A function 𝑓: [−4,4] → [0,4] is given 𝑓 (𝑥) = √16 − 𝑥 2 . Show that 𝑓 is an onto function but

not a one-one function. Further, find all possible values of ′𝑎′ for which 𝑓 (𝑎) = √7.

Q16. Let the function f : R → R be defined by 𝑓 (𝑥) = 𝑐𝑜𝑠𝑥, for all x  R Show that f is neither

 
one-one nor onto. Consider function f : 0,  → R given by the function 𝑓 (𝑥) = 𝑠𝑖𝑛 𝑥 and
 2
 
g : 0,  → R given by the function 𝑔(𝑥) = 𝑐𝑜𝑠 𝑥. Show that f and g are one-one, but 𝑓 + 𝑔
 2
is not one-one.

4|VPS
Multiple Choice Questions
Q1. Let us define a relation R in R as aRb if (D) neither symmetric, nor transitive
a ≥ b. Then R is Q7. For real numbers x and y, define xRy if and
(A) an equivalence relation only if 𝑥 – 𝑦 + √3 is an irrational number.
(B) reflexive, transitive but not symmetric Then the relation R is
(C) symmetric, transitive but (A) reflexive (B) symmetric
(D) neither transitive nor reflexive not (C) transitive (D) none of these
reflexive but symmetric Q8. If the set A contains 5 elements and the set B
Q2. Let us define a relation R in R as aRb if contains 6 elements, then the number of one-
a  b . Then R is
2
one and onto mappings from A to B is
(A) an equivalence relation (A) 720 (B) 120
(B) reflexive, transitive but not symmetric (C) 0 (D) none of these
(C) symmetric, transitive but not reflexive Q9. Set A has 3 elements and the set B has 4
(D) neither transitive nor reflexive but elements. Then the number of injective
symmetric. mappings that can be defined from A to B is
x
Q3. If f : [0, ) → [0, ) and f (x ) = , then f is (A) 144 (B) 12
1+ x
(C) 24 (D) 64
(A)One-one and onto Q10. Let A = {1, 2, 3, ...n} and B = {a, b}. Then
(B) One-one but not onto the number of surjections from A into B is
(C)Onto but not one-one (A) ⬚𝑛𝑃2 (B) 2𝑛 − 2
(D)Neither one-one nor onto (C) 2𝑛 − 1 (D) None of these
Q4. The maximum number of equivalence Q11. Let N be the set of natural numbers and the
relations on the set A = {1, 2, 3} are function 𝑓 ∶ 𝑁 → 𝑁 be defined by 𝑓 (𝑛) =
(A) 1 (B) 2 2𝑛 + 3 ∀ 𝑛 ∈ 𝑁. Then f is
(C) 3 (D) 5 (A) surjective (B) injective
Q5. If a relation R on the set {1, 2, 3} be defined (C) bijective (D) none of these
by R = {(1, 2)}, then R is Q12. Let L denote the set of all straight lines in a
(A) reflexive (B) transitive plane. Let a relation R be defined by lRm if and
(C) symmetric (D) none of these only if l is perpendicular to m ∀ l, m ∈ L. Then
Q6. Let A = {1, 2, 3} and consider the relation R is
R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. (A) reflexive (B) symmetric
Then R is (C) transitive (D) none of these
𝑥−1
(A) reflexive but not symmetric Q13. Let f : R → R be defined by 𝑓 (𝑥) = 𝑥−2
(B) reflexive but not transitive 𝑥 ∈ 𝑅. Then f is
(C) symmetric and transitive
(A) one-one (B) onto

5|VPS
(C) bijective (D) f is not defined (D) f is neither one-one nor onto.
Q14. Which of the following functions from Z  2 − sin x 
Q20. The function f ( x) = log   , is
into Z are bijections?  2 + sin x 
(A) 𝑓 (𝑥) = 𝑥 3 + 1 (B) 𝑓 (𝑥) = 𝑥 + 2
(A)An even function
(C) 𝑓 (𝑥) = 2𝑥 + 1 (D) 𝑓(𝑥) = 𝑥 2 + 1
(B)An odd function
Q15. Let R be a relation on the set N of natural
(C)A periodic function
numbers defined by nRm if n divides m. Then
R is (D)Neither an even nor odd function

(A) Reflexive and symmetric x+2


Q21. The range of the function f (x ) = is
| x + 2|
(B) Transitive and symmetric
(C) Equivalence (A){0, 1} (B) {– 1, 1}
(D) Reflexive, transitive but not symmetric (C) R (D) R − {−2}
Q16. Consider the non-empty set consisting of Q22. Let A = {a, b, c} and the relation R be
children in a family and a relation R defined as defined on A as follows:
aRb if a is brother of b. Then R is 𝑅 = {(𝑎, 𝑎), (𝑏, 𝑐), (𝑎, 𝑏)}. Then, the
(A) symmetric but not transitive minimum number of ordered pairs to be
(B) transitive but not symmetric added in R to make R reflexive and transitive
(C) neither symmetric nor transitive are
(D) both symmetric and transitive (A)3 (B) 4
Q17. Let R be the relation in the set N given by (C) 5 (D)none of these
R = {(a, b) : a = b – 2, b > 6}. Choose the Q23. Let R be the relation in the set {1, 2, 3, 4}
correct answer. given by 𝑅 =
(A) (2, 4)  R {(1, 2), (2, 2), (1, 1), (4,4), (1, 3), (3, 3), (3, 2)}.
(B) (3, 8)  R Choose the correct answer.
(C) (6, 8)  R (A) R is reflexive and symmetric but not
(D) (8, 7)  R transitive.
Q18. Let f : R → R be defined as f (x ) = x .
4
(B) R is reflexive and transitive but not
(A) f is one-one onto symmetric.
(B) f is many-one onto (C) R is symmetric and transitive but not
(C) f is one-one but not onto reflexive.
(D) f is neither one-one nor onto. (D) R is an equivalence relation.
Q19. Let f : N → R be defined as f (x) = 3x. Choose Q24. Let A = {1, 2, 3}. Then number of
the correct answer. equivalence relations containing (1, 2) is
(A) f is one-one onto (A) 1 (B) 2
(B) f is many-one onto (C) 3 (D) 4
(C) f is one-one but not onto

6|VPS
Q25. Let A = {1, 2, 3}. Then number of relations Then R is
containing (1, 2) and (1, 3) which are (a) reflexive but not symmetric
reflexive and symmetric but not transitive is (b)reflexive but not transitive
(A) 1 (B) 2 (c)symmetric and transitive
(C) 3 (D) 4
(d)neither symmetric, nor transitive
Q26. The number of reflexive relations from
Q32. Which of the following functions from Z into
set A to A, where 𝑛(𝐴) = 𝑛
Z are bijective?
(A) 2𝑛(𝑛−1) (B) 2𝑛(𝑛+1) (a) f(x) = x3
(C) 2𝑛(𝑛−2) (D) none of these (b) f(x) = x + 2
Q27. The number of reflexive relations from (c) f(x) = 2x + 1
set A to A, where 𝐴 = {𝑎, 𝑏, 𝑐} (d) f(x) = x2 + 1
(A) 32 (B) 64 Q33. Let S = {1, 2, 3, 4,5} and let A = S × S. Define

(C) 128 (D) none of these the relation R on A as follows:(a, b) R (c, d) iff

Q28. Let T be the set of all triangles in the ad = cb. Then, R is

Euclidean plane, and let a relation R on T be (a) reflexive only


defined as aRb if a is congruent to b, a, b ∈ (b) Symmetric only
T. Then R is (c) Transitive only
(A) reflexive but not transitive (d) Equivalence relation
(B) transitive but not symmetric Q34. Let X = {-1, 0, 1}, Y = {0, 2} and a function
(C) equivalence f : X → Y defined by y = 2x4, is

(D) none of these (a) one-one onto


Q29. A Relation from B to A is an arbitrary subset (b) one-one into
of: (c) many-one onto
(a)𝐴 × 𝐵 (b) 𝐵 × 𝐵 (d) many-one into
(c)𝐴 × 𝐴 ( d) 𝐵 × 𝐴 Q35. Let A = R – {3}, B = R – {1}. Let f : A → B
Q30. Let us define a relation R in R as aRb if a ≥ b. 𝑥−2
be defined by 𝑓(𝑥) = 𝑥−3 Then,
Then R is
(a) f is bijective
(a) an equivalence relation
(b) f is one-one but not onto
(b)reflexive, transitive but not symmetric
(c) f is onto but not one-one
(c) symmetric, transitive but not reflexive
(d) None of these
(d)neither transitive nor reflexive but
Q36. The mapping 𝑓 ∶ 𝑁 → 𝑁 is given by
symmetric
𝑓(𝑛) = 1 + 𝑛2 , 𝑛 ∈ 𝑁 when 𝑁 is the set
Q31. Let A = {1, 2, 3} and consider the relation R
of natural numbers is
= {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}.
(a) one-one and onto
7|VPS
(b) onto but not one-one (d) none of these
(c) one-one but not onto Q42. Let R be a relation on the set L of lines

(d) neither one-one nor onto defined by 𝑙1 𝑅 𝑙2 if 𝑙1 is perpendicular

Q37. The function 𝑓 ∶ 𝑅 → 𝑅 given by to 𝑙2, then relation Ris

𝑓(𝑥) = 𝑥 3 – 1 is (a) reflexive and symmetric


(a) a one-one function (b) symmetric and transitive
(b) an onto function (c) equivalence relation
(c) a bijection symmetric

(d) neither one-one nor onto


Q38. Let 𝑓 ∶ [0, ∞) → [0, 2] be defined by
2𝑥
𝑓(𝑥) = 𝑥+1, then 𝑓 is

(a) one-one but not onto


(b) onto but not one-one
(c) both one-one and onto
(d) neither one-one nor onto
Q39. If N be the set of all-natural numbers,
consider 𝑓 ∶ 𝑁 → 𝑁 such that
𝑓(𝑥) = 2𝑥, ∀ 𝑥 ∈ 𝑁, then f is
(a) one-one onto
(b) one-one into
(c) many-one onto
(d) None of these
Q40. Let 𝐴 = {𝑥 ∶ −1 ≤ 𝑥 ≤ 1} and
𝑓 ∶ 𝐴 → 𝐴 is a function defined by
𝑓(𝑥) = 𝑥 |𝑥| then f is
(a) a bijection
(b) injection but not surjection
(c) surjection but not injection
(d) neither injection nor surjection
Q41. Let f : R → R be a function defined by
𝑓(𝑥) = 𝑥 3 + 4, then f is
(a) injective
(b) surjective
(c) bijective
8|VPS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy