Extend the sutherland-hodgman clipping algorithm to clip
three-dimensional planes against a regular paralleiepiped
Answer / santhosh
A. Extend the sutherland-hodgman clipping algorithm to clip
three-dimensional planes against a regular paralleiepiped.
| Is This Answer Correct ? | 6 Yes | 8 No |
All the combinations of prime numbers whose sum gives 32
main() { char a[4]="HELLO"; printf("%s",a); }
Write a program to model an exploding firecracker in the xy plane using a particle system
main() { int c[ ]={2.8,3.4,4,6.7,5}; int j,*p=c,*q=c; for(j=0;j<5;j++) { printf(" %d ",*c); ++q; } for(j=0;j<5;j++){ printf(" %d ",*p); ++p; } }
#define clrscr() 100 main() { clrscr(); printf("%d\n",clrscr()); }
Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution)
what is the code of the output of print the 10 fibonacci number series
what is brs test reply me email me kashifabbas514@gmail.com
main() { int i; clrscr(); for(i=0;i<5;i++) { printf("%d\n", 1L << i); } } a. 5, 4, 3, 2, 1 b. 0, 1, 2, 3, 4 c. 0, 1, 2, 4, 8 d. 1, 2, 4, 8, 16
main() { char *p = “ayqm”; printf(“%c”,++*(p++)); }
29 Answers IBM, TCS, UGC NET, Wipro,
code of a program in c language that ask a number and print its decremented and incremented number.. sample output: input number : 3 321123
Can you send Code for Run Length Encoding Of BMP Image in C Language in linux(i.e Compression and Decompression) ?