Let $R$ denote the set of all real numbers and $R^{+}$ denote the set of all positive real numbers. For the subsets $A$ and $B$ of $R$,define $f: A \rightarrow B$ by $f(x) = x^2$ for $x \in A$. Match the items in Column-$I$ with the items in Column-$II$.
Column-$I$Column-$II$
$A$. $f$ is one-one and onto,if$1$. $A = R^{+}, B = R$
$B$. $f$ is one-one but not onto,if$2$. $A = B = R$
$C$. $f$ is onto but not one-one,if$3$. $A = R, B = R^{+}$
$D$. $f$ is neither one-one nor onto,if$4$. $A = B = R^{+}$

  • A
  • B
  • C
  • D

Explore More

Similar Questions

If the function $f:[-1,1] \rightarrow R$ is defined by $f(x) = \begin{cases} 2^x+1, & \text{for } x \in [-1,0) \\ 1, & \text{for } x=0 \\ 2^x-1, & \text{for } x \in (0,1] \end{cases}$,then in $[-1,1]$,$f(x)$ has

Let $A = \{x_1, x_2, x_3, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. Then the total number of functions $f: A \to B$ which are onto,if there exist exactly three elements $x$ in $A$ such that $f(x) = y_2$,is equal to

Let $f : R \to R$ be defined by $f(x) = \frac{ax^2 + ax + b}{ax + b}$. Then:

Let $A = \{0, 1, 2, 3, 4, 5, 6, 7\}$. Then the number of bijective functions $f: A \rightarrow A$ such that $f(1) + f(2) = 3 - f(3)$ is equal to $.....$

Show that an onto function $f: \{1, 2, 3\} \rightarrow \{1, 2, 3\}$ is always one-one.

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