6

Total No. of Questions—8] [Total No. of Printed Pages—3

2:0
9:3
Seat
[5459]-190

80
1/2 1
No.

9
01
8 1 130
S.E. (Computer Engineering) (II Semester) EXAMINATION, 2018

9/1
16 P0 COMPUTER GRAPHICS
(2015 PATTERN)
8.2 G
.23
Time : Two Hours Maximum Marks : 50
.24 CE

N.B. :— (i) Answer total four questions. Q. No. 1 or Q. No. 2,

Q. No. 3 or Q. No. 4, Q. No. 5 or Q. No. 6, Q. No. 7

6
2:0
or Q. No. 8
49

9:3
(ii) Neat diagrams must be drawn wherever necessary.

80
(iii) 91
Figures to the right indicate full marks.
01
30
1/2
1. (a) Write Bresenham’s line drawing algorithm to draw dotted line.
01
9/1

Also explain any two advantages of Bresenham’s line drawing

GP
81

algorithm over other line drawing algorithm. [6]

.23
CE

(b) Write and explain with example Sutherland-Hodgeman line clipping

16
8.2

algorithm. [6]
.24

:06
49

:32
Or
09

2. (a) Write and explain Cohen Sutherland line clipping

91
18

algorithm. [4]
30
/20

(b) Define the following terms : [4]

/11
01

(1) Frame Buffer

19
P

(2) Aspect Ratio

8.2 G
38

(3) Convex Polygon

CE
6.2

(4) Concave Polygon.

1

(c) Write and explain any one inside test algorithm. [4]
.24
49

P.T.O.
3. (a) Write transformation matrices for : [6]

6
2:0
(i) 2-D Rotation clockwise direction

9:3
80
1/2 1
(ii) 2-D Rotation about arbitrary point

9
01
8 1 130
(iii) 2-D reflection wrt X-axis

9/1
(iv) 3-D rotation about Y-axis
16 P0
8.2 G

(v) 3-D Scaling

.23
.24 CE

(vi) 3-D translation.

(b) Explain the following terms with example : [6]

6
2:0
(i) Parallel Projection
49

9:3
(ii) Homogenous coordinates

80
91
(iii) Segment table. 01
30
1/2
01
9/1
GP
81

Or
.23
CE

4. (a) What is inverse transformation ? Explain with an example. [4]

16

(b) Explain the CIE chromaticity diagram. [4]

8.2
.24

:06
(c) Explain 3-D clipping with an example. [4]
49

:32
09
91
18

5. (a) Write short notes on the following back face removal

30
/20

algorithm : [4]
/11
01

(i) Painter’s algorithm

19
8.2 G
P
38

(ii) Z-buffer.
CE
6.2

(b) Explain point source illumination and diffused illumination. [5]

1

(c) Enlist and explain in detail any two shading algorithms. [4]
.24
49

[5459]-190 2
 Or

6
2:0
6. (a) Explain Phong Specular reflection model in detail. [4]

9:3
80
1/2 1
(b) Explain BSP tree with its advantages. [3]

9
01
8 1 130
(c) Write a short note on Phong and Gauraud model. [6]

9/1
16 P0
7. (a) What is fractal ? Explain Hilbert curve in detail. [4]
8.2 G
.23
.24 CE

(b) Write a short note on blending function of Bezier curve. [4]

(c) What is openGL ? Write any three 3D transformation Function

6
of openGL. [5]

2:0
49

9:3
80
Or
91
01
30
1/2
8. (a) Draw block diagram of NVIDIA workstation and explain it in
01
9/1

brief. [5]
GP
81

(b) Explain Kotch curve and its application in detail. [4]

.23
CE

(c) Write a short note on Interpolation and approximation. [4]

16
8.2
.24

:06
49

:32
09
91
18
30
/20
/11
01
19
8.2 G
P
38
CE
1 6.2
.24
49

[5459]-190 3 P.T.O.