Which of the following options is the output of the given program?

int main( )

{

int a=8.5, f=1 ;

f = res( a ) ;

f++;

printf ( "%d", f++ ) ;

return 0;

}

res ( int x )

{

int f=1 ;

if ( x == 1 )

return ( 1 ) ;

else

f = f/4.5 + x * res ( x - 1 ) ;

return ( f++ ) ;

}

{

  k1 = k2;

  k2 = num2[0];

  break;

}

else if (x2 == n)

{

  k1 = k2;

  k2 = num1[0];

  break;

}

if (num1[x1] < num2[x2])

{

  k1 = k2;

  k2 = num1[x1];

  x1++;

}

else

{

  k1 = k2;

  k2 = num2[x2];

  x2++;

}

  }

  return (k1 + k2)/2;

}

int main()

{

  int num1[] = {22, 27, 34, 31, 39};

  int num2[] = {22, 54, 67, 74, 46};

  int p1 = sizeof(num1) / sizeof(num1[0]);

  int p2 = sizeof(num2) / sizeof(num2[0]);

  if (p1 == p2)

  printf("%d", funct1(num1, num2, p1));

  else

  printf("failure");

  return 0;

}

Find the output of the following code and choose the correct answer from the given options.

#include <stdio.h>

int funct1(int num1[], int num2[], int n)

{

  int x1 = 0;

  int x2 = 0;

  int total;

  int k1 = –1, k2 = –1;

  for (total = 0; total <= n; total++)

  {

if (x1 == n)

{

  k1 = k2;

  k2 = num2[0];

  break;

}

else if (x2 == n)

{

  k1 = k2;

  k2 = num1[0];

  break;

}

if (num1[x1] < num2[x2])

{

  k1 = k2;

  k2 = num1[x1];

  x1++;

}

else

{

  k1 = k2;

  k2 = num2[x2];

  x2++;

}

  }

  return (k1 + k2)/2;

}

int main()

{

  int num1[] = {22, 27, 34, 31, 39};

  int num2[] = {22, 54, 67, 74, 46};

  int p1 = sizeof(num1) / sizeof(num1[0]);

  int p2 = sizeof(num2) / sizeof(num2[0]);

  if (p1 == p2)

  printf("%d", funct1(num1, num2, p1));

  else

  printf("failure");

  return 0;

}

    else

    {printf("%d ", head–>data*21); }

}

void xy2(struct abc* start)

{ if(start == NULL)

    return;

    if(start–>next != NULL )

    xy2(start–>next–>next);

    if((start–>data%2==0))

    {printf("%d ", start–>data*3); }

    else

    {printf("%d ", start–>data*12); }

}

void p(struct abc** head_ref, int new_data)

{ struct abc* new_node =(struct abc*) malloc(sizeof(struct abc));

    new_node–>data = new_data;

    new_node–>next = (*head_ref);

    (*head_ref) = new_node;

}

int main()

{ struct abc* head = NULL;

    p(&head, 21);

    xy1(head);

    xy2(head);

    getchar();

    return 0;

}

What will be the output of the following code?

#include<stdio.h>

#include<stdlib.h>

struct abc

{ int data;

    struct abc *next;

};

void xy1(struct abc* head)

{ if(head == NULL)

    return;

    xy1(head–>next);

    if ((head–>data)%2==0)

    {printf("%d ", head–>data*31);}

    else

    {printf("%d ", head–>data*21); }

}

void xy2(struct abc* start)

{ if(start == NULL)

    return;

    if(start–>next != NULL )

    xy2(start–>next–>next);

    if((start–>data%2==0))

    {printf("%d ", start–>data*3); }

    else

    {printf("%d ", start–>data*12); }

}

void p(struct abc** head_ref, int new_data)

{ struct abc* new_node =(struct abc*) malloc(sizeof(struct abc));

    new_node–>data = new_data;

    new_node–>next = (*head_ref);

    (*head_ref) = new_node;

}

int main()

{ struct abc* head = NULL;

    p(&head, 21);

    xy1(head);

    xy2(head);

    getchar();

    return 0;

}