# CS602-Computer Graphics Quiz MCQs Lecture 1-22 Midterm Objective Questions | SUPERSTARWEBTECH

CS602-Computer Graphics Quiz  MCQS #Objective #Questions #Midterm

1. The ___tests are performed for the midpoints between pixels near the circle path at each sampling step.

• Parabola function
• Eclipse function
• Circle function ✔
• Line function

2. A ___ is the set of all points (x, y) that are the same distance from the directrix and focus not on the directrix.

• Circle
• Hyperbola
• Parabola ✔
• Ellipse

3. Both Boundary Filling and Flood filling algorithms are non-recursive techniques.

• True
• False ✔

4. In ___ algorithm(s), old color must be read before it is invoked.

• Scan line filling
• Flood filling ✔
• Both Scan line and flood filling
• Scan filling

5. Both Boundary Filling and Flood filling algorithms are ___ as compared to scan line filling algorithm.

• Better ✔
• Worse
• Almost same
• Good

6. ___ is used for the circumference of a circle.

• 2r
• 2𝜋c
• 2𝜋
• None ✔

7. If a line connecting any two points within a polygon does not intersect any edge, then it will be a ___

• Convex ✔
• Concave
• Complex
• Concave and Complex

8. ___ is the set of points that are equidistant from its origin.

• Line
• Parabola
• Circle ✔
•  Ellipse

9. We can draw the circle using ___

• Pentane
• Hexanes
• Trident
• Octants ✔

10. Parity is a concept used to determine which ___ lie within a polygon.

• Edge
• Vertices
• Pixels ✔
• Points
11. Locations can be translated or “transformed” from one coordinate system to the other.
• True ✔
• False

12. A two-dimensional rotation is applied to an object by repositioning it along a ___ path in the XY plane

• Straight
• Circular
• Oval
• Ellipse

13. In 2D transformation, ___ can be achieved by rotating the object about 180 degrees.

• Translation
• Scaling
• Shear
• Reflection ✔

14. The shortcoming of the Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines.

• True ✔
• False

15. The process of subdivision an entity or surface into one or more non-overlapping primitives.

• Rendering ✔
• Modeling
• Meshing
• None

16. In Trivial acceptance/reject test there are four bits of nine regions, Bit2 represents condition ___

• Outside half plane of left edge, to the left of left edge X<Xmin
• Outside half plane of right edge, to the right of right edge X>Xmax
• Outside half plane of bottom edge, below bottom edge Y<Ymin ✔
• Outside half plane of top edge, above top edge Y>Ymax

17. In 2D transformation, two successive rotations can be performed in any order (rotation 1 then rotation 2 or rotation 2 then rotation 1)

• True ✔
• False

18. In Trivial acceptance/reject test there are four bits of nine regions, Bit4 represents condition ___

• Outside half plane of left edge, to the left of left edge X<Xmin ✔
• Outside half plane of right edge, to the right of right edge X>Xmax
• Outside half plane of bottom edge, below bottom edge Y<Ymin
• Outside half plane of top edge, above top edge Y>Ymax

19. ___ is the process of describing an object or scene so that we can construct an image of it.

• Rendering
• Modeling ✔
• Meshing
• None

20. Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon

• True
• False ✔