1
GATE CSE 2025 Set 1
Numerical
+1
-0
 #include < stdio.h>
void foo(int *p, int x) {
    *p = x;
}
int main( ) {
    int *z;
    int a = 20, b=25;
    z = &a;
    foo(z, b);
    printf("%d", a);
    return 0;
}

The output of the given C program is _________. (Answer in integer)

Your input ____
2
GATE CSE 2024 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Consider the following C program:


#include <stdio.h>

int main() {

   int a = 6;

   int b = 0;

   while(a < 10) {

      a = a / 12 + 1;

      a += b;}

   printf("%d", a);

   return 0;}

Which one of the following statements is CORRECT?

A

The program prints 9 as output

B

The program prints 10 as output

C

The program gets stuck in an infinite loop

D

The program prints 6 as output

3
GATE CSE 2015 Set 2
Numerical
+1
-0
Consider the following C function.
int fun ( int n ) {

   int x = 1, k ;
   if ( n == 1) return x ;
   for( k = 1 ; k < n ; ++ k )
       x = x + fun( k ) * fun( n - k ) ;
   return x ;
}
The return value of fun (5) is ________.
Your input ____
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.
A
1 and 2 only
B
2 and 3 only
C
3 and 4 only
D
1 and 3 only
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP