M.C.A. DEGREE EXAMINATION – COMPUTER APPLICATIONS
FOURTH SEMESTER – April 2009
CA 4803 - COMPUTER GRAPHICS AND MULTI-MEDIA
RI 28
Date & Time: 25/04/2009 / 9:00 - 12:00 Dept. No. Max. : 100 Marks
PART-A
Answer ALL Questions: 10 x 2 = 20
1) What is an interlaced refresh procedure?
2) Bring out the advantages of Liang-Barsky algorithm over Cohen-Sutherland line clipping algorithm.
3) What is the difference between window and viewport?
4) Define convex hull.
5) How will you classify visible surface detection algorithms?
6) What is the need for visualization? Give examples.
7) What is Motion dynamics and update dynamics?
8) Write a note on the two components of MIDI.
9) What is audio annotation?
10) What are the primary criteria addressed by VRML?
PART-B
Answer ALL Questions: 5 x 8 = 40
11) a) Explain Random scan and Raster scan displays with a neat diagram.
(or) b) Write a program to demonstrate Bresenham’s line drawing algorithm.
12) a) Explain the rigid-body transformations of 2D objects.
(or) b) Elucidate Hermite interpolation splines with diagram.
13) a) Explain Depth buffer method with neat diagrams.
(or)
b) Explain Gouraud shading with suitable diagram.
14) a) Explain the steps involved in image recognition.
(or) b) Give a detailed description on the methods of controlling animation.
15) a) Write a note on (i) Content relations, (ii) Spatial relations and (iii) Temporal relations of synchronization.
(or) b) Explain the characteristics of MDBMS.
PART-C
Answer any TWO Questions:
(Q.No 16 is compulsory)
2 x 20 = 40
16) a) Explain non-emissive display panels with suitable diagrams.(10)
b) Draw and Explain Nicholl-Lee-Nicholl line clipping procedure. (10)
17) a) Explain the methods for displaying a view of 3D image with suitable diagrams. (10)
b) Explain MIDI Messages (10)
18) Describe Group communication architecture with a neat diagram.(20)
****************