Question Set 19 - C
Question Set 19 - C
int main(){
int main(){ char far *p,*q;
int a = 320; printf("%d %d",sizeof(p),sizeof(q));
char *ptr; }
ptr =( char *)&a; 9. int main(){
printf("%d ",*ptr); int a = 10;
} void *p = &a;
2. int main(){ int *ptr = p;
void (*p)(); printf("%u",*ptr);
int (*q)(); return 0;
int (*r)(); }
p = clrscr; 10. int main(){
q = getch; int register a;
r = puts; scanf("%d",&a);
(*p)(); printf("%d",a);
(*r)(" AIEMD "); return 0;
(*q)(); }
} //if a=25
3. int main(){ 11. int main(){
int i = 3; char arr[10];
int *j; arr = "world";
int **k; printf("%s",arr);
j=&i; return 0;
k=&j; }
printf("%u%u%d ",k,*k,**k); 12. int main(){
} int a,b,c,d;
4.int main(){ char *p = ( char *)0;
char far *p =(char far*)0x55550005; int *q = ( int *q)0;
char far *q =(char far*)0x53332225; float *r = ( float *)0;
*p = 80; double *s = 0;
(*p)++; a = (int)(p+1);
printf("%d",*q); b = (int)(q+1);
} c = (int)(r+1);
5. int main(){ d = (int)(s+1);
char *ptr1 = NULL; printf("%d %d %d %d",a,b,c,d);
char *ptr2 = 0;
strcpy(ptr1," c"); }
strcpy(ptr2,"questions"); 13. int main(){
printf("\n%s %s",ptr1,ptr2); int a = 5,b = 10,c;
} int *p = &a,*q = &b;
c = p - q;
printf("%d" , c);
6. int main(){ }
int huge *a =(int huge *)0x59990005; 14. unsigned long int (* avg())[3]{
int huge *b =(int huge *)0x59980015; static unsigned long int arr[3] =
if(a == b) {1,2,3};
printf("power of pointer"); return &arr;
else }
printf("power of c"); int main(){
} unsigned long int (*ptr)[3];
7. int main(){ ptr = avg();
register a = 25; printf("%d" , *(*ptr+2));
int far *p; return 0;
p=&a; }
printf("%d ",*p);
}
printf("%u",ptr);
15. int main(){ }
int * p , b; 22. typedef struct abc{
b = sizeof(p); int far*a;
printf("%d" , b); double b;
unsigned char c;
return 0; }ABC;
}
16. int main(){ int main(){
int i = 5 , j;
int *p , *q; ABC *ptr=(ABC *)1000;
p = &i;
q = &j; ptr=ptr+2;
j = 5; printf("%u",ptr);
printf("%d %d",*p,*q); }
} 23. typedef union abc{
char near*a;
17. int main(){ long double d;
int i = 5; unsigned int i;
int *p; }ABC;
p = &i;
printf(" %u %u", *&p , &*p); int main(){
}
ABC *ptr=(ABC *)1000;
18. int main(){
ptr=ptr-4;
int x=25; printf("%u",ptr);
int *ptr=&x; //statement one }
int **temp=&ptr; //statement two 24. int main(){
printf(“%d %d %d”.x.*ptr,**temp); int i = 100;
} printf("value of i:%d addresss of i :
19. int main(){ %u",i,&i);
i++;
int *ptr=( int *)1000; printf("\nvalue of i : %d addresss of i :
%u",i,&i);
ptr=ptr+1; }
printf("%u",ptr);
25. int main(){
} char far *p =(char far *)0x55550005;
20. int main(){ char far *q =(char far *)0x53332225;
*p = 25;
double *p=(double *)1000; (*p)++;
printf("%d",*q);
p=p+3; }
printf("%u",p);
} 26. int main(){
21. int main(){ int i = 3;
int *j;
float array[5]={1.1f,2.2f,3.3f}; int **k;
float(*ptr)[5]; j = &i;
k = &j;
ptr=&array; printf("%u %u %u",i,j,k);
printf("%u",ptr); }
ptr=ptr+1;
27. float * display(int,int); printf("%u %u\n",p,q);
int max=5; printf("Difference=%d",q-p);
int main(){
float *(*ptr)(int,int); }
ptr=display;
(*ptr)(2,2);
printf("%u",ptr); 33. int main(){
ptr=ptr+1; int i=5;
printf("%u",ptr); int *p=&i;
} int *q=(int *)2;
float * display(int x,int y){ printf("%d",p+q);
float f; }
f=x+y+max; 34. int main(){
return &f; int near*p=(int near*)0x0A0005555;
} int near*q=(int near*)0x0A2115555;
if(p==q)
28. int main(){ printf("Equql");
int *p=(int *)1000; else
int *temp; printf("Notequal");
temp=p; }
p=p+2; 35. int main(){
printf("%u %u\n",temp,p); int far*p=(int far*)0x0A0005555;
printf("difference= %d",p-temp); int far*q=(int far*)0x0A2115555;
} if(p==q)
29. int main(){ printf("Equql");
float *p=(float *)1000; else
float *q=(float *)2000; printf("Not equal");
printf("Difference= %d",q-p); }
} 36. int main(){
30. struct abc{ int huge*p=(int huge*)0x0A0005555;
signed char c; int huge*q=(int huge*)0x0A2113445;
short int i; if(p==q)
long double l; printf("Equql");
}; else
int main(){ printf("Not equal");
struct abc *p,*q; }
p=(struct abc *)1000; 37. int main(){
q=(struct abc *)2000; int i=5,j=10;
printf("Difference= %d",q-p); int *p=&i;
} int *q=&j;
31. typedef union xxx{ printf("%d",p|q);
char far * c; }
const volatile i; 38. int main(){
long int l; int near*far*huge* p;
}XXX; printf("%d",sizeof(p));
int main(){ printf(" %d",sizeof(*p));
XXX *p,*q; printf(" %d",sizeof(**p));
p=(XXX *)1000; }
q=(XXX *)2000; 39. int * function();
printf("Difference= %d",q-p); int main(){
} auto int *x;
32. int main(){ int *(*ptr)();
const volatile array[4]={0}; ptr=&function;
const volatile(*p)[4]=&array; x=(*ptr)();
const volatile(*q)[4]=&array; printf("%d",*x);
q++; }
q++;
int *function(){ int(*array[3])();
static int a=10; int(*(*ptr)[3])();
return &a; int main(){
} array[0]=display;
40. int find(char); array[1]=getch;
int(*function())(char); ptr=&array;
int main(){ printf("%d",(**ptr)());
int x; (*(*ptr+1))();
int(*ptr)(char); }
ptr=function(); int display(){
x=(*ptr)('A'); int x=5;
printf("%d",x); return x++;
} }
int find(char c){ 44. int main(){
return c; char
} *array[4]={"c","c++","java","sql"};
int(*function())(char){ char *(*ptr)[4]=&array;
return find; printf("%s ",++(*ptr)[2]);
} }
45. struct address{
41. char * call(int *,float *); char *name;
int main(){ char street[10];
intpin;
char *string; }cus={"A.Kumar","H-2",456003},*p=&cus;
int a=2; int main(){
float b=2.0l;
char *(*ptr)(int*,float *); printf("%s %s",p->name,(*p).street);
}
ptr=&call;
string=(*ptr)(&a,&b);
printf("%s",string); 46.
} 8. The operator used to get value at address stored in a pointer
char *call(int *i,float *j){ variable is
static char *str=" AIEMD "; A.* B. &
C. && D. ||
str=str+*i+(int)(*j);
return str; 47.
} What is (void*)0?
A.Representation of NULL pointer
42. char far * display(char far*); B. Representation of void pointer
int main(){ C. Error
D.None of above
char far* string="AIEMD";
char far *(*ptr)(char far *); 48.
Can you combine the following two statements into one?
ptr=&display;
string=(*ptr)(string); char *p;
printf("%s",string); p = (char*) malloc(100);
} A.char p = *malloc(100);
char far *display(char far * str){ B. char *p = (char) malloc(100);
char far * temp=str; C. char *p = (char*)malloc(100);
temp=temp+13; D.char *p = (char *)(malloc*)(100);
*temp='\0';
return str; 49.
} How many bytes are occupied by near, far and huge pointers
43. int display(); (DOS)?
A.near=2 far=4 huge=4 B. near=4 far=8 huge=8 p2+=1;
C. near=2 far=4 huge=8 D.near=4 far=4 huge=8 p3+=2;
50. printf("%s",(***ptr[0])[2]);
If a variable is a pointer to a structure, then which of the
following operator is used to access data members of the
structure through the pointer variable? return 0;
A.. B. & }
C. * D.->
57. #include<stdio.h>
51.
What would be the equivalent pointer expression for referring int main(){
the array element a[i][j][k][l]
A. ((((a+i)+j)+k)+l) B. *(*(*(*(a+i)+j)+k)+l) int x=10;
C. (((a+i)+j)+k+l) D. ((a+i)+j+k+l) int far *ptr;
ptr=&x;
52. printf("%d",sizeof(ptr));
A pointer is
A.A keyword used to create variables
B. A variable that stores address of an instruction return 0;
C. A variable that stores address of other variable }
D.All of the above
53. #include<stdio.h> 58. #include<stdio.h>
int main(){
char huge * far *p; int main(){
printf("%d %d
%d",sizeof(p),sizeof(*p),sizeof(**p)); int far *near*ptr;
printf("%d%d",sizeof(ptr),sizeof(*ptr
));
return 0;
}
54. #include<stdio.h> return 0;
int main(){ }
strcpy(str,"c-pointer.blogspot.com");
62. #include<stdio.h> printf("%s",str);
int main(){
return 0;
int x=25; }
int near* ptr;
67. #include<stdio.h>
ptr=&x; int main(){
printf(“%d”,sizeof(ptr));
char c='A';
int i=4;
return 0; void *p;
} char *q=&c;
int *r=&i;
63. #include<stdio.h> p=q;
printf("%c",*(char *)p);
int main(){ p=r;
printf("%d",*(int*)p);
int near* near * ptr;
printf(“%d”,sizeof(ptr),sizeof(*ptr)); return 0;
}
68. #include<stdio.h>
return 0; #include <malloc.h>
int main(){
} void *ptr;
64. #include<stdio.h> printf("%d",*ptr);
int main(){
return 0;
int a=12; }
printf(“%d”,*(a++)+i));
}
69.#include <string.h>
#include<stdio.h> 74.
int main(){
void *ptr;
printf("%d",sizeof(ptr));
return 0;
}
70. main()
{ char *p="hai friends",*p1;
p1=p;
while(*p!='\0') ++*p++;
printf("%s %s",p,p1);
}
int fn(void)
{
return (i-=5);
}
73. main()
{
void pa(int *a,int n)
it arr[5]={1,2,3,4,5};
pa(arr,5);
}