PRACTICE TEST
1. If f : {1, 3} {1, 2, 5} and g : {1, 2, 5} {1, 2, 3, 4} be given by f = {(1, 2), (3, 5)}, g =
{(1, 3), (2, 3), (5, 1)}, write gof.
x+1
2. Let g, f : R R be defined b g(x)= ,f(x)=3x-2 write fog(x)
3
2x-1
3. If f : R R defined by f(x)= be an invertible function, write f 1 (x) .
5
x
4. If f(x)= x , write fof(x) .
x+1
5. Let * be a Binary operation defined on R, then if
(i) a * b = a + b + ab, write 3 * 2.
(a+b) 2
(ii) a*b= , write (2 * 3) * 4.
3
6. If n(A) = n(B) = 3, then how many bijective functions from A to B can be formed?
7. If f (x) = x + 1, g(x) = x 1, then (gof) (3) = ?
8. Is f : N N given by f x =x 2 one-one? Give reason.
17. Consider the binary operation * on the set {1, 2, 3, 4, 5} defined by a* b = H.C.F. of a
and b. Write the operation table for the operation *.
4 4 4x
18. Let f:R-{ } R { } be a function given by f(x)= Show that f is
3 3 3x+4
4x
invertible with f 1 (x)= .
4-3x
3x+4 7 7
19. Show that function f : A B defined as f(x)= where A=R-{ } , B=R-{ }
5x-7 5 5
2ab
21. If * is a binary operation defined on R {0} defined by a*b= then check * for
b2
commutativity and associativity.
ab
23. Let * be a binary operation on set Q defined by a*b= show that
4
16
(ii) Every non zero element of Q is invertible with a 1 = , a Q-{0} .
Q
1
24. Show that f:R + R + defined by f(x)= is bijective where R + is the set of all
2x
non-zero positive real numbers.
26. If f, g : R R defined by f(x) = x 2 x and g(x) = x + 1 find (fog) (x) and (gof) (x). Are
they equal?
1
27. f:[1,) [2, ) is given by f(x)=x+ , find f 1 (x) .
x
2
28. f : R R, g : R R given by f(x) = [x], g(x) = |x| then find (fog)( ) and
3
2
(gof)( ).
3