Scribd
Upload
377 views4 pages

12 Maths Test Paper Ch1 1

This document contains a test paper on relations and functions from CBSE Class 12 Mathematics. It includes 10 questions testing various concepts of relations and functions like one-to-one, onto, injective, surjective, binary operations, and properties of relations. The solutions provide detailed explanations and working for each question. Key concepts covered include functions, binary operations, properties of relations like reflexive, symmetric and transitive, and examples of injective and surjective functions.

Uploaded by

urvashbhargavasharma
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
377 views4 pages

12 Maths Test Paper Ch1 1

This document contains a test paper on relations and functions from CBSE Class 12 Mathematics. It includes 10 questions testing various concepts of relations and functions like one-to-one, onto, injective, surjective, binary operations, and properties of relations. The solutions provide detailed explanations and working for each question. Key concepts covered include functions, binary operations, properties of relations like reflexive, symmetric and transitive, and examples of injective and surjective functions.

Uploaded by

urvashbhargavasharma
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/ 4

CBSE

Class 12 Mathematics
Chapter 1 Relations and Functions
Test Paper 01

1. If A = {1, 2, 3} and f, g are relations corresponding to the subset of A A indicated against


them, which of f, g is a function? Why?
f = {(1, 3), (2, 3), (3, 2)}
g = {(1, 2), (1, 3), (3, 1)}
2. Let * be a binary operation defined by a * b = 2a + b - 3. find 3 * 4
3. Show that a one – one function f: {1, 2, 3} {1, 2, 3} must be onto.
4. Check the injectivity and surjectivity of the following functions:

f : R R given by f(x) = x2
5. Give examples of two functions f : N Z and g : Z Z such that gof is injective but g is
not injective. (Hint: Consider f(x) = x and g(x) = |x|)

6. Prove that the function f given by f(x) = x2 - x + 1 is neither strictly increasing nor strictly
decreasing on (-1, 1).
7. Using the definition, prove that the function is invertible if and only if f is
both one-one and onto.
8. Let * be a binary operation on the set Q of rational numbers as follows:
1. a*b = a - b

2. a*b = a2 + b2
3. a*b = a + ab

4. a*b = (a - b)2
Find which of the binary operations are commutative and which are associative.
9. Consider the binary operation * : R R R and o : R R R defined as a * b = |a - b|
and aob = a, a, b R. Show that * is commutative but not associative, o is associative but
not commutative. Further, show that , a, b, c, R, a*(boc) = (a*b)o(a*b). [If it is so, we
say that the operation * distributes over the operation o]. Does o distribute over *? Justify
your answer.
10. Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x N, y N, 2x + y = 41}. Find the domain and range of the relation R. Also
verify whether R is reflexive, symmetric and transitive.

Material downloaded from myCBSEguide.com. 1 / 4


CBSE Class 12 Mathematics
Chapter 1 Relations and Functions
Test Paper 01
Solution

1. f is a function since each element of A in the first place in the ordered pairs is related to
only one element of A in the second place while g is not a function because 1 is related to
more than one element of A, namely, 2 and 3.
2. 3 * 4 = 2 (3) + 4 - 3 = 7
3. Since, f is one - one three elements of {1, 2, 3} must be taken to 3 different elements of the
co - domain {1, 2, 3} under f. Hence, f has to be onto.

4. f : R R given by f(x) = x2
As f(-1) = f(1) = 1
-1 and 1 have same image. f is not injective.
e.g. -2 co-domain, but R=domain of f. f is not surjective.
5. Given: two functions f : N Z and g : Z Z
Let f(x) = x and g(x) = |x|
gof(x) = g(f(x)) = g(x) = |x|.since domain of gof is N and therefore gof is injective.
But g is not injective as g(-1) = |-1| = 1 ,g(1) = |1| = 1 i.e
two different elements have same image.

6. Given: f(x) = x2 - x + 1
f'\(x) = 2x - 1
f(x) is strictly increasing if f'(x) < 0
2x - 1 > 0

i.e., increasing on the interval


f(x) is strictly decreasing if f'(x) < 0
2x - 1 < 0

i.e., decreasing on the interval


hence, f(x) is neither strictly increasing nor decreasing on the interval (-1, 1).
7. Let f:A B be invertible,then there exists a function g:B A such that gof = and fog
= .

Material downloaded from myCBSEguide.com. 2 / 4


f is one-one:Let x,y A such that f(x) = f(y).Then,
f(x)=f(y)
g(f(x))=g(f(y))
gof(x)=gof(y)

x = y
f is one-one.
f is onto:Let y B and let g(y)=x.Then,
g(y)=x
f(g(y))=f(x)
fog(y)=f(x)

y=f(x)
Thus,for each y in B,there exists x in A such that f(x)=y.So,f is onto.
Conversely,if f is one-one, and onto ,then f is invertible.
8. i. a*b = a - b = -(b - a) = -b*a operation * is not commutative.
(a*b)*c = (a - b)*c = (a - b) - c = a - b - c
And a*(b*c) = a*(b - c) = a - (b - c) = a - b + c
Here, (a * b)*c a*(b*c) operation * is not associative.

ii. a*b = a2 + b2 = b2 + a2 = b*a operation * is commutative.

(a*b)*c = (a2 + b2)*c = (a2 + b2) + c2 = a2 + b2 + c2

And a*(b*c) = a*(b2 + c2) = a2 + (b2 + c2)2


Here, (a*b)*c a*(b*c) operation * is not associative.
iii. a*b = a + ab = a(1 + b) and b*a = b + ba = b(1 + a) a*b
Therefore, operation * is not commutative.
(a*b)*c = (a + ab)*c = (a + ab) + (a + ab)c
And a*(b*c) = a*(b + bc) = a + a(b + bc)
Here, (a*b)*c a*(b*c) operation * is not associative.

iv. a*b = (a - b)2 = (b - a)2 = b*a operation * is commutative.

(a*b)*c = (a - b)2*c = [(a - b)2 - c]2

And a*(b*c) = a*(b - c)2 = [a - (b - c)2]2


Here, (a*b)*c a*(b*c) operation * is not associative.

Material downloaded from myCBSEguide.com. 3 / 4


9. Part I: a * b = |a - b| also b*a = |b - a| = (a - b) operation * is commutative.
Now, a*(b*c) = a*|b - c| = |a - (b - c)| = |a - b + c|
And (a*b) * c = |a - b|*c = |a - b - c|
Here, a * (b * c) (a * b) * c operation * is not associative.
Part II: aob = a a, b R
And, boa = b
aob boa operation o is not commutative.
Now ao(boc) = aob = a and (aob)oc = aoc = a
Here ao(boc) = (aob)oc operation o is associative.
Part III: L.H.S. a * (boc) = a*b = |a - b|
R.H.S. (a*b)o(a*b) = (a - b)o(a - c) = |a - b| = L.H.S. Proved.
Now, another distribution law: ao(b*c) = (aob)*(aob)
L.H.S. ao(b*c) = ao(|b - c|) = a
R.H.S. (aob)*(aob) = a*a = |a - a| = 0
As L.H.S. R.H.S.
Therefore, the operation o does not distribute over.
10. Given that,
R = {(1, 39), (2, 37), (3, 35) .... (19, 3), (20, 1)}
Domain = {1,2,3,.......,20}
Range = {1,3,5,7......,39}
R is not reflexive as (2, 2) R as

R is not symmetric
as (1, 39) R but (39, 1) R
R is not transitive
as (11, 19) R, (19, 3) R
But (11, 3) R
Hence, R is neither reflexive, nor symmetric and nor transitive.

Material downloaded from myCBSEguide.com. 4 / 4

You might also like