0% found this document useful (0 votes)
29 views3 pages

Ch 1. Relations and Functions Pyq

Mathsss revision notess

Uploaded by

prithikasharma36
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)
29 views3 pages

Ch 1. Relations and Functions Pyq

Mathsss revision notess

Uploaded by

prithikasharma36
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/ 3

CH 1.

RELATIONS AND FUNCTIONS (MCQ-1 Mark)


2023
1. Let A = {3, 5}. Then number of reflexive relations on A is
(a) 2 (b) 4 (c) 0 (d) 8
2. Let R be a relation in the set N given by R = {(a, b): a = b – 2, b > 6}. Then
(a) (8, 7) ∈ R (b) (6, 8) ∈ R (c) (3, 8) ∈ R (d) (2, 4) ∈ R
2022
1. A relation R is defined on N. Which of the following is the reflexive
relation?
(a) R = {(x, y): x > y, x, y ∈ N}
(b) R = {(x, y): x + y = 10, x, y ∈ N}
(c) R = {(x, y): xy is the square number, x, y ∈ N}
(d) R = {(x, y): x + 4y = 10, x, y ∈ N}
2. The function f: R → R defined by f(x) = 4 + 3 cos x is:
(a) bijective (b) one-one but not onto
(c) onto but not one-one (d) neither one-one nor onto
3. The number of functions defined from {1, 2, 3, 4, 5}→{a, b} which are one-
one is
(a) 5 (b) 3 (c) 2 (d) 0
4. The number of equivalence relations in the set {1, 2, 3} containing the
elements (1, 2) and (2, 1) is
(a) 0 (b) 1 (c) 2 (d) 3
1
5. Let f: R → R be defined by f (𝑥) = , for all 𝑥 ∈ R. Then, f is
𝑥
(a) one-one (b) onto (c) bijective (d) not defined
𝑛+1
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
6. The function f: N → N is defined by f(n) = { 𝑛2
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
2
The function f is:
(a) bijective (b) one-one but not onto
(c) onto but not one-one (d) neither one-one nor onto
7. A relation R is defined on Z as: a R b if and only if a 2 – 7ab +6b2 = 0. Then,
R is:
(a) reflexive and symmetric (b) symmetric but not reflexive
(c) transitive but not reflexive (d) reflexive but not symmetric
2014
1. If R = {(𝑥, y): 𝑥 + 2y = 8} is a relation on N, write the range of R.
2011
1. Let A= {1, 2, 3}, B= {4, 5, 6, 7} and let 𝑓= {(1, 4), (2, 5), (3, 6)} be a
function from A to B. State whether 𝑓 is one-one or not.

CH 1. RELATIONS AND FUNCTIONS (Assertion-Reason Based Questions-1 Mark)


In the following questions, a statement of assertion (A) is followed by a statement
of Reason (R). Choose the correct answer out of the following choices:
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
2024
1. Assertion (A): The relation R = {(𝑥, y): (𝑥 + 𝑦) is a prime number and
𝑥, y ∈ N} is not a reflexive relation.
Reason (R): The number ‘2n’ is composite for all natural numbers n.

CH 1. RELATIONS AND FUNCTIONS (4, 5, 6 Marks)


2024
5 marks
1. Let A = R – {5} and B = R – {1}. Consider the function f: A → B, defined
𝑥−3
by f (𝑥) = . Show that f is one-one and onto.
𝑥−5
2. Check whether the relation S in the set of real numbers R defined by
S = {(a, b): where a – b + √2 is an irrational number} is reflexive,
symmetric or transitive.
2020
4 marks
𝑥
1. Show that the function f: ( −∞, 0) → (−1, 0) defined by f ( 𝑥 ) = ,
1+|𝑥|
𝑥 ∈ (−∞, 0) is one-one and onto.
2. Show that the relation R in the set A = {1, 2, 3, 4, 5, 6} given by
R = {(𝑎, b): |𝑎 − 𝑏| is divisible by 2} is an equivalence relation.
2019
4 marks
1. Show that the relation R on the set Z of all integers, given by R = {(a, b): 2
divides (a – b)} is an equivalence relation.
2018
6 marks
1. Let A = {𝑥 ∈ Z:0 ≤ 𝑥 ≤ 12}. Show that R = {(𝑎, b):𝑎, b ∈ A, |𝑎 − 𝑏| is
divisible by 4} is an equivalence relation. Find the set of all elements related
to 1. Also write the equivalence class [2].
𝑥
2. Show that the function f: R → R defined by f (𝑥) = 2 , ∀ 𝑥 ∈ 𝑅 is neither
𝑥 +1
one-one nor onto.
2017
6 marks
4 4 4𝑥 + 3
1. Consider𝑓 : R − {− } → R − { } given by 𝑓 (𝑥 ) = . Show that 𝑓 is
3 3 3𝑥 + 4
bijective.
2013
4 marks
1. Consider 𝑓: 𝑅+ →[4,∞) given by𝑓(𝑥) = 𝑥 2 + 4. Show that 𝑓 is bijective,
where 𝑅+ is the set of all non-negative real numbers.
2012
4 marks
𝑥 + 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑜𝑑𝑑
1. Show that𝑓: N → N, given by 𝑓(𝑥) = { is both one-
𝑥 − 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛
one and onto.
2010
4 marks
1. Show that the relation S in the set A = {𝑥 ∈ Z: 0 ≤ 𝑥 ≤ 12} given by
S = {(a, b): a, b ∈ Z, |𝑎 − 𝑏|is divisible by 4} is an equivalence relation.
Find the set of all elements related to 1.
2009
4 marks
𝑛+1
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
2
1. Let𝑓 : N → N be defined by𝑓 (n) = {𝑛 for all n ∈ N. Find
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
2
whether the function 𝑓 is bijective.
2008
4 marks
1. Show that the relation R defined by (a, b) R (c, d) ⇒ a + d = b + c on the set
N×N is an equivalence relation.

CH 1. RELATIONS AND FUNCTIONS (Case study based questions)


2023
4 marks
1. An organization conducted bike race under two different categories – Boys
and Girls. There were 28 participants in all. Among all of them, finally three
from category 1 and two from category 2 were selected for the final race.
Ravi forms two sets B and G with these participants for his college project.
Let B = {𝑏1 , 𝑏2 , 𝑏3 } and G = {𝑔1 , 𝑔2 } , where B represent the set of Boys
selected and G the set of Girls selected for the final race.
Based on the above information, answer the following questions:
(i) How many relations are possible from B to G?
(ii) Among all the possible relations from B to G, how many functions can be
formed from B to G?
(iii) Let R: B → B be defined by R = {(𝑥, 𝑦): 𝑥 𝑎𝑛𝑑 𝑦 are students of the same
sex}. Check if R is an equivalence relation.
OR
(iii) A function f: B → G be defined by f = {(𝑏1 , 𝑔1 ), (𝑏2 , 𝑔2 ), (𝑏3 , 𝑔1 )}. Check
if f is bijective. Justify your answer.

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