0% found this document useful (0 votes)
22 views3 pages

CS-354 Oct14

This document is an examination paper for a Computer Science course on Computer Aided Graphics, consisting of various sections with multiple-choice questions, short answer questions, and detailed explanations. Candidates are instructed on how to answer the questions, including writing guidelines and compulsory questions. The exam covers topics such as raster graphics, transformations, and algorithms related to computer graphics.

Uploaded by

laita nikam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views3 pages

CS-354 Oct14

This document is an examination paper for a Computer Science course on Computer Aided Graphics, consisting of various sections with multiple-choice questions, short answer questions, and detailed explanations. Candidates are instructed on how to answer the questions, including writing guidelines and compulsory questions. The exam covers topics such as raster graphics, transformations, and algorithms related to computer graphics.

Uploaded by

laita nikam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

O d-znt4

6tqrr - tls7

tilililtililililffiilililtil
*O878*

COMPUTER SCIENCE : UG-CS-354


Computer Aided Graphics
(s5244)

P, Pages :3
Time: Two Hours Max. Marks :40

lnstructions to Candidates :
1. Do not write anything on question paper except seat No.
2. Answer sheet should be written with blue ink only. Graph or
diagram should be drawn with tne same pen being used for
writing paper or black HB pencil.
3. Students should note, no supplement will be provided.
4. All questions are compulsory.
5. Figures to the right indicate full marks.
6. Draw neat diagram wherever necessary.
1. Attempt any eight. I
a) On Raster scan display refres[ring is carried out at the rate.
i) 50 to 70 frames / second
ii) 60 to 80 frames / second
iii) 90 to 100 frames / second
iv) None of the above
b) lf Sx<1 and Sy"1 then.
i) Object will appear large
ii) Object wiil appear small
iii) Object will have no change
iv) None of the above
c) lmage space method is implemented on the basis of -
i) Screen co - ordinate ii) Eye - co - ordinate
iii) Physical co - ordinate iv) None of the above
d) Y - X algorithm can be used for -
i) Polygon edge
ii) Coherence
iii) Hidden surface elimination
iv) None

6tqqr - os7 P-T.O


6trqr - tts7

e) GIF stands for.


i) Geographical interface format
iil Graphics interchange format
iii) Graphics interaction format
iv) Graph interface format
f) Transformation maps world co - ordinate to normalized device
co - ordinate is called
i) 2-D transformation
iil 3-D transformation
iii) Normaiisation transformation
iv) Workstation transformation
g) Raster graphics is composed of -
i) Path ii) Pixel
iii) lmage iv) Picture

h) View point co-ordinate syslem is also known as --


i) Eye co-ordinate ii) Screen co-ordinate
iii) Camera co-ordinate ' iv) Homogeneous co-ordinate
i) Transform the point from world co-ordinate to eye
co-ordinate is called -
i) Translation ii) Rotation
iUl Scaling iv) Viewing Transformation
j) In Bresenhams algorithm, if value of 'e' (error term) is
Negative then --
i) f,; co-ordinate changes
ii) X- co -ordinate un -changed
iii) Y - co - ordinate changes
iv) Y - co - ordinate changed.
2. Attempt any four
a) Define interactive and non - interactive computer graphics.
b) What is matrix representation of - Translation, Rotation of 2-D
transformation.
c) Explain transformation in viewing.
d) Define window and viewport.
e) What is vector graphics ?

mlqqr - osz 2
o,tffi- o5z
f) Enlist :

i) Applications of Raster graphics.

ii) Raster based editors.

3. Attempt any two. 8

a) Differentiate Random scan and Raster scan display.


b) Describe in brief perspectlve transformation.
c) Explain Warnocks Algorithm.

4. a) Attempt any two. 6

b) Difterentiate object space and image space method.

c) What is scan conversion ? List applications and Explain scan


converting polygons.

b) Compulsory question.

What do you mean by coherence ?

5. Attempt any one.

A) a) Explain different co-wordinate system in graphics 4


program.

b) Draw a line using Bresen.hams line drawing algorithm 4


. between points (2,2) to (10,10).
hat are values of p, 6x, 5y each time, show table.
I
B) What do you mean bY cliPPing ?
Where we can apply clipping ?
Write and explain in brief Cohen Sutherland line clipping
algorithm.

************

6t{riT - 057 3 214 I 1650

You might also like