latest placement papers of Capgemini

Consider the following code segment in C to traverse a binary tree using the preorder

typedef struct tree {
int info;
struct  *left;
struct  *right;
}node;

void preorder(node *tree)
{
if (t)
{
Statementl
Statement2
Statement3
}
}
The above Statements should be

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;
}

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

Case I:
public void max(Tree root)
{
while(root.left() != null) 
{
root = root.left();
}
System.out.println(root.data());
}

Case II:
public void max(Tree root)
{
while(root != null)
{
root = root.left();
}
System.out.println(root.data());
}

Case III:
public void max(Tree root)
{
while(root.right() != null)
{
root = root.right();
}
System.out.println(root.data());
}

Case IV:
public void max(Tree root)
{
while(root != null)
{
root = root.right();
}
System.out.println(root.data());
}

#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);
    }

A NAND gate has

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

#include <stdio.h>
int main()
{
int i=12;
int *p =&i;
printf("%d\n",*p++);
}

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?

#include<stdio.h>
 int main()
{
    char ch;
    int i;
    scanf("%c", &i);
    scanf("%d", &ch);
    printf("%c %d", ch, i);
    return 0;
}

For all integral values of n, the expression ((7^2n)-(3^3n)) is a multiple of: