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() { int *j; { int i=10; j=&i; } printf("%d",*j); }
Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal.
6 Answers Fusion Systems GmbH,
void main() { if(~0 == (unsigned int)-1) printf(“You can answer this if you know how values are represented in memory”); }
char *someFun() { char *temp = “string constant"; return temp; } int main() { puts(someFun()); }
void main() { int i=5; printf("%d",i++ + ++i); }
void pascal f(int i,int j,int k) { printf(“%d %d %d”,i, j, k); } void cdecl f(int i,int j,int k) { printf(“%d %d %d”,i, j, k); } main() { int i=10; f(i++,i++,i++); printf(" %d\n",i); i=10; f(i++,i++,i++); printf(" %d",i); }
main() { int a=10,*j; void *k; j=k=&a; j++; k++; printf("\n %u %u ",j,k); }
What is "far" and "near" pointers in "c"...?
What is your nationality?
main( ) { int a[2][3][2] = {{{2,4},{7,8},{3,4}},{{2,2},{2,3},{3,4}}}; printf(“%u %u %u %d \n”,a,*a,**a,***a); printf(“%u %u %u %d \n”,a+1,*a+1,**a+1,***a+1); }
What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql
/*what is the output for*/ void main() { int r; printf("Naveen"); r=printf(); getch(); }