Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Multiple Choice Questions
Q241: What additional data is needed for each edge in scan-line fill?
- A: Color, gradient
- B: X, y, fill style
- C: Y-min, Y-max, X at Y-min, 1/m slope
- D: Z-index, coordinates
View Answer
C
Q242: Which structure holds all polygon edges for processing?
- A: Color buffer
- B: Global edge table
- C: Pixel array
- D: Vertex list
View Answer
B
Q243: What sorting criteria is used in the global edge table?
- A: X-coordinate only
- B: Y-coordinate only
- C: Min Y and min X values
- D: Area and length
View Answer
C
Q244: Which formula calculates the slope of a line for scan-line fill?
- A: m = (x1-x0)/(y1-y0)
- B: m = (y0-y1)/(x0-x1)
- C: m = (x0-x1)/(y0-y1)
- D: m = x+y
View Answer
B
Q245: The scan-line algorithm works for which polygon types?
- A: Only convex
- B: Convex and concave
- C: Only concave
- D: All types of polygons
View Answer
D
Q246: Odd parity means we are ______.
- A: outside polygon
- B: inside polygon
- C: on the edge
- D: in a hole
View Answer
B
Q247: What does "flood-fill" method assume?
- A: There is a defined boundary
- B: Point lies on edge
- C: Start from outside
- D: Cluster has no clear boundary
View Answer
D
Q248: In polygon filling, parity changes every time we ______.
- A: start scan line
- B: draw a vertex
- C: cross an edge
- D: move diagonally
View Answer
C
Q249: The main difference between convex and concave polygon is in ______.
- A: edge length
- B: number of sides
- C: interior angle
- D: rule of intersection with internal lines
View Answer
D
Q250: The polygon filling algorithm avoids checking each point by using ______.
- A: recursion
- B: hardware acceleration
- C: sorted x-intersections
- D: slope shifting
View Answer
C