Materials:

Recent questions tagged functions

2 votes
1 answer
242
Consider a function f from A to B such that f : A → B is bijective.f–1 represents inverse of f.Than could we say that f-1 :B->A is also bijective..Please give proper ...
1 votes
3 answers
245
Following is the way of checking the one to one functionorCan i use bi implication in between these?If not,then why?
8 votes
4 answers
247
What is the output of the following program?#include<stdio.h int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d",...
0 votes
1 answer
248
No of one to one function from set A={1,2,3,4,5,6,7,8,9} to set B ={x1,x2,x3,x4,x5,x6,x7,.....,xn}
1 votes
1 answer
249
5 votes
1 answer
250
If $\textit{f}(x)=x^{2}$ and $g(x)=x \sin x +\cos x$ then$f$ and $g$ agree at no point$f$ and $g$ agree at exactly one point$f$ and $g$ agree at exactly two point$f$ and ...
6 votes
1 answer
251
If $\textit{f}(x)=\frac{\sqrt{3}\sin x}{2+\cos x}$ then the range of $\textit{f}(x)$ isthe interval $\left[-1,\frac{\sqrt{3}}{2}\right]$the interval $\left[\frac{-\sqrt{3...
0 votes
1 answer
253
$x^3$ + $x$ sin $x$ isa) Constant functionb) Odd functionc) Even functiond) Periodic function
17 votes
2 answers
259
0 votes
1 answer
260
–1 votes
0 answers
263
How to find identity element of a function ? Ex : f(x)= x+y-3How to find identity element of fog(x) ? please take an example and explain for fog(x)
1 votes
2 answers
264
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
0 votes
1 answer
266
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
2 votes
2 answers
267
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
1 votes
2 answers
270
Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the CodeProblemGiven an unordered array arr[] which contains n di...