Computer Sciences > GATE 2014 SET-3 > Functions
Consider the set of all functions f: {0, 1, ..., 2014} → {0, 1, ..., 2014} such that f(f(i)) = i, for all 0 ≤ i ≤ 2014. Consider the following statements:
P. For each such function it must be the case that for every i, f(i) = i.
Q. For each such function it must be the case that for some i, f(i) = i.
R. Each such function must be onto.
Which one of the following is CORRECT?
P. For each such function it must be the case that for every i, f(i) = i.
Q. For each such function it must be the case that for some i, f(i) = i.
R. Each such function must be onto.
Which one of the following is CORRECT?
Correct : b
Similar Questions
The following function computes the maximum value contained in an integer array p[] of size n (n >= 1)
int max(int *p, int n)
{
int a=0, b=n...
Consider the following C program.
void f(int, short);
void main()
{
int i = 100;
short s = 12;
short *p = &s;
&...
Consider the following function implemented in C:
void printxy(int x, int y)
{
int *ptr;
x = 0;
ptr = &x;...
Total Unique Visitors
Loading......