Given a spherical surface, write bump-mapping procedure to
generate the bumpy surface of an orange
main() { int i=10; i=!i>14; Printf ("i=%d",i); }
main() { int i=10,j=20; j = i, j?(i,j)?i:j:j; printf("%d %d",i,j); }
Display the time of the system and display the right time of the other country
main(){ unsigned int i; for(i=1;i>-2;i--) printf("c aptitude"); }
main() { char *p = “ayqm”; printf(“%c”,++*(p++)); }
29 Answers IBM, TCS, UGC NET, Wipro,
void main() { int i=i++,j=j++,k=k++; printf(“%d%d%d”,i,j,k); }
main() { char *p; int *q; long *r; p=q=r=0; p++; q++; r++; printf("%p...%p...%p",p,q,r); }
Print an integer using only putchar. Try doing it without using extra storage.
Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines
Which one is taking more time and why ? :/home/amaresh/Testing# cat time.c //#include <stdio.h> #define EOF -1 int main() { register int c; while ((c = getchar()) != EOF) { putchar(c); } return 0; } ------------------- WIth stdio.h:- :/home/amaresh/Testing# time ./time_header hi hi hru? hru? real 0 m4.202s user 0 m0.000s sys 0 m0.004s ------------------ Witout stdio.h and with #define EOF -1 =================== /home/amaresh/Testing# time ./time_EOF hi hi hru? hru? real 0 m4.805s user 0 m0.004s sys 0 m0.004s -- From above two case , why 2nd case is taking more time ?
main() { show(); } void show() { printf("I'm the greatest"); }
void main() { int k=ret(sizeof(float)); printf("\n here value is %d",++k); } int ret(int ret) { ret += 2.5; return(ret); }