Shivaji University 2006 B.E Computer Science COMPUTER GRAPHICS - exam paper
Sunday, 19 May 2013 09:05Web
H-303
THIRD YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2006
SHIVAJI UNIVERSITY, KOLHAPUR
COMPUTER GRAPHICS
Day and Date: Monday, 29-11-2006 Total Marks: 100
Time: 10.00p.m. To 1.00p.m.
Instructions:
1)Solve any 3 ques. from SECTION-1
2) Solve any 3 ques. from SECTION-2
3) Figures to right shows full marks
SECTION-1
Q.1.
a) With neat diagram discuss calligraphic refresh graphics display. [Marks 8]
b) discuss various input and output devices used in computer graphics [Marks 8]
Q.2
a) Explain in brief N-bit plan black and white gray level frame buffer with a W-bit wide look-up table. [Marks 8]
b) Explain antialising in detail. [Marks 8]
Q.3
a) Explain Bresenhams circle drawing algorithm in detail[Marks 8]
b) What is scan conversion? discuss cell-encoding technique in detail. [Marks 8]
Q.4
a) Explain with steps how to find rotation about arbitrary axis in space with suitable example. [Marks 8]
b) elaborate axiometric projections? How limitations of orthographic projections are overcome by axiomatic projections Explain[Marks 8]
SECTION-2
Q. 5)
a) elaborate Bezier curves? provide the properties of Bezier curves. [Marks 8]
b) Explain convex hull property of B-spine curves in detail. [Marks 8]
Q.6)
a) How end point codes are used in the line-dipping algorithm? provide example. [Marks 8]
b) Write the z-buffer algorithm and discuss. State the merits and Demerits[Marks 8]
Q.7)
a) elaborate space curves? Derive the parametric ques. for parabolic blending. [Marks 8]
b) define techniques to generate self-similar fractals with algorithm[Marks 8]
Q.8)
a) discuss the mid-point subdivision algorithm with an example. [Marks 8]
b) define the interpolation method for generation of curves.[Marks 8]
Earning: Approval pending. |