Computer Graphics MCQs [set-1]

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

of the polygon. Note : intersection point is not a vertex.
A. even
o m
B. odd
. c
C. infinite te
a
D. none of the above
Answer: B
q M
c
M
3. In an inside test if number 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
Answer: A

Download more sets at McqMate.com

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

15. Even-odd method of inside test is suitable for------

A. polygons
B. circles

Download more sets at McqMate.com

 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

20. In 8 connected region by knowing one pixel we can get remaining ----------------
neighboring pixels.
A. 8
B. 4

Download more sets at McqMate.com

 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

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

Download more sets at McqMate.com