GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2021 · Set-2
Programming & Data StructuresProgramminghardNAT2 marks
Consider the following ANSI C program.
c
#include <stdio.h>
int foo(int x, int y, int q)
{
  if ((x ≤ 0) && (y ≤ 0)) return q;
  if (x ≤ 0) return foo(x, y-q, q);
  if (y ≤ 0) return foo(x-q, y, q);
  return foo(x, y-q, q) + foo(x-q, y, q);
}
int main()
{
  int r = foo(15,15,10);
  printf("%d", r);
  return 0;
}
The output of the program upon execution is _______________.
Save your progress

Related Programming & Data Structures PYQs

GATE 2021 · Set-1

A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than t…

GATE 2021 · Set-1

Consider the following sequence of operations on an empty stack. push(54); push(52); pop(); push(55); push(62); s = pop(); Conside…

GATE 2021 · Set-1

Consider the following ANSI C program. ```c #include <stdio.h> int main() { int i, j, count; count = 0; i = 0; for (j = -3…

GATE 2021 · Set-1

Consider the following ANSI C function: ```c int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loo…

GATE 2021 · Set-2

Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal …

GATE 2021 · Set-2

Consider the following ANSI C program. ```c #include <stdio.h> int main(){ int arr[4][5]; int i, j; for (i=0; i<4; i++){ …