Test Index

GATE Computer Science (CS) 2014 Shift 1 Solved Paper

© examsnet.com

Question : 51

Total: 65

Consider the following C function in which size is the number of elements in the array E:
int MyX(int *E, unsigned int size)
{
      int Y = 0;
      int Z;
      int i, j, k;
      for(i = 0; i < size; i++)
Y = Y + E[i];
      for(i = 0; i < size; i++)
for(j = i; j < size; j++)
{
      Z = 0;
      for(k = i; k <= j; k++)
Z = Z + E[k];
      if (Z > Y)
Y = Z;
}
      return Y;
}
The value returned by the function MyX is the

maximum possible sum of elements in any sub-array of array E
maximum element in any sub-array of array E.
sum of the maximum elements in all possible sub-arrays of array E.
The sum of all the elements in the array E.

Go to Question:

Prev Question

Next Question