MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Graphics Questions & Answers Nicholl-Lee-Nicholl Line Clipping knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The division of area is affected by the position of endpoints. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
What is the denotation of a ray if it intersects the top and right boundary? |
| A. | RT |
| B. | TR |
| C. | LR |
| D. | LT |
| Answer» C. LR | |
| 3. |
What is the denotation of a ray if it intersects the top boundary? |
| A. | L |
| B. | T |
| C. | P |
| D. | B |
| Answer» C. P | |
| 4. |
These areas are given names depending on the location of ___________________ |
| A. | endpoints |
| B. | initial points |
| C. | intermediate points |
| D. | intersection points |
| Answer» C. intermediate points | |
| 5. |
In how many areas the initial point should be present? |
| A. | 3 |
| B. | 5 |
| C. | 2 |
| D. | 8 |
| Answer» B. 5 | |
| 6. |
The area around the clipping window is divided into a number of different ______________ |
| A. | pixels |
| B. | squares |
| C. | areas |
| D. | lines |
| Answer» D. lines | |
| 7. |
A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm. |
| A. | True |
| B. | False |
| Answer» C. | |
| 8. |
What is full form of NLN line clipping algorithm? |
| A. | Nicholl-Liang-Nicholl algorithm |
| B. | Nicholai-Liang-Nicholl algorithm |
| C. | Nicholai-Lee-Nicholl algorithm |
| D. | Nicholl-Lee-Nicholl algorithm |
| Answer» E. | |
| 9. |
Liang-Barsky clipping algorithm computes _______ number of intersections than NLN line clipping. |
| A. | more |
| B. | less |
| C. | same |
| D. | can t be predicted |
| Answer» B. less | |
| 10. |
Cohen Sutherland clipping algorithm computes _______ number of intersections than NLN line clipping. |
| A. | more |
| B. | less |
| C. | same |
| D. | can t be predicted |
| Answer» B. less | |