MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
One of the drawbacks of Sutherland- Hodgeman algorithm is that it can t produce ____________ areas. |
| A. | connected |
| B. | multiple |
| C. | discrete |
| D. | circular |
| Answer» B. multiple | |
| 2. |
In a convex polygon, each of the interior angles is less than ____degrees. |
| A. | 90 |
| B. | 180 |
| C. | 360 |
| D. | 45 |
| Answer» C. 360 | |
| 3. |
If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have coincident edges. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the ___________ edge. |
| A. | left edge |
| B. | right edge |
| C. | top edge |
| D. | bottom edge |
| Answer» E. | |
| 5. |
Sutherland-Hodgeman clipping is an example of_________________ algorithm. |
| A. | line clipping |
| B. | polygon clipping |
| C. | text clipping |
| D. | curve clipping |
| Answer» C. text clipping | |