1. While((*p++=*q++)!=0){} is equal to
2. The function strcmp(str1,str2) returns
3. int *x[](); means
4. #define PRINT(int) printf("int=%d",int);
main()
{
int x,y,z;
x=03;y=-1;z=01;
PRINT(x^x);
z<<=3;PRINT(x);
y>>=3;PRINT(y);
}
5. struct list{
int x;
struct list *next;
}*head;
the structhead.x =100
above is correct / wrong
6. '-'=45 '/'=47
printfr(%d/n,'-','-','-','-','/','/','/');
o/p =?
12.o/p=?
inti;
i=1;
i=i+2*i++;
printf(%d,i);
7.{ ch='A';
while(ch<='F'){
switch(ch){
case'A':case'B':case'C':case'D':ch++;continue;
case'E':case'F':ch++;
}
putchar(ch);
}
}
a) ABCDEF
b). EFG
c).FG
d).error
9. FILE *fp1,*fp2;
fp1=fopen("one","w")
fp2=fopen("one","w")
fputc('A',fp1)
fputc('B',fp2)
fclose(fp1)
fclose(fp2)}
10.int a=1; b=2; c=3; *pointer;
pointer=&c;
a=c/*pointer;
b=c;
printf("a=%d b=%d",a,b);
a). a=1 b=3
b). a=3 b=3
c). 3 2
d).error
11. #include<malloc.h>
char *f()
{
char *s=malloc(8);
strcpy(s,"goodbye")
}
main()
{
char *f()_;
printf("%c",*f()='A');
}
o/p=?
13. int sum(n)
int n;
if(n<1)return n;
else return(n+sum(n-1))
a) 10
b) 16
c) 14
d) 15
14. When a function is recursively called all ,automatic variables are
15) #define MAN(x,y) (x)>(y)?(x):(y)
{ int i=10;j=5;k=0;
k= MAN(i++,++j)
printf(%d %d %d %d,i,j,k)
}
16) a=10;b=5; c=3;d=3;
if(a<b)&&(c=d++)
printf(%d %d %d %d a,b,c,d)
else printf("%d %d %d %d a,b,c,d);
17). What is o/p
#include<stdarg.h>
show(intt,va_list ptr1)
{
inta,x,i;
a=va_arg(ptr1,int)
printf("
%d",a)
}
display(char)
{int x;
listptr;
va_star(otr,s);
n=va_arg(ptr,int);
show(x,ptr);
}
main()
{
display("hello",4,12,13,14,44);
}
a) 13
b) 12
c) 44
d) 14
18. If the following program (my prog)
main(int size of ,char *arg[])
{ while(size of arg) printf("%s",arg[--size of arg)
}
is run from the command line as myprogjanfeb mar apr
What would be the o/p
a)myprogjan,feb,mar,apr
b)rev
c)jan,feb,mar,apr
d)error
19.What is o/p
main()
{inti=3;
while(i--)
{
inti=100
i--;
printf("%d..",i);
}
}
a) infinite loop
b) error
c) 99..99..99..99
d) 3..22..1..
20) What is the o/p of the program
main()
{
int rows=3,colums=4;
int a[rows][colums]={1,2,3,4,5,6,7,8,9,10,11,12};
i=j=k=99;
for(i=0;i<rows;i++)
for(j=0;j<colums;j++)
if(a[k][j]<k) k=a[i][j];
printf("%d",k);
