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 |
Extend the sutherland-hodgman clipping algorithm to clip three-dimensional planes against a regular paralleiepiped
main() { unsigned char i=0; for(;i>=0;i++) ; printf("%d\n",i); }
Write, efficient code for extracting unique elements from a sorted list of array. e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 9).
13 Answers Intel, Microsoft, TCS,
void main() { int *i = 0x400; // i points to the address 400 *i = 0; // set the value of memory location pointed by i; }
main() { extern i; printf("%d\n",i); { int i=20; printf("%d\n",i); } }
To Write a C program to remove the repeated characters in the entered expression or in entered characters(i.e) removing duplicates. String contains only lowercase characters ['a'-'z']
Is the following code legal? typedef struct a aType; struct a { int x; aType *b; };
What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?
write a program in c to merge two array
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)
main() { int i=400,j=300; printf("%d..%d"); }
You are given any character string. Find the number of sets of vowels that come in the order of aeiou in the given string. For eg., let the given string be DIPLOMATIC. The answer returned must be "The number of sets is 2" and "The sets are "IO and AI". Vowels that form a singleton set must be neglected. Try to post the program executable in gcc or g++ or in java.