Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Multiple Choice Questions
Q851: What is the purpose of clipping in graphics?
- A: To limit the effect of graphics to a specific region
- B: To enhance image quality
- C: To apply filters to images
- D: To change the color palette
View Answer
A
Q852: Which of the following is a method for point clipping?
- A: Line clipping
- B: Point clipping
- C: Polygon clipping
- D: Image clipping
View Answer
B
Q853: The default clipping rectangle is the _______.
- A: Full canvas
- B: Clipping rectangle
- C: Screen window
- D: Clipping polygon
View Answer
A
Q854: The Cohen-Sutherland algorithm is efficient when out-code testing can be done _______.
- A: Cheaply
- B: Slowly
- C: Using complex calculations
- D: Through bit-wise operations
View Answer
A
Q855: The Liang-Barsky algorithm is more efficient than the Cohen-Sutherland algorithm because _______.
- A: It reduces the number of intersection calculations
- B: It uses more divisions
- C: It clips more polygons
- D: It is slower
View Answer
A
Q856: Polygon clipping for unfilled polygons can be done using _______ techniques.
- A: Line-clipping
- B: Polygon-clipping
- C: Bit-mapping
- D: Transformational
View Answer
B
Q857: The Sutherland-Hodgeman algorithm clips a polygon by testing against _______ edges.
- A: Two
- B: Three
- C: Four
- D: Five
View Answer
C
Q858: Which algorithm is used to clip polygons with holes?
- A: Weiler-Atherton algorithm
- B: Sutherland-Hodgeman algorithm
- C: Polygon-clipping algorithm
- D: Line-clipping algorithm
View Answer
A
Q859: In the Sutherland-Hodgman algorithm, the vertices after clipping against one edge are saved for clipping against _______ edges.
- A: Remaining
- B: Adjacent
- C: Opposite
- D: Topmost
View Answer
A
Q860: The limitation of the Sutherland-Hodgman algorithm is that it cannot handle _______ polygons.
- A: Concave
- B: Convex
- C: Circular
- D: Irregular
View Answer
A