GATE CS 2014 Set 1 — Question 51

MCQ+2 / -0.67MediumArrays & Strings in CC ProgrammingProgramming & Data StructuresArray Operations (1D, 2D)Arrays & Strings

Programming & Data Structures → Arrays & Strings → Array Operations (1D, 2D)

Last updated 5 September 2026

Question

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

Correct answer (A) maximum possible sum of elements in any sub-array of array E. Solution The function MyX first initializes Y to the sum of all elements in the array E . Then, it iterates through all possible sub-arrays defined by start index i and end index j . For each sub-array, it calculates the sum Z . If Z is greater than Y, Y is updated to Z . Essentially, Y tracks the maximum sum encountered so far. Since the initial value of Y (total sum) corresponds to the sub-array from 0 to size-1, the loop effectively checks every sub-array sum against the current maximum. Therefore, the function returns the maximum sum of elements among all possible sub-arrays of E . Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

Correct answer (A) maximum possible sum of elements in any sub-array of array E. Solution The function MyX first initializes Y to the sum of all elements in the array E . Then, it iterates through all possible sub-arrays defined by start index i and end index j . For each sub-array, it calculates the sum Z . If Z is greater than Y, Y is updated to Z . Essentially, Y tracks the maximum sum encountered so far. Since the initial value of Y (total sum) corresponds to the sub-array from 0 to size-1, the loop effectively checks every sub-array sum against the current maximum. Therefore, the function returns the maximum sum of elements among all possible sub-arrays of E .

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.