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 |
main() { char *p = "hello world"; p[0] = 'H'; printf("%s", p); } a. Runtime error. b. “Hello world” c. Compile error d. “hello world”
main() { if (!(1&&0)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above
Write a procedure to implement highlight as a blinking operation
void main() { int i=5; printf("%d",i++ + ++i); }
Write a program to check whether the number is prime and also check if it there i n fibonacci series, then return true otherwise return false
main() { char str1[] = {‘s’,’o’,’m’,’e’}; char str2[] = {‘s’,’o’,’m’,’e’,’\0’}; while (strcmp(str1,str2)) printf(“Strings are not equal\n”); }
#define a 10 void foo() { #undef a #define a 50 } int main() { printf("%d..",a); foo(); printf("%d..",a); return 0; } explain the answer
main() { int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); }
#define DIM( array, type) sizeof(array)/sizeof(type) main() { int arr[10]; printf(“The dimension of the array is %d”, DIM(arr, int)); }
main() { clrscr(); } clrscr();
There is a lucky draw held every day. if there is a winning number eg 1876,then all possible numbers like 1867,1687,1768 etc are the numbers that match irrespective of the position of the digit. Thus all these numbers qualify fr the lucky draw prize Assume there is no zero digit in any numbers. write a program to show all the possible winning numbers if a "winning number"is passed as an arguments to the function.
main() { printf("\nab"); printf("\bsi"); printf("\rha"); }