Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Chapter: 8
Q281:
Which data structure is emptied after all scan-lines are processed?
A. Vertex list
B. Active edge table
C. Global edge table
D. Polygon array
Correct Answer:
B
Chapter: 8
Q282:
Once the last edge is added from the global edge table to the active edge table, the global edge table becomes ______.
A. Sorted
B. Full
C. Empty
D. Updated
Correct Answer:
C
Chapter: 8
Q283:
Which scan-line removes all edges with Y-max = scan-line?
A. 10
B. 15
C. 13
D. 12
Correct Answer:
B
Chapter: 8
Q284:
Which value is used to determine drawing start and end along a scan-line?
A. X
B. Y
C. Parity
D. Slope
Correct Answer:
C
Chapter: 8
Q285:
The purpose of reordering edges in the active edge table is to ______.
A. Reduce memory
B. Increase performance
C. Draw accurately
D. Avoid overlap
Correct Answer:
D
Chapter: 8
Q286:
After processing scan-line = 11, parity is even at x = ______.
A. 23
B. 27
C. 28
D. 10
Correct Answer:
A
Chapter: 8
Q287:
Which scan-line introduces the need to reorder edges due to x values?
A. 11
B. 12
C. 13
D. 14
Correct Answer:
C
Chapter: 8
Q288:
The x value for index 0 always starts at ______ in each scan-line.
A. 20
B. 16
C. 10
Correct Answer:
C
Chapter: 8
Q289:
During scan-line = 15, which edges are removed due to max Y = scan-line?
A. 0, 2, 3
B. 1, 2, 3
C. 1, 3, 4
D. 2, 3, 4
Correct Answer:
A
Chapter: 8
Q290:
What does the edge table look like after reordering at scan-line = 16?
A. Sorted by slope
B. Sorted by x value
C. Sorted by y-max
D. Sorted by y-min
Correct Answer:
B
Chapter: 8
Q291:
The filling operation on scan-line = 10 ends at x = ______.
A. 22
B. 27
C. 28
D. 23
Correct Answer:
A
Chapter: 9
Q292:
What is the main purpose of a boundary-fill algorithm?
A. To draw lines
B. To fill an area from the outside
C. To fill an area from the inside outward
D. To draw shapes
Correct Answer:
C
Chapter: 9
Q293:
What input is required for the boundary-fill algorithm?
A. Only boundary color
B. Starting point, fill color, and boundary color
C. Only fill color
D. Only starting point
Correct Answer:
B
Chapter: 9
Q294:
Which method fills the area by replacing connected pixels of a selected color?
A. Boundary fill
B. Paint fill
C. Flood fill
D. Edge fill
Correct Answer:
C
Chapter: 9
Q295:
The boundary fill algorithm works by checking which of the following conditions first?
A. Pixel shape
B. Boundary color and fill color
C. Pixel intensity
D. Pixel depth
Correct Answer:
B
Chapter: 9
Q296:
Which of the following is a recursive algorithm?
A. Paint brush tool
B. Boundary-fill
C. Image smoothing
D. Line drawing
Correct Answer:
B
Chapter: 9
Q297:
In boundary-fill, how many directions are typically checked for neighbors?
A. Two
B. Three
C. Four
D. Eight
Correct Answer:
C
Chapter: 9
Q298:
The flood fill algorithm requires which of the following parameters?
A. x, y, fillColor, oldColor
B. x, y, boundaryColor
C. fillColor, x, y
D. x, y, width
Correct Answer:
A
Chapter: 9
Q299:
In flood-fill, which color must be known before the algorithm starts?
A. Fill color
B. New color
C. Old color
D. Background color
Correct Answer:
C
Chapter: 9
Q300:
Boundary-fill fails when ______.
A. fill color and boundary color are the same
B. boundary is circular
C. image is too large
D. fill color is bright
Correct Answer:
A