If f:A → B and g:B → C are onto, then gof:A → C is
One - one
Onto
Bijective
None of these
Let L be the set of all lines in the plane and R be the relation in L, defined as: R = {(L1, L2):L1 is perpendicular to L2}
Reflexive
Symmetric
Transitive
Let F: x →y be a given function, then f--1 exists ( or f is invertible) if
f is one- one
f is onto
f is one one but not onto
f is one -one and onto
If the function f:R → R given by f(x) = x2 + 3x + 1 and g: R → R given by g(x) = 2x - 3, find fog
2x2 + 6x - 1
4x2 - 6x + 1
4x2 + 6x - 1
4x2 + 6x + 1
If n(A) = 4 and n(B) = 2 then the number of surjections from A to B is
14
2
8
none of these
Let f(x) = cosx, then f(x) is an
even function
odd function
power function
The range of function f(x) = [x] is
Set of all reals
R-Z
Z
Let f:{2, 3, 4, 5} → {3, 4, 5, 9} and g = {3, 4, 5, 9} → {7, 11, 15} be functions defined as f(2) = 3, f(3) = 4, f(4) = f(5) = 5 and g(3) = g(4) = 7 and g(5) = g(11) = 11 Find gof (5)
11
7
10
5
If f:R → R is defined by f(x) = x2 - 3x + 2 then f(f (x)) =
x4 + 6x3 + 10x2 + 3x
x4 - 6x3 + 10x2 - 3x
x4 + 6x2 - 10x2 - 3x
x4 + 6x3 - 10x2 + 3x
Let A,B be two sets each with 10 elements. Then the number of all possible bijections from A to B is
20
10!
100