Programming and Data Structures · Programming in C
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2017 Set 2 Q43 · NAT · 2 marks
swap (&x, &y) exchanges the contents of x and y.
int main() {
int array[] = {3, 5, 1, 4, 6, 2};
int done = 0;
int i;
while (done == 0) {
done = 1;
for (i=0; i<=4; i++) {
if (array[i] < array[i+1]) {
swap(&array[i], &array[i+1]);
done = 0;
}
}
for (i=5; i>=1; i--) {
if (array[i] > array[i-1]) {
swap(&array[i], &array[i-1]);
done = 0;
}
}
}
printf("%d", array[3]);
}
The output of the program is __________.Key concept
No account needed
Sit 5 related Programming in CPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
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 →Consider the following snippet of a C program. Assume that swap (&x, &y) exchanges the contents of x and y . int main() int array[] = 3, 5, 1, 4, 6, 2; int done = 0; int i; while (done == 0) done = 1; for (i=0; i =1; i--) if (array[i] > array[i-1]) swap(&array[i], &array[i-1]); done = 0; printf("%d", array[3]); The output of the program is …
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.