SR.

PCM MATHEMATICS CDF MATERIAL

1. RELATIONS AND FUNCTIONS
1. On two non-empty sets A & B the relation R is the ________ of cartesian Product of A
and B
a) Subset b) Super set c) Null set d) union
2. The set of all first elements of the ordered pairs in a relation R from a set A to a set B is
called the _______of the relation R.
a) Codomain b) domain c) Range d) Image
3. The set of the all ______ elements of the order pair in a relation R from a set A to set
B is called the ________of the relation R.
a) First,Range b)second,Domain c) domain,first d) second , Range
4. A relation R in a set A is called _____, if no elements of A is related to any element of
A.
a) Void relation b) Empty relation c) Null relation d) all the above

5. A relation R in a set A is called ________, if each element of A is related to every element of A ,

a) Void relation b)universal Relation c) trivial relation d) reflexive relation
6. Both the empty relation and the universal relation are some times called as __________.
a) Void Relations b) universal relation c) trivial relations d) Reflexive Relations
7. A relation R in a set A is called reflexive , if ________, for every a  A
a) ( a, a )  R b) ( a, a )  A c) ( a, a )  R d) ( a, a )  A
8. A relation R in a set A is called ___________, if  a, b   R   b, a   R for all a, b  A .
a) Reflexive Relation b) Symmetric Relation c) Transitive Relation d) Equivalence relation
9. A relation R in a set A is called ________, if  a, b   R and  b, c   R , then  a, c   R for

all a, b, c A
a) Transitive Relation b) symmetric Relation c) Reflexive Relation d) Equivalence
Relation
10. A relation R in a set A is said to be an Equivalence relation if R is _______
a) Reflexive b) symmetric c) Transitive d) All the above

FUNCTIONS
11. A relation f : A  B on two non- empty sets A and B is said to be ________ if for every
element of A there exists a_____ in B.
a) Function,range b) Function,unique image c)Relation, Range d) Relation,unique image
12. If f : A  B is a function then A is called _____ of f and B is called _____of f.
a) codomain,domain b) domain,range c) range,codomain d) domain,codomain
13. If f : A  B is a function then the set of all f images are called ________of f.
a)Range b) codomain c) domain d)unique images
14. A function f : A  B is said to be _____, if the images of distinct elements of A under f are
distinct,
a) Onto function b) into function c) one-one function d) many are function
15. If a function ‘f ‘ is injective then, for every x1 , x2  A ______ implies x1  x2 .
f ( x1 )
a) f ( x 1)  f ( x2 ) b) f ( x 1)  f ( x2 ) c) f ( x )  k d) f ( x 1)  f ( x2 )  0
2

NARAYANA GROUP Page No. [161]

SR. PCM MATHEMATICS CDF MATERIAL
16. If the function is many-one,then the function is _________.
a) Not one-one b) not into c) one-one 4) into
17. A function f : A  B is called _______ if for every element of B is the pre-image of some
element of A under f .
a) surjective function b) onto function c) both 1 & 2 d) neither 1 & 2
18. A function f : A  B ,is onto For every y  B ,there exists an elements x is A such that
_________
a) f ( x )  y b) f ( x )  y c) f ( x )  f ( y ) d) f ( x )  f ( y )
19. f : A  B is onto if and only if _________ of ‘f’ is B
a) codomain b) domain c) range d) pre image
20. If ‘f’ is both one-one and onto then f is said to be _________
a) injective function b) surjective function c) Bijective function d) Compositive function
21. The composite of two functions f and g is given by gof(x)= _________
a) g(f(x)) b) fog(x) c) f(g)(x)) d) gof ( x )1
22. If f : A  B , g : B  C are one-one then gof : A  C is also ______.
a) onto b) into c) many one d) one -one
23. If f : A  B , g : B  C are onto, then gof : A  C is also ___________.
a) onto b) one-one c) many one d) into
24. Let f : A  B and g : B  C be the given functions such that gof is one-one. Then f is____
a) onto b) one -one c) many one d) into
25. Let f : A  B and g : B  C be the given functions such that gof is onto. Then g is_______.
a) onto b) into c) many one d) one-one
26. If f : A  B , g : B  C and h : C  D are functions, then ho( gof )  ______ .
a) fo(goh) b) go(hof) c) (hog)of d) ho(fog)
27. A function f : A  B is said to be ________, if there exists a function g : B  A such that
gof = IA and fog= IB .
a) invertible b) composite c) Reflexive d) Indentity
28. If f : A  B , g : B  C be two invertible functions. Then gof is also an invertible with

( gof )1  ________

a) g 1of 1 b) ( gof ) c) f 1og 1 d) (fog)
29. Every bijective function is __________
a) Identity b) Reflexive c) Invertible d) composite

30. Every Identity Relation is _________

a) Equivalence relation b) reflexive relation c) symmetric relation d) Transitive relation

NARAYANA GROUP Page No. [162]