Jawaharlal Nehru Technological University Hyderabad 2006-3rd Sem M.C.A Computer Aplicationss - Question Paper

Code No:NR-23/MCA
M.C.A. III semester Examinations, July-2006.

COMPUTER GRAPHICS

TIME:3 HOURS Max.Marks:60

ans any 5 ques.
All ques. carry equal marks
------------------
1.List the steps involved in Bresenham's line generation algorithm, which is suitable for any input end points.
explain its time complexity.
2.a)What is the role of normalized device coordinates in the viewing transformation.
b) List the merits and demerits of various scan-line algorithms for ploygon filling.
3.a) Derive the generalized transformation matrix for rotation about an arbitrary point.
b) Prove with a suitable example 2 successive rotations are commutative.
4.a) How the polygon clipping is performed using Sutherland-Hodgeman algorithm
b) Demonstrate with a suitable example that the sutherland-Hodgeman algorithm is not suittable for
concave clipping polygon.
5.a) discuss the event handling mechanism followed in any of the graphical input device.
b) discuss how the locator device is similated.
6.a) "Categorize the projections".Give a brief note about the characteristics of every type of projection.
b) elaborate the characteristics of perspective projections?
7.a) Write the algorithm to implement the Z-buffer algorithm.
b) discuss how various smooth shading techniques are implemented.
8.a) how the curve is generated using B-spline approach.
b) How the surface is generated using B-spline approach.

*********

Earning:   Approval pending.