Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Chapter: 14
Q481:
In Liang-Barsky, if p < 0, the line proceeds from _______.
A. Inside to outside
B. Outside to inside
C. Bottom to top
D. Top to bottom
Correct Answer:
B
Chapter: 14
Q482:
In Liang-Barsky, the clipping decision depends on values of _______.
A. p and q
B. x and y
C. a and b
D. u and v
Correct Answer:
A
Chapter: 14
Q483:
Liang-Barsky algorithm uses initial values of ______.
A. u1 = 1, u2 = 0
B. u1 = 0, u2 = 1
C. u1 = 0.5, u2 = 1.5
D. u1 = -1, u2 = 1
Correct Answer:
B
Chapter: 14
Q484:
In Liang-Barsky, if u1 > u2 after calculations, the line is _______.
A. Accepted
B. Rejected
C. Extended
D. Animated
Correct Answer:
B
Chapter: 14
Q485:
A line completely inside the clip rectangle is _______.
A. Trivially rejected
B. Trivially accepted
C. Divided
D. Ignored
Correct Answer:
B
Chapter: 14
Q486:
Which is NOT a step in Cohen-Sutherland algorithm?
A. Check for trivial accept/reject
B. Divide line into segments if needed
C. Always redraw the entire canvas
D. Clip iteratively until fully inside
Correct Answer:
C
Chapter: 14
Q487:
The Cohen-Sutherland algorithm divides the plane into ______ regions.
A. 4
B. 9
C. 5
D. 7
Correct Answer:
B
Chapter: 14
Q488:
In Cohen-Sutherland algorithm, if outcodes of two endpoints ANDed result in nonzero, line is _______.
A. Completely inside
B. Completely outside
C. Partially inside
D. Partially outside
Correct Answer:
B
Chapter: 14
Q489:
The Liang-Barsky algorithm calculates intersections using _______.
A. u = q/p
B. u = p/q
C. u = x+y
D. u = x1+x2
Correct Answer:
A
Chapter: 14
Q490:
In Liang-Barsky, p1 is defined as _______.
A. -Δy
B. Δx
C. -Δx
D. Δy
Correct Answer:
C
Chapter: 14
Q491:
In Liang-Barsky, if pk = 0 and qk ≥ 0, the line is ______.
A. Rejected
B. Accepted
C. Parallel and inside
D. Parallel and outside
Correct Answer:
C
Chapter: 14
Q492:
Clipping individual points is _______ than clipping lines.
A. More complex
B. Easier
C. More expensive
D. Slower
Correct Answer:
B
Chapter: 14
Q493:
In clipping, the term "interior" refers to points lying _______.
A. Inside the clip rectangle
B. Outside the clip rectangle
C. On the canvas border
D. Outside screen boundary
Correct Answer:
A
Chapter: 14
Q494:
The intersection points G' and H' in the example are ______.
A. Exterior
B. Interior
C. Undefined
D. Parallel
Correct Answer:
B
Chapter: 14
Q495:
Which algorithm divides a line if trivial accept/reject tests fail?
A. Liang-Barsky
B. Cohen-Sutherland
C. DDA
D. Bresenham's
Correct Answer:
B
Chapter: 15
Q496:
What is the main purpose of polygon clipping?
A. To shrink polygons
B. To simplify colors
C. To manage visibility within a region
D. To animate shapes
Correct Answer:
C
Chapter: 15
Q497:
The Sutherland-Hodgeman algorithm clips a polygon against a ________ clip polygon.
A. concave
B. convex
C. circular
D. spiral
Correct Answer:
B
Chapter: 15
Q498:
Which polygon clipping algorithm can handle polygons with holes?
A. Bresenham algorithm
B. Sutherland-Hodgeman algorithm
C. Weiler-Atherton algorithm
D. Cohen-Sutherland algorithm
Correct Answer:
C
Chapter: 15
Q499:
In polygon clipping, each polygon edge must be tested against _______.
A. one edge only
B. each edge of the clip rectangle
C. diagonal edges only
D. no edge
Correct Answer:
B
Chapter: 15
Q500:
In polygon clipping, a concave polygon may be clipped into ______.
A. one polygon
B. two or more polygons
C. no polygons
D. a line
Correct Answer:
B