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?

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 ________.

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.

Let A be a square matrix size $$n \times n$$. Consider the following pseudocode. What is the expected output?

C = 100; 
for i = 0 to n do 
for j = 1 to n do 
 { 
      Temp = A[ i ][ j ] + C ; 
      A[ i ][ j ] = A[ j ][ i ] ; 
      A[ j ][ i ] = Temp - C ; 
 } 

 for i = 0 to n do 
 for j = 1 to n do 
 output(A[ i ][ j ]);