GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2014 · session-1
Programming & Data StructuresArraysmediumMCQ2 marks
Consider the following C function in which size is the number of elements in the array E:
c
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
Save your progress

Related Programming & Data Structures PYQs

GATE 2014 · Set-3

Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are

GATE 2014 · Set-3

The height of a tree is the length of the longest root- to-leaf path in it. The maximum and minimum number of nodes in a binary tr…

GATE 2014 · Set-2

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the…

GATE 2014 · Set-3

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3…

GATE 2014 · Set-2

Consider the C function given below. Assume that the array listA contains n(>0) elements, sorted in ascending order int ProcessArr…

GATE 2014

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below…