Fill in the blank:

A connected graph is said to be an Eulerian graph, only if all the vertices of the graph have _______ degree.

a++;

while (num1[b] == 1 && a < b)

b––;

if (a < b)

{

  num1[a] = 0;

  num1[b] = 1;

  a++;

  b––;

}

  }

}

int main()

{

  int num[] = {1, 0, 1, 0, 1, 0, 1, 1, 0};

  int z = 9, x = 0;

  abc(num, z);

  for (x = 0; x < 9; x++)

  printf("%d ", num[x]);

  getchar();

  return 0;

}

What will be the output of the following program?

#include <stdio.h>

void abc(int num1[], int size)

{

  int a = 0, b = size–1;

  while (a < b)

  {

while (num1[a] == 0 && a < b)

a++;

while (num1[b] == 1 && a < b)

b––;

if (a < b)

{

  num1[a] = 0;

  num1[b] = 1;

  a++;

  b––;

}

  }

}

int main()

{

  int num[] = {1, 0, 1, 0, 1, 0, 1, 1, 0};

  int z = 9, x = 0;

  abc(num, z);

  for (x = 0; x < 9; x++)

  printf("%d ", num[x]);

  getchar();

  return 0;

}

f = res( a ) ;

f++;

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

}

res ( int x )

{ static int f ;

if ( x == 1 )

return ( 1 ) ;

else

f = x/4.5 + x + res ( x – 1 ) + 2 ;

return ( f++ ) ;

}

The following program is based on a recursive algorithm. Analyze the code and choose the correct output from the given options.

#include<stdio.h>

main( )

{ static int a,f;

a=5.2; f=1;

f = res( a ) ;

f++;

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

}

res ( int x )

{ static int f ;

if ( x == 1 )

return ( 1 ) ;

else

f = x/4.5 + x + res ( x – 1 ) + 2 ;

return ( f++ ) ;

}

}

What will be the output of the following code?

#include <stdio.h>

void main()

{

    int p=5, a, j, k, t, b;

    int num[]={1,2,3,4,6};

    b = num[0];

    for (a = 1; a < p – 1; a++)

    b = b ^ num[a];

    for (a = 2, k = 1; a <= p; a++)

    k = k ^ a;

    k = k ^ b;

    printf("%d", k+(k*18)+3);

}