Skip to main content

Computer Graphics MCQs with Answers

Practice important Computer Graphics MCQs with answers and explanations.

Multiple Choice Questions

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
View Answer
C

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
View Answer
C

Q253: Which algorithm is most appropriate for complex polygon filling?
  • A: Boundary-fill
  • B: Vertex-based
  • C: Scan-line algorithm
  • D: Point scanning
View Answer
C

Q254: The starting parity for each scan-line in scan-line fill is ______.
  • A: Even
  • B: Odd
  • C: Random
  • D: None
View Answer
A

Q255: Which of these polygon types might cause difficulty in filling due to self-intersections?
  • A: Convex
  • B: Concave
  • C: Complex
  • D: Circular
View Answer
C

Q256: Polygons that cross themselves are known as ______ polygons.
  • A: Concave
  • B: Complex
  • C: Convex
  • D: Open
View Answer
B

Q257: Flood-fill and boundary-fill algorithms both start filling from ______.
  • A: edge
  • B: vertex
  • C: inward point
  • D: upper left corner
View Answer
C

Q258: Scan-line polygon fill method is based on ______ algorithm.
  • A: Even-odd rule
  • B: Nearest neighbor
  • C: Recursion
  • D: Paint bucket
View Answer
A

Q259: Filled-area primitives help transform sketches into ______.
  • A: Digital curves
  • B: Outline images
  • C: Solid models
  • D: Pixel masks
View Answer
C

Q260: The polygon filling example in the lecture uses which method?
  • A: Boundary-fill
  • B: Recursive
  • C: Scan-line
  • D: Pattern fill
View Answer
C

Test Your Knowledge

Take a timed quiz on Computer Graphics

🚀 Start Quiz Now