Function


Q11.

Consider the function y=|x| in the interval [-1, 1]. In this interval, the function is
GateOverflow

Q12.

Let A and B be sets with cardinalities m and n respectively. The number of one-one mappings from A to B, when m \lt n, is
GateOverflow

Q13.

If g(x)=1-x and h(x)=\frac{x}{x-1}, then \frac{g(h(x))}{h(g(x))} is:
GateOverflow

Q14.

How many onto (or surjective) functions are there from an n-element ( n \geq 2 ) set to a 2-element set?
GateOverflow

Q15.

The number of functions from an m element set to an n element set is
GateOverflow

Q16.

Let f be a function from a set A to a set B, g a function from B to C, and h a function from A to C, such that h(a) = g(f(a)) for all a \in A. Which of the following statements is always true for all such functions f and g?
GateOverflow

Q17.

Let S denote the set of all functions f:{\{0,1\}}^{4} \rightarrow \{0,1\}. Denote by N the number of functions from S to the set {0,1}. The value of log_{2} log_{2}N is______.
GateOverflow

Q18.

Let R denote the set of real numbers. Let f:R\times R \rightarrow R \times R be a bijective function defined by f(x,y) = (x+y, x-y). The inverse function of f is given by
GateOverflow