Scribd
Upload
19 views2 pages

Computer Graphics and Animation MCA-20-42

Paper

Uploaded by

Ankur Sharma
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
19 views2 pages

Computer Graphics and Animation MCA-20-42

Paper

Uploaded by

Ankur Sharma
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/ 2

Roll No. ..........................

Total Pages : 03

MCA/M-24 24528
COMPUTER GRAPHICS AND ANIMATION
MCA-20-42
Time : Three Hours] [Maximum Marks : 75

Note : Attempt Five questions in all, selecting one question


from each Unit. Q. No. 1 is compulsory. All questions
carry equal marks.

1. Attempt any five of the following :


(a) Define Clipping and Clip window.
(b) How is a parametric curve defined and represented
mathematically ?
(c) Differentiate between Raster and Vector Graphics.
(d) Write a note on Zooming.
(e) Write various area filling techniques
(f) List any four areas of applications of computer
graphics.

Unit I

2. What are the distinguishing characteristics between Raster


scan and Random scan display devices in computer
graphics ? Explore the feasibility of using frame buffers
to control picture color and intensity, supporting your
response with appropriate arguments.
(8-16/1) L-24528 P.T.O.
3. What is the concept of Color CRTs ? How does the 7. Explain the following :
focusing of colors occur within colored CRTs ? (a) Sutherland-Hodgeman Polygon Clipping Algorithm
Furthermore, why is refreshing necessary in CRT (b) Weiler-Atherton Polygon Clipping.
technology ? Provide a comprehensive explanation.
Unit IV
Unit II
8. What is the Z-buffer algorithm used for solving the hidden
4. Write Bresenham's line generation algorithm. Compare surfaces problem in computer graphics ? When two
the Bresenham line generation algorithm with the DDA polygons possess identical z values and the Z-buffer
algorithm. How Bresenham line generation algorithm algorithm is implemented, what outcome can be observed ?
overcomes the limitations of DDA algorithm ? Use
9. How does the BSP-Tree Method contribute to visual
Bresenham line generation algorithm to draw a line
surface determination through area subdivision ? Discuss
segment from (15, 5) to (20, 9).
subdivision algorithm in detail and how its exploit are
5. Explain the following with suitable example : coherence.
(a) Flood Fill Algorithm
(b) Boundary fill Algorithm.

Unit III

6. How are two-dimensional transformations represented


using matrices ? Discuss the matrix representations for
translation, rotation, scaling, shearing, and reflections.
Explain how these matrices are applied to transform the
coordinates of objects in computer graphics.

L-24528 2 (8-16/2) L-24528 3 400

You might also like