Top 550+ Solved Computer Graphics MCQ Questions Answer
Q. In 4 connected region if one pixel is (x,y) then remaining neighboring pixels are
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)
Q. ‘Scan-line coherence ‘ means
a. if a pixel on a scan line lies within a polygon, pixels near it will most likely lie within the polygon
b. if edge of the polygon intersects a given polygon , pixels near it will most likely lie within the polygon
c. if a pixel on a edge lies within a polygon, pixels near it will most likely lie within the polygon
d. none of above
Q. The function of scan line polygon fill algorithm are
a. find intersection point of the boundary of polygon and scan line
b. find intersection point of the boundary of polygon and point
c. both a & b
d. none of these
Q. In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1) can be calculated as: ------------Note: Xs is the previous x-intersection.
a. xs+1= xs + m
b. xs+1= xs + 1
c. xs+1= xs + 1/m
d. xs+1= xs + m/2
Q. In scan line algorithm, Let an edge is represented by Formula y = mx + b and for scan_line s value of y = s. What will be the Xs ? Note : Scan line is intersecting with edge at (s,Xs)
a. xs = (s-b)+m
b. xs = (s-b)
c. xs = (s-b)/m
d. xs = (s-b)*m
Q. In winding number method if net winding is --------then point is outside otherwise it is inside.
a. odd
b. two
c. one
d. zero
Q. In winding number method if net winding is zero then point is ---------- otherwise it is inside.
a. outside
b. inside
c. colorful
d. none of above
Q. In winding number method if net winding is non-zero then point is --------.
a. outside
b. inside
c. colorful
d. none of above
Q. what will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm
a. (p0,p1,p2,p3)
b. (p0,p1, p1,p2,p3)
c. (p0,p1,p2,p3, p3)
d. (p0, p3)
Q. What will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm.
a. (p0 ,p0,p1,p1,p2)
b. (p0,p1,p2)
c. (p0,p2)
d. (p0,p1,p1,p2)
Q. In 4 connected region if one pixel is (2,3) then remaining neighboring pixels are
a. (3, 3 ) (1,3) (2,4) (2,2) (1,2) (1, 4) (3,2) (3, 4)
b. (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)
c. (3, 3 ) (1,2) (2,3) (2,2)
d. (3, 3 ) (1,3) (2,4) (2,2)
Q. In 8 connected region if one pixel is (3,2) then remaining neighboring pixels are
a. (2, 2 ) (4,2) (3,3) (3,1) (4,3) (4,1) (2,3) (2, 1)
b. (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)
c. (3, 3 ) (1,2) (2,3) (2,2)
d. (2, 2 ) (4,2) (3,3) (3,1)
Q. In 8 connected region if one pixel is (2,3) then remaining neighboring pixels are
a. (1, 3 ) (3,3) (2,4) (2,2) (3,4) (3,2) (1,4) (1, 2)
b. (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)
c. (3, 3 ) (1,2) (2,3) (2,2)
d. (2, 2 ) (4,2) (3,3) (3,1)
Q. If one edge of the polygon has end coordinates (10,20) and (15,40) and current scan line is scanning at y=25. What will be the intersection point?
a. (11.2,25)
b. (12,25)
c. (12.2,25)
d. (25,11.2)
Q. In 8 connected region if one pixel is (5,3) then remaining neighboring pixels are
a. (6, 3 ) (4,3) (5,4) (5,2) (6,4) (6,2) (4,4) (4, 2)
b. (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)
c. (3, 3 ) (6,2) (2,3) (2,2)
d. (2, 2 ) (6,2) (6,3) (3,1)