Shivaji University 2007 B.E Computer Science COMPUTER GRAPHICS -university exam paper

s-505
THIRD YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007
SHIVAJI UNIVERSITY, KOLHAPUR
COMPUTER GRAPHICS

Day and Date: Thursday, 17-11-2007 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) Give the idea of nonparallel geometric projections using examples. [Marks 8]

b) For what RLE is used? List its merits and demerits. [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 the idea of half toning. Suggest the various cell trend to achieve it. [Marks 8]

Q.3
a) What is the significance of fault term in integer line drawing algorithm?[Marks 8]

b) Compare various polygon filling algorithms. [Marks 8]


Q.4 Write short notes on (any two) [Marks 16]

a) Antialising and Supersampling
b) Screen resolution and picture quality
c) Display devices
d) Polygon filling algorithms
e) Perspective projections

SECTION-2
Q. 5)
a) How to convert window contents into view ports? [Marks 8]

b) discuss the concept of segmented display file compilation? [Marks 8]

Q.6)
a) Write with example Z-Buffer example. [Marks 8]

b) Explain Sutherland-Cohen line clipping algorithm discuss the concept of 4-bit coding. [Marks 8]
Q.7)
a) discuss Warnoc algorithm. [Marks 8]

b) define parabolic blended curves. [Marks 8]

Q.8) Write short notes on (any two) [Marks 16]

a) Fractals
b) GUI
c) Window view port

Earning:   Approval pending.