Computer Sciences > GATE 2025 SET-1 > Functions
g(.) is a function from A to B, f(.) is a function from B to C, and their composition defined as f(g(.)) is a mapping from A to C.
If f(.) and f(g(.)) are onto (surjective) functions, which ONE of the following is TRUE about the function g(.)?
A
g(.) must be an onto (surjective) function.
B
g(.) must be a one-to-one (injective) function.
C
g(.) must be a bijective function, that is, both one-to-one and onto.
D
g(.) is not required to be a one-to-one or onto function.

Correct : a

Similar Questions

The following function computes the maximum value contained in an integer array p[] of size n (n >= 1) int max(int *p, int n) {     int a=0, b=n...
#123 MCQ
Consider the following C program. void f(int, short); void main() {     int i = 100;     short s = 12;     short *p = &s; &...
#144 MCQ
Consider the following function implemented in C: void printxy(int x, int y) {     int *ptr;     x = 0;     ptr = &x;...
#159 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: