If the function $f: R \rightarrow R$ is defined by $f(x) = \begin{cases} 2x-3, & \text{if } x < -2 \\ x^2-1, & \text{if } -2 \leq x \leq 2 \\ 3x+2, & \text{if } x > 2 \end{cases}$ then $f$ is

  • A
    an injection but not a surjection
  • B
    a surjection but not an injection
  • C
    a bijection
  • D
    neither injection nor surjection

Explore More

Similar Questions

Are $f$ and $g$ both necessarily onto,if $g \circ f$ is onto?

The set $A$ has $4$ elements and the set $B$ has $5$ elements. Then,the number of injective mappings that can be defined from $A$ to $B$ is:

If $A = \{x \mid x \in N, x \leq 5\}$ and $B = \{x \mid x \in Z, x^{2} - 5x + 6 = 0\}$,then the number of onto functions from $A$ to $B$ is:

Show that the modulus function $f : R \rightarrow R$ given by $f(x) = |x|$ is neither one-one nor onto,where $|x| = x$ if $x \ge 0$ and $|x| = -x$ if $x < 0$.

$A = \{1, 2, 3, 4\}$ and $B = \{1, 2, 3, 4, 5, 6\}$ are two sets, and the function $f: A \rightarrow B$ is defined by $f(x) = x + 2$ for all $x \in A$. Then the function $f$ 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