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-1; while ( … ) if (p[a] The missing loop condition is A) a != n B) b != 0 C) b > (a + 1) D) b != a

Official answer: D) b != a. Explanation: The algorithm uses two pointers, a initialized to 0 and b initialized to n - 1, to narrow down the range containing the maximum element. - In each iteration, the elements p[a] and p[b] are compared: - If p[a] p[b], then p[a] cannot be the unique maximum, so index a is incremented (a = a + 1). - Otherwise (p[a] > p[b]), p[b] cannot be the maximum, so index b is decremented (b = b - 1). - The search space decreases by 1 in each step until only a single element remains, which happens when a = b. - After the loop terminates with a = b, p[a] is returned, which contains the maximum value in the array. Therefore, the loop must continue as long as a b, which is given by the condition `b != a`. Thus, (D) is the correct option.

Programming and Data Structures · Programming in C

Official IIT answer key · IISc Bangalore · Audited Aug 2026

Take topic test

GATE CSE 2016 Set 1 Q34 · MCQ · 2 marks

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is

Select an option to check

Key concept

Programming in C

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Programming in C

In GATE CS, Programming in C is tested extensively through rigorous code tracing, pointer mechanics, and fundamental semantics rather than high-level syntax trivia. Questions emphasize pointer arithmetic and multidimensional array decay, storage classes (especially static local variables), evaluation order, side effects of increment/decrement operators, parameter passing mechanisms (pass-by-value vs pass-by-reference), and recursive program state tracking. The topic features a nearly balanced split between NAT and MCQ items across 1-mark and 2-mark categories, demanding precise, bug-free execution traces without a compiler.

Full Programming in C guide →

More on Programming in C

All 74 questions on Programming in C →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Programming and Data Structures · Programming in C

Official IIT answer key · IISc Bangalore · Audited Aug 2026

Take topic test

GATE CSE 2016 Set 1 Q34 · MCQ · 2 marks

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is

Select an option to check

Key concept

Programming in C

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Programming in C

Full Programming in C guide →

More on Programming in C

All 74 questions on Programming in C →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is

Step-by-step verified solution

Check you can still solve Programming in C under a clock

More from GATE CSE 2016 Set 1

More on Programming in C

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is

Step-by-step verified solution

Check you can still solve Programming in C under a clock

More from GATE CSE 2016 Set 1

More on Programming in C

The following function computes the maximum value contained in an integer array p[] of size nnn (n≥1n \ge 1n≥1). int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; } The missing loop condition is

Step-by-step verified solution

Check you can still solve Programming in C under a clock

More from GATE CSE 2016 Set 1

More on Programming in C

Share this solution

The following function computes the maximum value contained in an integer array p[] of size nnn (n≥1n \ge 1n≥1). int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; } The missing loop condition is

Step-by-step verified solution

Check you can still solve Programming in C under a clock

More from GATE CSE 2016 Set 1

More on Programming in C

Share this solution

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is

The following function computes the maximum value contained in an integer array `p[]` of size $n$ ( $n \ge 1$ ). `int max(int *p, int n) { int a=0, b=n-1; while (__________) { if (p[a] <= p[b]) { a = a+1; } else { b = b-1; } } return p[a]; }` The missing loop condition is