Bharathidasan University 2009 M.Sc Information Technology Barathidasan University IT Computer Graphics - Question Paper

Barathidasan University
M.SC IT Computer Graphics
December 2009
Time : 3 hours Maximum : 100 marks
ans any 5 ques..
(5 ´ 20 = 100)
1. (a) define the basic operation of a CRT. (10)
(b) elaborate the classifications available in the graphics software? discuss them. (10)
2. (a) discuss the Bresenham’s line drawing algorithm.
(12)
(b) define any 1 approach of region filling techniques. (8)
3. (a) define the composite transformations with examples. (10)
(b) discuss the convex polygon clipping. (10)
4. (a) define the three-dimensional viewing process. (8)
(b) define the basic transformations of 3 dimensional. (12)
5. (a) What do you mean by hidden-surface problem? Also discuss how can you identify and remove these surfaces. (12)
(b) define the Cohen Sutherland algorithm. (8)
6. (a) List out the components of user interface and discuss them. (10)
(b) define the matrix representation of 2 dimensional transformations in graphics systems. (10)
7. (a) define the circle generation algorithm. (10)
(b) discuss how clipping can be performed using the view-volume clipping. (10)
8. (a) elaborate the input devices available for data input on graphic workstations? discuss. (12)
(b) define the styles of command language. (8)

Earning:   Approval pending.