Computer Graphics

1 of 7 sets

1. An -------------test is used to check whether a point is inside or outside of the

polygon.
A. inside
B. outside
C. fill
D. cover
Answer:A

2. In an inside test if number of intersections are ---------------- then point is inside

m
of the polygon. Note : intersection point is not a vertex.
o
A. even
. c
B. odd
te
C. infinite
a
D. none of the above

q M
Answer:B
c
3. In an inside test if numberM
of intersections is odd then point is ---------------- of
the polygon. Note : intersection point is not a vertex
A. inside
B. outside
C. color
D. can\t say
Answer:A

4. In an inside test if intersections point is a vertex and edges meeting at that vertex
lies on same side of constructed horizontal line then the number of intersections
are considered as ----------. Note : intersection point is a vertex
A. even number
B. odd number
C. infinite number
D. can\t say
Answer:A

5. In an inside test if intersections point is a vertex and edges meeting at that vertex
lies on ------------- side of constructed horizontal line then the number of
intersections are considered as even number . Note : intersection point is a vertex
A. same
B. opposite
C. on the
D. none of the above
Answer:A

6. Two inside polygon test methods are __________ and ________

A. even odd method , winding number method
B. scan line and flood fill
C. even odd method, flood fill
D. winding number method, scan line
Answer:A

7. The 8-Fill Polygon technique will correctly fill the triangle shown below when
seeded at the position shown with an X.
A. true
B. false
Answer:B

8. Following is the method for inside test of the polygon.

A. even-odd method
B. linear method
C. inside method
D. seed method
Answer:A

9. Every side in winding number method has given a number called

A. winding number
B. integer no.
C. direct number
D. side number

View all MCQ's at McqMate.com

Answer:A

10. The total of the winding no. in winding number method of inside test is called
as
A. winding.
B. collective winding.
C. net winding.
D. summation winding.
Answer:C

11. Winding number method always gives correct answer for overlapping polygons
A. true
B. false
Answer:B

12. Inside tests of polygon are useful in --------

A. polygon filling
B. line coloring
C. shadowing
D. none of the above
Answer:A

13. Even-odd method of inside test counts ----- to decide the position of a point.
A. edges
B. vertices
C. intersections
D. pixels
Answer:C

14. In winding number method an ------------------ edges ------ considered

A. horizontal , not
B. vertical , not
C. slanted , not
D. horizontal , is
Answer:A

View all MCQ's at McqMate.com

15. Even-odd method of inside test is suitable for------
A. polygons
B. circles
C. lines
D. all of above
Answer:A

16. In winding number method an edge can have winding number as -----
A. zero
B. +1 or -1
C. only +1
D. only -1
Answer:B

17. If the pixel is already filled with desired color then does nothing, otherwise fills
it. This is called
A. flood fill algorithm
B. boundary fill algorithm
C. scan line polygon filling algorithm
D. none of these
Answer:B

18. 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
Answer:A

19. ___________ procedure accepts the coordinates of an internal point.

A. area fill
B. boundary fill.
C. line fill.
D. scan fill.
Answer:B

View all MCQ's at McqMate.com

20. In 8 connected region by knowing one pixel we can get remaining ----------------
neighboring pixels.
A. 8
B. 4
C. 2
D. 16
Answer:A

21. Following statement(s) is/are true about flood fill algorithm

A. it need a seed pixel
B. it works at pixel level
C. requires more memory
D. all of above
Answer:D

22. Following statement(s) is/are false about flood fill algorithm

A. it doesn’t need a seed pixel
B. it works at pixel level
C. requires more memory
D. all of above
Answer:A

23. Seed pixel in flood fill Algorithm is an

A. an interior pixel
B. exterior pixel
C. not a pixel
D. it is color of pixel
Answer:A

24. In Boundary Fill method ____________ Data Structure is used.

A. stack
B. array
C. heap
D. none of above
Answer:A

View all MCQ's at McqMate.com

25. The 4-connected Polygon filling technique has disadvantage(s) as
A. requires more memory
B. may fill polygon partially
C. stack overflow
D. all of above
Answer:D

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
D. none of these
Answer:A

28. Boundary fill algorithm uses -------- call to the fill function.
A. recursive
B. static
C. one
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

View all MCQ's at McqMate.com

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

View all MCQ's at McqMate.com

 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.
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

View all MCQ's at McqMate.com

 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
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

View all MCQ's at McqMate.com

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
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

View all MCQ's at McqMate.com

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

51. Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled

1111
A. true
B. false
C. cant say
D. none of these
Answer:A

52. Which one is not valid out code to perform trivial accept / reject test in line
clipping
A. 1101
B. 11
C. 101
D. 10
Answer:A

53. Why the Cohen-Sutherland Line-Clipping Algorithm involves much more

calculations than the other line clipping algorithms?
A. need to perform trivial accept / reject test on end points of the line.
B. need to perform trivial accept / reject test for every point on the line.
C. cannot say
D. none of these
Answer:B

54. If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax,
and the y coordinate boundaries are Ymin and Ymax, then ___________ must be
satisfied for a point at (X,Y) to be inside the clipping rectangle

View all MCQ's at McqMate.com

 A. xmin > x < xmax and ymin > y < ymax
B. xmin > x > xmax and ymin > y > ymax
C. xmin < x < xmax and ymin < y < ymax
D. xmin < x > xmax and ymin < y > ymax
Answer:C

55. determine whether points (P1, P2 and P3) are clipped away or visible after
clipping by applying the rules
A. p1:clipped away, p2: clipped away, p3:clipped away
B. p1: visible, p2:visible, p3:clipped away
C. p1: visible, p2:visible, p3: visible
D. p1: clipped away, p2:visible, p3:clipped away
Answer:D

56. Outcode / Region Code used in Line Clipping is of size ____ bits.
A. 4
B. 3
C. 2
D. 1
Answer:A

57. In Line Clipping algorithm, the two dimensional space is divided into ___
regions.
A. 6
B. 7
C. 9
D. 10
Answer:C

58. Is 0011 valid region code / outcode used in Line Clipping algorithm?
A. yes
B. no
C. cannot say
D. none of these
Answer:B

View all MCQ's at McqMate.com

59. Cohen – Sutherland line clipping algorithm was developed in ____
A. 1967
B. 1968
C. 1969
D. 1965
Answer:A

60. Primitive types of clipping algorithms are

A. point clipping
B. line clipping
C. polygon clipping
D. all of above
Answer:D

61. In ________ operation eliminates objects or portions of objects that are not
visible through the window to ensure the proper construction of corresponding
image
A. clipping
B. windowing
C. viewing
D. transformation
Answer:A

62. The region against which an object is clipped is called as ____________

A. clip window
B. clip rectangle
C. window
D. none of these
Answer:A

63. Cohen – Sutherland Line Clipping Algorithm is also called as

____________________
A. sutherland - hodgman algorithm
B. cohen - sutherland outcode algorithm
C. cyrus - beck algorithm
D. none of above

View all MCQ's at McqMate.com

Answer:B

64. Following are coordinates of clipping window : Lower Left Corner (20,20) and
Upper Right Corner (200,200). What is the outcode of point (150,50)?
A. 110
B. 1
C. 0
D. 10
Answer:C

65. The selection and separation of a part of text or image for further operation are
called
A. translation
B. shearing
C. reflection
D. clipping
Answer:D

66. The complex graphics operations are

A. selection
B. clipping
C. shear
D. none of these
Answer:B

67. The process of extracting a portion of a database or a picture inside or outside

a specified region are called
A. translation
B. shearing
C. reflection
D. clipping
Answer:D

68. The rectangle space in which the world definition of region is displayed are
called
A. screen coordinate system

View all MCQ's at McqMate.com

 B. clipping window or world window
C. world coordinate system
D. none of these
Answer:B

69. ............. identifies the picture portions that are exterior to the clip window
A. interior clipping
B. exterior clipping
C. extraction
D. none of these
Answer:B

70. The region code of a point within the window is ............

A. 1111
B. 0
C. 10
D. 11
Answer:B

71. According to Cohen-Sutherland algorithm, a line is completely outside the

window if ............
A. the region codes of line endpoints have a \1\ in same bit position.
B. the endpoints region code are nonzero values
C. if l bit and r bit are nonzero.
D. the region codes of line endpoints have a \0\ in same bit position.
Answer:A

72. The region code of a point is 11. The point is in the ................. region of window.
A. top left
B. top right
C. bottom left
D. bottom right
Answer:A

73. The result of logical AND operation with endpoint region codes is a nonzero
value. Which of the following statement is true?

View all MCQ's at McqMate.com

 A. the line is completely inside the window
B. the line is completely outside the window
C. the line is partially inside the window
D. the line is already clipped
Answer:B

74. The left (L bit ) bit of the region code of a point (X,Y) is '1' if ......................
A. x > xwmin
B. x< xwmin
C. x< xwmax
D. x>xwmax
Answer:B

75. The right bit (R bit)of the region code of a point (X,Y) is '1' if ......................
A. x > xwmin
B. x< xwmin
C. x< xwmax
D. x>xwmax
Answer:D

76. The Most Significant Bit of the region code of a point (X,Y) is '1' if
......................
A. y >ywmin
B. y< ywmin
C. y< ywmax
D. y>ywmax
Answer:D

77. The bottom bit of the region code of a point is '0' if .......................
A. y >ywmin
B. y< ywmin
C. y< ywmax
D. y>ywmax
Answer:D

View all MCQ's at McqMate.com

78. The ...................... algorithm divides a 2D space into 9 regions, of which only the
middle part (viewport) is visible.
A. cohen-sutherland
B. liang barsky
C. sutherland hodegeman
D. none of these
Answer:A

79. Sutherland Hodgeman algorithm works well for...........

A. concave polygons
B. convex polygons
C. smooth curves
D. line segments
Answer:B

80. A line with endpoints codes as 0000 and 01 is ?

A. partially invisible
B. completely visible
C. completely invisible
D. trivially invisible
Answer:A

81. 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
Answer:D

82. Sutherland – Hodgman algorithm is used for _______________.

A. line clipping
B. polygon clipping
C. point clipping
D. hybrid clipping

View all MCQ's at McqMate.com

Answer:B

83. 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
Answer:B

84. 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’
Answer:B

85. 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
Answer:D

86. 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’
Answer:A

View all MCQ's at McqMate.com

87. 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’
Answer:C

88. 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
Answer:A

89. Polygon-Clipping algorithms include the:

A. sutherland-hodgeman method
B. liang-barsky method
C. weiler-atherton method
D. all of above
Answer:D

90. _______ 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
Answer:B

91. Types of polygon :

A. concave
B. convex
C. complex

View all MCQ's at McqMate.com

 D. all of above
Answer:D

92. Concave and Convex are types of _______

A. circle
B. rectangle
C. polygon
D. ellipse
Answer:C

93. In convex Polygon all interior angles are

A. less than 90
B. less than 180
C. greater than 180
D. greater than 90
Answer:B

94. In concave Polygon atleast one interior angle is

A. less than 90
B. less than 180
C. greater than 180
D. greater than 90
Answer:C

95. A region S is ____ , iff for any x1 and x2 in S, the straight line segment
connecting x1 and x2 is also contained in S.
A. concave
B. convex
C. self-intersecting
D. polygon with hole
Answer:B

96. _____ may not always be Convex .

A. paralleogram
B. trapizoid
C. polygon

View all MCQ's at McqMate.com

 D. triangle
Answer:C

97. __________ is represented as a number of line segments connected end to end

to form a closed figure.
A. circle
B. line
C. polygon
D. point
Answer:C

98. ___________ is not a Type of polygon

A. concave
B. convex
C. linear
D. complex
Answer:C

99. Right angled Triangle is an example of ____ Polygon

A. concave
B. convex
C. complex
D. linear
Answer:B

100. Square is an example of ____ Polygon

A. convex
B. concave
C. complex
D. linear
Answer:A

View all MCQ's at McqMate.com