Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Chapter: 8
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
Correct Answer:
C
Chapter: 8
Q242:
Which structure holds all polygon edges for processing?
A. Color buffer
B. Global edge table
C. Pixel array
D. Vertex list
Correct Answer:
B
Chapter: 8
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
Correct Answer:
C
Chapter: 8
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
Correct Answer:
B
Chapter: 8
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
Correct Answer:
D
Chapter: 8
Q246:
Odd parity means we are ______.
A. outside polygon
B. inside polygon
C. on the edge
D. in a hole
Correct Answer:
B
Chapter: 8
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
Correct Answer:
D
Chapter: 8
Q248:
In polygon filling, parity changes every time we ______.
A. start scan line
B. draw a vertex
C. cross an edge
D. move diagonally
Correct Answer:
C
Chapter: 8
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
Correct Answer:
D
Chapter: 8
Q250:
The polygon filling algorithm avoids checking each point by using ______.
A. recursion
B. hardware acceleration
C. sorted x-intersections
D. slope shifting
Correct Answer:
C
Chapter: 8
Q251:
The slope of a line where y1=10, y0=16, x1=10, x0=16 is ______.
A. 1.2
B. 1
C. 1.5
D. 0.5
Correct Answer:
C
Chapter: 8
Q252:
Which of the following describes a boundary-fill method?
A. Lines drawn between edges
B. Painting starts from edge
C. Paint outward from inside
D. Start from all edges at once
Correct Answer:
C
Chapter: 8
Q253:
Which algorithm is most appropriate for complex polygon filling?
A. Boundary-fill
B. Vertex-based
C. Scan-line algorithm
D. Point scanning
Correct Answer:
C
Chapter: 8
Q254:
The starting parity for each scan-line in scan-line fill is ______.
A. Even
B. Odd
C. Random
D. None
Correct Answer:
A
Chapter: 8
Q255:
Which of these polygon types might cause difficulty in filling due to self-intersections?
A. Convex
B. Concave
C. Complex
D. Circular
Correct Answer:
C
Chapter: 8
Q256:
Polygons that cross themselves are known as ______ polygons.
A. Concave
B. Complex
C. Convex
D. Open
Correct Answer:
B
Chapter: 8
Q257:
Flood-fill and boundary-fill algorithms both start filling from ______.
A. edge
B. vertex
C. inward point
D. upper left corner
Correct Answer:
C
Chapter: 8
Q258:
Scan-line polygon fill method is based on ______ algorithm.
A. Even-odd rule
B. Nearest neighbor
C. Recursion
D. Paint bucket
Correct Answer:
A
Chapter: 8
Q259:
Filled-area primitives help transform sketches into ______.
A. Digital curves
B. Outline images
C. Solid models
D. Pixel masks
Correct Answer:
C
Chapter: 8
Q260:
The polygon filling example in the lecture uses which method?
A. Boundary-fill
B. Recursive
C. Scan-line
D. Pattern fill
Correct Answer:
C