$f:[-2,2] \rightarrow[-2,2]$ and $g:[-2,2] \rightarrow[0,4]$ are two functions defined as $f(x)=\begin{cases} -2, & -2 \leq x \leq 0 \\ x^2-2, & 0 \leq x \leq 2 \end{cases}$ and $g(x)=|f(x)|+f(|x|)$,then

  • A
    $f$ and $g$ are injective mappings
  • B
    $f$ and $g$ are surjective mappings
  • C
    $f$ is bijective mapping and $g$ is injective mapping
  • D
    $f$ is not bijective mapping and $g$ is surjective mapping

Explore More

Similar Questions

The number of functions $f: \{1, 2, \ldots, 100\} \rightarrow \{0, 1\}$ that assign $1$ to exactly one of the positive integers less than or equal to $98$ is equal to $\qquad$.

Show that the function $f: N \rightarrow N$ given by $f(x) = 2x$ is one-one but not onto.

The function $f: R \rightarrow R$ is defined by $f(x)=3^{-x}$. Observe the following statements about it:
$I$. $f$ is one-one
$II$. $f$ is onto
$III$. $f$ is a decreasing function
Out of these,the true statements are:

In each of the following cases,state whether the function is one-one,onto or bijective. Justify your answer. $f : R \rightarrow R$ defined by $f(x) = 3 - 4x$.

If $P(S)$ denotes the set of all subsets of a given set $S$,then the number of one-to-one functions from the set $S = \{ 1, 2, 3 \}$ to the set $P(S)$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo