Top 550+ Solved Computer Graphics MCQ Questions Answer
Q. Generalised clipping algorithm deals with clipping against _____ line.
a. only horizontal
b. only veritical
c. arbitrary
d. both horizontal & vertical
Q. What will be the output set after clipping left and clipping right?
a. 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’
b. 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
c. 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
d. 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’
Q. What will be the input set for clipping left and clipping right respectively?
a. 1 2 3 4 6 7 8 9 10 11 and 1’ 2 3 4 6 7 8 9 10 11 11’
b. 1 2 3 4 6 7 8 9 10 11 and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’
c. 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
d. 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
Q. In 8 connected region if one pixel is (x,y) then remaining neighboring pixels
a. (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
b. (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
c. (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
d. (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)
Q. What will be input set to clipping top and clipping bottom respectively?
a. 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2
b. 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
c. 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
d. 1 1’ 2 3 4 6 7 8 9 10 11 11’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2
Q. What will be clipped polygon vertices?
a. 4’ 4 ‘5’ 6’ 7 7’ 8’ 9 9’ 10’ 11 11’ 1’ 2 3’
b. 1’2 3’ 4’4 5’6’ 7 7’8’ 9’ 10’ 11 11’
c. both a and b
d. neither a or b
Q. What will be the input set for clipping right and for clipping top respectively?
a. 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’
b. 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’
c. 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
d. 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’
Q. Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). Whether a point at (5,50) is visible or not?
a. visible
b. partially visible
c. completely exterior
d. none of the above
Q. Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). Whether a point at (75,90) is visible or not?
a. visible
b. partially visible
c. completely exterior
d. none of the above
Q. Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). A line has end coordinates as (50,5) and (150,50). What will be the outcodes associated with line segment?
a. 01 , 0010
b. 0001, 0000
c. 0000, 0010
d. 0010, 0110
Q. Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right Corner (1,1). A line has end coordinates as (50,5) and (150,50). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
a. completely visible
b. partially visible
c. completely invisible
d. none of above
Q. Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). A line has end coordinates as (5,50) and (75,90). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
a. completely visible
b. partially visible
c. completely invisible
d. none of above
Q. Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). A line has end coordinates as (25,50) and (175,190). The given line segment is ___________. Use Cohen – Sutherland Outcode Algorithm.
a. completely visible
b. partially visible
c. completely invisible
d. none of above
Q. A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates (40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
a. (23.67,50) and (69.06,40)
b. (50,23.67) and (69.06, 40)
c. (50,23.67) and (40,69.06)
d. none of above