MCA - 2102 - 2413/ 1/03
M.C.A. DEGREE EXAMINATION
Second Year First Semester
Computer Graphics - March/April 2003
(Effective from the admitted batch of 2000 2001)

Time: Three hours
Maximum: 75 marks

First question is compulsory.
Answer any FOUR from the remaining questions.
All questions carry equal marks.
Write all bits of the first question at one place.

1. (a) Give some applications of graphics.
(b) Explain display file compilation.
(c) Describe Raster scan systems.
(d) Write the characteristics of a good graphics package.

2. (a) Describe the simple DDA line drawing algorithms.
(b) Describe Bresenhams circle generation algorithm.

3. (a) Suppose we know a point (x', y') and the fact that it was transformed from an unknown point (x,y) by a known matrix Q. Describe a mechanism for finding the original point (x, y). 'Is this mechanism useful in graphics? Explain.
(b) Describe various methods of scan conversion of polygons.

4. (a) Describe edge listing algorithm for scan converting a polygon.
(b) Discuss modifications to the Display file structure that would handle appending to segments.

5. (a) Write operations on segments with illustration.
(b) Write 3D transmissions for translation, scaling, rotation.

6. (a) How can scan conversion ideas be used to cross hatch a polygon with lines as in the following figure?
(b) Explain various co ordinate systems in 3D viewing.

7. (a) Describe procedure for drawing Bezier curve.
(b) Explain B spline methods.

8. (a) Explain different types of parallel projections.
(b) Describe bas ic principles of designing a graphic package.