Scribd
Upload
300 views5 pages

Computer Graphics Solved MCQs (Set-2)

The document contains 50 multiple choice questions about computer graphics algorithms like flood fill, boundary fill, scan line fill, and more. Questions ask about which algorithms require certain input parameters like boundary color and coordinates, which properties different algorithms use like scan-line coherence, and which statements are true about algorithms like scan line filling being more efficient than flood fill and working at the pixel level.

Uploaded by

Muhammad Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
300 views5 pages

Computer Graphics Solved MCQs (Set-2)

The document contains 50 multiple choice questions about computer graphics algorithms like flood fill, boundary fill, scan line fill, and more. Questions ask about which algorithms require certain input parameters like boundary color and coordinates, which properties different algorithms use like scan-line coherence, and which statements are true about algorithms like scan line filling being more efficient than flood fill and working at the pixel level.

Uploaded by

Muhammad Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Computer Graphics MCQs [set-2]

26. In --------------algorithm edges can be specified in different color.


A. flood fill
B. boundary fill
C. dda fill
D. bsa fill
Answer: A

27. The process of coloring the area of a polygon is called


A. polygon filling
B. polygon flow
C. aliasing
o m
D. none of these . c
Answer: A
t e
a to the fill function.
q M
28. Boundary fill algorithm uses -------- call
A. recursive
c
B. static
C. one
M
D. none of these
Answer: A

29. Boundary fill algorithm needs–


A. boundary color (bc) and (x,y) coordinates of seed point.
B. fill color (fc) and (x,y) coordinates of seed point.
C. boundary color (bc), fill color (fc) and (x,y) coordinates of seed point.
D. (x,y) coordinates of seed point.
Answer: C

30. Which polygon fill algorithm needs following information - 1.Boundary Color
(BC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed point.
A. boundary fill
B. region fill
C. scan fill
D. dda fill
Answer: A

31. Which polygon fill algorithm needs following information - 1. Region Color
(RC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed point.
A. flood fill
B. region fill
C. scan fill
D. dda fill
Answer: A

32. Horizontal lines are not considered in scan line fill algorithm.
A. true
B. false
Answer: A

33. Scan line fill algorithm is more efficient than flood fill algorithm.
A. true
B. false
Answer: A

34. Which statement is true about the 4 connected region.


A. it is faster than 8 connected region
B. sometimes it leaves region unfilled.
C. both a and b
D. neither a or b
Answer: C

35. 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 and b
D. neither a or b
Answer: A

36. The edge table contains pointers back to the ______________ to identify
vertices for each polygon edge.

Download more sets at McqMate.com


A. vertex table.
B. polygon table.
C. edge table.
D. expanded vertex table.
Answer: A

37. Scan line polygon filling method uses


A. scan-line coherence
B. edge coherence
C. area coherence
D. both a and b
Answer: D

38. Scan-line coherence property is used in


A. line drawing algorithm
B. scan line polygon filling algorithm
C. flood fill polygon filling algorithm
D. none of above
Answer: B

39. Which of the following is true about scan line algorithm?


A. it need a seed pixel
B. it works at pixel level
C. it uses scan lines to fill the polygon
D. all of above
Answer: C

40. In scan line algorithm the intersection points are


A. sorted in ascending order
B. sorted in descending order
C. not sorted
D. deleted
Answer: A

41. Which of the following algorithms to fill polygons was the one used by real
rasterizers?
A. flood-fill polygons

Download more sets at McqMate.com


B. scan-line polygon
C. boundary fill polygons
D. none of above
Answer: B

42. Active edge table is used in following algorithm


A. boundary fill
B. region fill
C. scan line
D. edge fill
Answer: C

43. Scan line polygon filling algorithm uses series of ……………. To fill the
polygon.
A. scan lines
B. points
C. layers
D. none of above
Answer: A

44. In scan line algorithm, Scan lines are processed in increasing (upward) /
decreasing (downward) --------------------------.
A. y order
B. x order
C. pixel order
D. color order
Answer: A

45. When the current scan line in Scan line polygon fill algorithm moves above the
upper / below the lower endpoint, the edge
A. becomes inactive
B. becomes active
C. is discarded
D. is added.
Answer: A

46. The edges crossed by current scan line in Scan line polygon fill algorithm are
called as

Download more sets at McqMate.com


A. active edges
B. inactive edges
C. marked edges
D. none of these
Answer: A

47. Scan line Fill Approach works at the


A. color level
B. edge level
C. polygon level
D. pixel level
Answer: C

48. Following are the data structures used in Scan line algorithm to increase the
efficiency.
A. active edge list
B. active edge table
C. both a and b
D. neither a or b
Answer: C

49. Scan line polygon filling algorithm starts from


A. either ymax or ymin
B. either xmax or xmin
C. only xmax
D. only xmin
Answer: A

50. Scan line polygon filling algorithm can be used for filling Convex polygon.
A. true
B. false
C. cant say
D. none of these
Answer: A

Download more sets at McqMate.com

You might also like