MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Graphics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines? |
| A. | 40% |
| B. | 50% |
| C. | 70% |
| D. | 36% |
| Answer» E. | |
| 2. |
How many inequalities are solved in this algorithm? |
| A. | 3 |
| B. | 2 |
| C. | 1 |
| D. | 4 |
| Answer» E. | |
| 3. |
When pk < 0, then the line is ___________ |
| A. | parallel to the boundaries |
| B. | exceeding the boundaries |
| C. | bounded inside the boundaries |
| D. | can’t say |
| Answer» C. bounded inside the boundaries | |
| 4. |
When the line is parallel to the boundaries then what is the value of pk? |
| A. | pk < 0 |
| B. | pk > 0 |
| C. | pk = 0 |
| D. | pk = 1 |
| Answer» D. pk = 1 | |
| 5. |
Liang–Barsky algorithm is a __________ clipping algorithm. |
| A. | circle |
| B. | text |
| C. | line |
| D. | pixel |
| Answer» D. pixel | |
| 6. |
HOW_MANY_INEQUALITIES_ARE_SOLVED_IN_THIS_ALGORITHM??$ |
| A. | 3 |
| B. | 2 |
| C. | 1 |
| D. | 4 |
| Answer» E. | |
| 7. |
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?$ |
| A. | 40% |
| B. | 50% |
| C. | 70% |
| D. | 36% |
| Answer» E. | |
| 8. |
When pk < 0, then the line is __________? |
| A. | parallel to the boundaries |
| B. | exceeding the boundaries |
| C. | bounded inside the boundaries |
| D. | can’t say |
| Answer» C. bounded inside the boundaries | |
| 9. |
Which type of arithmetic is used in Liang Barsky algorithm? |
| A. | simple arithmetic operations |
| B. | floating point arithmetic |
| C. | fixed point arithmetic |
| D. | logarithmic operations |
| Answer» C. fixed point arithmetic | |
| 10. |
When the line is parallel to the boundaries then what is the value of pk? |
| A. | p<sub>k</sub> < 0 |
| B. | p<sub>k</sub> > 0 |
| C. | p<sub>k</sub> = 0 |
| D. | p<sub>k</sub> = 1 |
| Answer» D. p<sub>k</sub> = 1 | |
| 11. |
The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 12. |
This algorithm uses the ____________ equations for a line and solves four inequalities. |
| A. | linear |
| B. | quadratic |
| C. | cubic |
| D. | parametric |
| Answer» E. | |
| 13. |
Liang Barsky algorithm can be used to clip 3-D lines. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
The ideas of the Liang-Barsky algorithm are the same with which algorithm? |
| A. | Cyrus Beck algorithm |
| B. | Liam-Chopsky algorithm |
| C. | Cohen Sutherland algorithm |
| D. | All have the same |
| Answer» B. Liam-Chopsky algorithm | |
| 15. |
Liang–Barsky algorithm is a __________ clipping algorithm. |
| A. | circle |
| B. | text |
| C. | line |
| D. | pixel |
| Answer» D. pixel | |