Top 550+ Solved Computer Graphics MCQ Questions Answer
Q. What are the types of polygon___________.
a. convex polygon
b. concave polygon
c. both a & b
d. none of these
Q. In which polygon object appears only partially________________.
a. convex polygon
b. concave polygon
c. both a & b
d. none
Q. The rectangle space in which the world definition of region is displayed are called_______________.
a. screen coordinate system
b. clipping window or world window
c. world coordinate system
d. none of these
Q. The process of cutting off the line which are outside the window are called__________.
a. shear
b. reflection
c. clipping
d. clipping window
Q. The process of coloring the area of a polygon is called___________.
a. polygon filling
b. polygon flow
c. aliasing
d. none of these
Q. The algorithm used for filling the interior of a polygon is called____________.
a. flood fill algorithm
b. boundary fill algorithm
c. scan line polygon fill algorithm
d. none of these
Q. If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.
a. flood fill algorithm
b. boundary fill algorithm
c. scan line polygon filling algorithm
d. none of these
Q. The process of mapping a world window in world coordinate system to viewport are called___________.
a. transformation viewing
b. view port
c. clipping window
d. screen coordinate system
Q. Some common form of clipping include__________.
a. curve clipping
b. point clipping
c. polygon clipping
d. all of these
Q. An object can be viewed as a collection of___________.
a. one segment
b. two segment
c. several segments
d. none of these
Q. Scaling of a polygon is done by computing____________.
a. the product of (x, y) of each vertex
b. (x, y) of end points
c. center coordinates
d. only a
Q. In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.
a. 4-connected
b. 5-connected
c. 6-connected
d. 8-connected
Q. Sutherland Hodgeman algorithm is used for_____________.
a. polygon filling
b. line clipping
c. polygon clipping
d. text clipping
Q. Which of the following is true with respect to Suther Hodge algorithm?
a. it clips only concave polygons
b. it is more time consuming and complex
c. it may insert extra edges in resultant polygon
d. none of these