Madras University (UnOM) 2006 M.C.A Computer Aplications Computer Graphics - Question Paper

Time: 3 hours
Maximum: 75 marks

PART A - [5 x five = Marks 25]
ans ALL ques..
All ques. carry equal marks.

1. (a) discuss various primitive operations used in graphics.

Or

(b) define display file structure and display file algorithms.

2. (a) explain about scaling and rotation.

Or

(b) define Cohen-Sutherland out code algorithm.

3. (a) discuss input device handling algorithm.

Or

(b) What is meant by detectability attribute? discuss.

4. (a) define rotation about an arbitrary axis in 3D.

Or

(b) discuss the concept of clipping in 3D.

5. (a) discuss back face removal.

Or

(b) define binary space partitioning.

PART B - [5 x 10 = Marks 50]

ans any 5 ques..
All ques. carry equal marks.

6. discuss briefly on Master Scan System and how this is used for displaying.

7. discuss the Bresenham's line drawing algorithm and compare with simple DDA.

8. define how polygons are represented and how they are fitted, filled with trends.

9. discuss briefly on different coordinate transformation and their utilities.

10. explain about interactive picture construction techniques.

11. discuss parallel and perspective projection algorithms.

12. discuss about shading algorithms and main uses.

13. Write short notes on: (a) Bezier and fractal curves (b) Cotor tables.

Earning:   Approval pending.