Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Multiple Choice Questions
Q501: Sutherland-Hodgeman algorithm uses which strategy?
- A: Divide and Conquer
- B: Merge Sort
- C: Brute Force
- D: Greedy
View Answer
A
Q502: How does the Sutherland-Hodgeman algorithm clip a polygon?
- A: Clip against all edges at once
- B: Clip sequentially against each boundary
- C: Randomly clip boundaries
- D: Skip clipping
View Answer
B
Q503: In the Sutherland-Hodgeman method, how many clip edges are typically considered for a rectangle?
- A: Two
- B: Three
- C: Four
- D: Five
View Answer
C
Q504: Case 1 in polygon clipping (vertex i to vertex i+1) indicates:
- A: Both vertices inside
- B: First inside, second outside
- C: Both outside
- D: First outside, second inside
View Answer
A
Q505: In which case during clipping is the intersection point saved and the endpoint saved?
- A: Case 2
- B: Case 3
- C: Case 4
- D: Case 1
View Answer
C
Q506: When both vertices are outside the visible region, what action is taken?
- A: Save both points
- B: Save one point
- C: Save intersection only
- D: Save nothing
View Answer
D
Q507: The Weiler-Atherton algorithm modifies vertex-processing to correctly display ______ polygons.
- A: convex
- B: concave
- C: spherical
- D: cylindrical
View Answer
B
Q508: In Sutherland-Hodgeman, after clipping against one edge, the ______ vertices are saved for next stage.
- A: removed
- B: modified
- C: kept
- D: new
View Answer
C
Q509: If both vertices are inside during clipping, output is:
- A: Both points
- B: Only intersection
- C: Only endpoint
- D: Only first point
View Answer
C
Q510: Weiler-Atherton algorithm is particularly useful for handling polygons with _______.
- A: small size
- B: large color variations
- C: holes and concavities
- D: straight lines
View Answer
C