Top 550+ Solved Computer Graphics MCQ Questions Answer
Q. Sutherland Hodgeman algorithm works well for...........
a. concave polygons
b. convex polygons
c. smooth curves
d. line segments
Q. A line with endpoints codes as 0000 and 01 is ?
a. partially invisible
b. completely visible
c. completely invisible
d. trivially invisible
Q. In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the ?
a. codes of the end point are same
b. logical or of the end points code is 0000
c. logical and of the end point code is 0000
d. only a
Q. Sutherland – Hodgman algorithm is used for _______________.
a. line clipping
b. polygon clipping
c. point clipping
d. hybrid clipping
Q. Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?
a. cohen-sutherland
b. sutherland hodgman
c. both a and b
d. neither a or b
Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
a. store interaction point of line ps (s’) only
b. store point p and s’
c. store point p only
d. store points s and s’
Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
a. store interaction point of line ps (s’) only
b. store point p and s’
c. store point p only
d. store nothing
Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
a. store interaction point of line ps (s’) only
b. store point p and s’
c. store point p only
d. store points s and s’
Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
a. store interaction point of line ps (s’) only
b. store point p and s’
c. store point p only
d. store points s and s’
Q. In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is used as
a. left -> right -> top -> bottom
b. left -> bottom -> right -> top
c. right -> top -> left -> bottom
d. left -> bottom -> top -> right
Q. Polygon-Clipping algorithms include the:
a. sutherland-hodgeman method
b. liang-barsky method
c. weiler-atherton method
d. all of above
Q. _______ is a ordered list of vertices where each vertex connected with the next in the list.
a. line
b. polygon
c. parabola
d. none of the above
Q. In convex Polygon all interior angles are
a. less than 90
b. less than 180
c. greater than 180
d. greater than 90