CS/B.TECH/CSE(New)/SEM-6/CS-604B/2013
2013
COMPUTER GRAPHICS
Time Allotted : 3 Hours Full Marks : 70
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
as far as practicable.
GROUP – A
(Multiple Choice Type Question)
1. Choose the correct alternatives for the following: 10 x 1 = 10
i) Bresenham’s Algorithm seeks to select the optimum raster locations that represent a
a) straight line b) curve line
c) polygon d) none of these.
ii) Clipping algorithm are
a) two or three dimensional
b) two dimensional
c) three dimensional
d) none of these.
iii) According to Simple Area Anti-aliasing, pixel is considered as
a) a mathematical point
b) a finite area
c) an infinite area
d) none of these.
p
