Total No. of Questions : 6] SEAT No.
:
PA-23 [Total No. of Pages : 2
7
[5931]-33
5:4
S.E. (Computer/Artificial Intelligence & Data Science/Computer
:3
10
Science & Design Engineering)
/01 71
COMPUTER GRAPHICS
23
8
/20
(2019 Pattern) (Semester - I) (210244)
.38 13
Time : 1 Hour]
0 [Max. Marks : 30
19
7.1 GP
Instructions to the candidates:
1) Answer Q.1 or Q.2 and Q.3 or Q.4 and Q.5 or Q.6.
CE
84
2) Neat diagram must be drawn wherever necessary.
3) Figures to the right indicate full marks.
6
4) Assume suitable data, if necessary.
7
3.1
5:4
10
Q1) a) Define the terms: color depth, scan conversion refresh rate. pixel. [4]
:3
10
b) 1/2 1
Differentiate between Raster Scan and Random Scan. [4]
3
7
02
8 1 38
OR
4.3 01
9/0
GP
Q2) a) Define the terms: resolution, aspect ratio, frame buffer, refresh rate. [4]
CE
8
b) Compare DDA line drawing Algorithm with Bresenhams Line drawing
7.1
algorithm. [4]
6
:47
3.1
5
10
0:3
Q3) a) Write short note on “Handling Keyboard inputs with GLUT”. [6]
31
1/2 1
7
02
b) Explain significance of error term in Bresenham’s circle drawing algorithm.
38
Explain its mathematical derivations. [6]
01
9/0
7.1 GP
81
OR
.3
CE
84
Q4) a) Describe OpenGL architecture with block diagram in detail. [6]
6
b) Explain Bresenham’s circle drawing algorithm in detail. [6]
3.1
10
P.T.O.
Q5) a) Write and explain with example Sutherland-Hodgeman clipping algorithm.
[5]
7
5:4
b) Let ABCD be the rectangular window with A(20, 20), B(90, 20),
:3
C(90, 70), and D(20, 70). Find region codes for endpoints and use the
10
Cohen-Sutherland algorithm to clip the lines : (i) P1 P2 with P1 (10, 30),
/01 71
23
P 2 (80, 90). [5]
8
/20
.38 13
OR
0
19
7.1 GP
Q6) a) Explain with an example Boundary fill Algorithm. [5]
CE
84
b) Clip the line PQ having coordinates P(4, 1) and Q(6, 4) against the clip
window having vertices A(3, 2), B(7, 2) C(7, 6) D(3, 6). Use
6
7
cohen-sutherland algo. [5]
3.1
5:4
10
:3
10
1/2 1
3
7
02
8 1 38
4.3 01
9/0
GP
CE
8
7.1
6
:47
3.1
5
10
0:3
31
1/2 1
7
02
38
01
9/0
7.1 GP
.3 81
CE
84
6
3.1
10
[5931]-33 2
