Top 550+ Solved Computer Graphics MCQ Questions Answer
Q. Which one is not valid out code to perform trivial accept / reject test in line clipping
a. 1101
b. 11
c. 101
d. 10
Q. Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?
a. need to perform trivial accept / reject test on end points of the line.
b. need to perform trivial accept / reject test for every point on the line.
c. cannot say
d. none of these
Q. If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle
a. xmin > x < xmax and ymin > y < ymax
b. xmin > x > xmax and ymin > y > ymax
c. xmin < x < xmax and ymin < y < ymax
d. xmin < x > xmax and ymin < y > ymax
Q. determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying the rules
a. p1:clipped away, p2: clipped away, p3:clipped away
b. p1: visible, p2:visible, p3:clipped away
c. p1: visible, p2:visible, p3: visible
d. p1: clipped away, p2:visible, p3:clipped away
Q. Is 0011 valid region code / outcode used in Line Clipping algorithm?
a. yes
b. no
c. cannot say
d. none of these
Q. Primitive types of clipping algorithms are
a. point clipping
b. line clipping
c. polygon clipping
d. all of above
Q. In ________ operation eliminates objects or portions of objects that are not visible through the window to ensure the proper construction of corresponding image
a. clipping
b. windowing
c. viewing
d. transformation
Q. The region against which an object is clipped is called as ____________
a. clip window
b. clip rectangle
c. window
d. none of these
Q. Cohen – Sutherland Line Clipping Algorithm is also called as ____________________
a. sutherland - hodgman algorithm
b. cohen - sutherland outcode algorithm
c. cyrus - beck algorithm
d. none of above
Q. The Most Significant Bit of the region code of a point (X,Y) is '1' if ......................
a. y >ywmin
b. y< ywmin
c. y< ywmax
d. y>ywmax
Q. The bottom bit of the region code of a point is '0' if .......................
a. y >ywmin
b. y< ywmin
c. y< ywmax
d. y>ywmax
Q. The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part (viewport) is visible.
a. cohen-sutherland
b. liang barsky
c. sutherland hodegeman
d. none of these