2

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

3:5
9:3
Seat
[5459]-206

80
1/2 1
No.

9
01
8 1 130
S.E. (Information Technology) (II Semester) EXAMINATION, 2018

9/1
16 P0
COMPUTER GRAPHICS
8.2 G
.23
(2015 PATTERN)
.24 CE

Time : Two Hours Maximum Marks : 50

2
N.B. :— (i) Neat diagram must be drawn wherever necessary.

3:5
49

9:3
(ii) Figures to the right indicate full marks.

80
(iii)
91
Assume suitable data, if necessary.
01
30
1/2
01
9/1

1. (a) Differentiate between Raster scan and Random scan. [6]

GP
81

(b) Interpret Bresenham’s algorithm to find which are pixels are

.23
CE
16

turned on for the line segment (1, 2) to (7, 6). [6]

8.2
.24

:52
49

:33
Or
09
91

2. (a) What are different types of polygon ? How can we test whether
18
30
/20

the given point is inside the polygon ? [6]

/11
01

(b) Find the transformation of a square ABCD whose center is

19
8.2 G
P
38

at (2, 2) is reduced to half of its size with center still remaining

CE
6.2

at (2, 2). The square ABCD’s coordinates are (0, 0), (4, 0),
1

(4, 4), (0, 4). Find the new coordinates. [6]

.24
49

P.T.O.
3. (a) Explain 3D transformation rotation about arbitrary axis. [6]

2
3:5
(b) In 2D clipping how are line grouped into visible, invisible and

9:3
80
1/2 1
partially visible categories ? [6]

9
01
8 1 130
9/1
16 P0 Or
8.2 G

4. (a) Explain the ways of projecting 3D object onto 2d Screen in

.23
.24 CE

detail. [6]

(b) Let ABCD be the rectangle window with A(10, 20), B(100, 20),

2
3:5
C(100, 90), D(10, 90). Find the region codes for endpoints and
49

9:3
use Cohen Sutherland algorithm to clip the lines P1-P2 with

80
91
01
P1(5, 30) and P2(70, 110) and Q1-Q2 with Q1(50, 70) and
30
1/2
01

Q2(80, 30). [6]

9/1
GP
81
.23
CE

5. (a) Explain block diagram of i860. [6]

16
8.2

(b) Write a note on openGL. [7]

.24

:52
49

:33
Or
09
91
18

6. (a) Explain pseudo C Algorithm for Gourand Shading. [6]

30
/20

(b) Explain in detail Graphics memory pipeline. [7]

/11
01
19
8.2 G
P
38

7. (a) What is interpolation ? Explain the process of curves

CE
6.2

Approximation. [6]
1

(b) Explain features of any graphics tool you have used. [7]
.24
49

[5459]-206 2
 2
Or

3:5
8. (a) Explain algorithm for fractal lines with the example of generation

9:3
80
1/2 1
of coastlines. [7]

9
01
8 1 130
(b) Write short notes on : [6]

9/1
(i) Fractals and topological dimensions
16 P0
8.2 G

(ii) Koch curve.

.23
.24 CE

2
3:5
49

9:3
80
91
01
30
1/2
01
9/1
GP
81
.23
CE
16
8.2
.24

:52
49

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

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