PSUEDOCODE 2 CAPGEMINI

int sum (int A[], int n)

{

int sum = 0, i;

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

sum = sum + A[i];

return sum;

}// sizeof(int) = 2 bytes

Question: Point out the error in the program?

#include<stdio.h>

int main()

{

char ch;

int i;

scanf("%c", &i);

scanf("%d", &ch);

printf("%c %d", ch, i);

return 0;

}

Question: Consider the following iterative implementation to find the factorial of a number:

int main()

{

int n = 6, i;

int fact = 1;

for(i=1;i<=n;i++)

_________;

printf("%d",fact);

return 0;

}

Which of the following lines should be inserted to complete the above code?

Question: What is the output of this C code?

#include <stdio.h>

int main()

{

int i=12;

int *p =&i;

printf(“%d\n”,*p++);

}

Question: Convert the following 211 decimal number to 8-bit binary?

Question: A NAND gate has:

Question: Comment on the output of this C code?

#include <stdio.h>

int main()

{

int a = 1;

switch (a)

case 1:

printf("%d", a);

case 2:

printf("%d", a);

case 3:

printf("%d", a);

default:

printf("%d", a);

}

Question: How will you find the maximum element in a binary search tree?

Question: What is the output of the following code?void my_recursive_function(int n)

{

if(n == 0)

return;

printf("%d ",n);

my_recursive_function(n-1);

}

int main()

{

my_recursive_function(10);

return 0;

}

For input a = 8 & b = 9.

function (input a, input b)

If (a < b)

return function (b, a)

elseif (b != 0)

return (a + function (a, b - 1))

else

return 0