The number of onto functions from the set $\{1, 2, \ldots, 11\}$ to the set $\{1, 2, \ldots, 10\}$ is

If $f: R \rightarrow R$ is defined by $f(x)=x-[x]-\frac{1}{2}$ for $x \in R$, where $[x]$ is the greatest integer not exceeding $x$, then $\{x \in R: f(x)=\frac{1}{2}\}$ is equal to :

$A$ function from $A = \{x : -1 \leq x \leq 1\}$ to itself which is not a bijection is

The number of bijective functions $f : \{1, 3, 5, 7, \ldots, 99\} \rightarrow \{2, 4, 6, 8, \ldots, 100\}$ such that $f(3) \geq f(9) \geq f(15) \geq f(21) \geq \ldots \geq f(99)$ is:

Let $f(x) = \begin{cases} -a & \text{if } -a \leq x \leq 0 \\ x+a & \text{if } 0 < x \leq a \end{cases}$ where $a > 0$ and $g(x) = \frac{f(|x|) - |f(x)|}{2}$. Then the function $g: [-a, a] \rightarrow [-a, a]$ is

Let $A$ be the set of all $50$ students of Class $X$ in a school. Let $f: A \rightarrow N$ be a function defined by $f(x) = \text{roll number of the student } x$. Show that $f$ is one-one but not onto.