Capgemini placement papers with solution

What will be the output of the program?

#include
#include

int main()
{
int *p;
p = (int *)malloc(20); /* Assume p has address of 1314 */
free(p);
printf("%u", p);
return 0;
}

#include<stdio.h> int main()
{
show();
return 0;
}
void show()
{
printf("I'm the greatest");
}

#include<stdio.h> void main()
{
printf("%p",main);
}

#include<stdio.h>
#define  max(a,b)  (a>b)? a:b
int  main()
{
int a,b; a=3; b=4;
printf("%d",max(a,b));
return 0;
}

#include<stdio.h>
void main()
{
int i=5;
printf("%d",i+++++i);
}

Note: 32 bit compiler

#include<stdio.h>
int main(){
    float **(*ptr)[4]=(float **(*)[4])0;
    ptr+=5;
    printf("%d  %d",ptr,sizeof ptr);
    return 0;
}

In Breadth First Search of Graph, which of the following data structure is used?

An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

Let S be the original stack and S1 and S2 the two additional stacks then the following pseudo code is to reverse the stack S:

while (S not empty)
{
push(S1,pop(S));
}

while(S1 not empty)
{
push(S2,pop(S1));
}

while(S2 not empty)
{
push(S,pop(S2));
} ?

void fn( ){
char c;
cin.get(c);                   
if (c != '\n') {
fn( );
cout.put(c);
}
}