edited by
9,864 views
40 votes
40 votes

Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE?

  1. $f$ and $g$ should both be onto functions
  2. $f$ should be onto but $g$ need not to be onto
  3. $g$ should be onto but $f$ need not be onto
  4. both $f$ and $g$ need not be onto
edited by

7 Answers

1 votes
1 votes

Option b will be correct as f is required to be onto while g need not necessary be onto as depicted by below example.

​​

0 votes
0 votes

so option b is correct option

f should be onto but g need not to be onto

Answer:

Related questions

36 votes
36 votes
6 answers
1
Kathleen asked Sep 22, 2014
24,474 views
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be:$O(n)$$O(n \log n)$$O \left( n^{\frac{3}{2}} \right)...
24 votes
24 votes
3 answers
4
gatecse asked Sep 21, 2014
7,062 views
The set \(\{1, 2, 4, 7, 8, 11, 13, 14\}\) is a group under multiplication modulo $15$. The inverses of $4$ and $7$ are respectively:$3$ and $13$$2$ and $11$$4$ and $13$$8...