If a full binary tree has a total of 63 nodes, then what will be the numbers of the internal nodes and the leaves, respectively, in the binary tree?

*pmessage++;

printf("%s", pmessage);

return 0;

}

What would be printed on the standard output as a result of the following code snippet?

main()

{

char *pmessage = "asdfgh";

*pmessage++;

printf("%s", pmessage);

return 0;

}

abc ( &a, &b ) ;

wxy ( &m, &n);

printf ( "%d, %d, %d, %d", a, b, m, n ) ;

return 0;

}

abc( int *x, int *y )

{

int t ;

t = *x ;

t = xyz();

*x = *y ;

*y = t++ ;

}

wxy(int *p, int *q)

{

*p = *p/2+9-1;

*q = *p/2+71-2;

}

xyz()

{

int t;

t = 6/2-54/3-(5.6/4);

return(t);

}

What would be the output of the given C program?

int main( )

{

int a = 10, b = 20, m = 47, n = 96 ;

abc ( &a, &b ) ;

wxy ( &m, &n);

printf ( "%d, %d, %d, %d", a, b, m, n ) ;

return 0;

}

abc( int *x, int *y )

{

int t ;

t = *x ;

t = xyz();

*x = *y ;

*y = t++ ;

}

wxy(int *p, int *q)

{

*p = *p/2+9-1;

*q = *p/2+71-2;

}

xyz()

{

int t;

t = 6/2-54/3-(5.6/4);

return(t);

}

struct st1 *ptr1 ;

};

main( )

{

struct st1 w1,w2;

w1.a = 251 ;

w2.a = 351 ;

w1.ptr1 = &w2 ;

w2.ptr1 = &w1 ;

printf ( "%d %d", w1.ptr1 –> a, w2.ptr1 –> a ) ;

}

What will be the output of the following program?

#include <stdio.h>

struct st1

{

int a;

struct st1 *ptr1 ;

};

main( )

{

struct st1 w1,w2;

w1.a = 251 ;

w2.a = 351 ;

w1.ptr1 = &w2 ;

w2.ptr1 = &w1 ;

printf ( "%d %d", w1.ptr1 –> a, w2.ptr1 –> a ) ;

}