7

F3

13
C5

C
15
Paper / Subject Code: 49375 / Computer Graphics

5D
3A

52
7D
ED

F3

13
C5
1T01873 - S.E. Computer Science & Engineering (Artificial Intelligence & Machine Learning) (R-2019) SEMESTER - III / 49375

C
15
D5

5D
3A

52
7D
ED
- Computer Graphics

27

F3

13
C5
15
D5
QP CODE: 10011857 DATE: 01/12/2022

6B

3A

2
7D
ED

35
27
45

C5
15

F
5
6B
7E

A
D

7D
ED

3
27
6B

5
(3 Hours) Total Marks: 80

C5
4

AF
5
6B
E

D1
CC

D
7

53
7
6B

45

57
5E
5D

B2

C
7E
N.B: 1. Question No. 1 is compulsory

D1
C

7D

7D
13

6
C

5
2. Attempt any 3 from remaining questions

E
5D

B2
52

15
6

5
E
CC

7D
3. Assume any suitable data if necessary and justify the assumptions

F3

D
21

6B

45

E
D
3A

5
6B
35

E
5

D1
C

D
3

7
C5

DC
F

27
1

45

5E
Q.1 Attempt any Four. 20

C6
7D

B
5

E
35
3

7D
3

B7

56
C5

C
15

AF

21
a) Give difference between random scan display and raster scan display.

B2
E4
C6
7D
ED

5
3

F3

B7

56
C5

DC
15

21
D5

b) Define Aliasing, Describe different antialiasing techniques.

E4
6
7D
D

6B
5

5
53

C
27

3
E

7
DC
15

AF

1
D5

6B

45
c) Compare DDA and BRESENHAM line drawing algorithm.

C
6B

2
D
D

35

7E
5
53

CC
27
45

7
E

13
5

F
d) Explain point clipping algorithm.
5

6B
C
B
7E

D1

5D
A

2
7D

D
56

5
3

CC
6B

57

3
5E

13
C5
B2
4

e) Give fractal dimension for KOCH curve.

AF
7E

1
CC

5D
2
7D

D
6

35
53
6B

7
E

13
5D

B2
4

15

AF
D5

C
7E
CC

52
7D
13

56

ED

3
27
B

F3
5D

C5
Q.2 a) Derive formula for mid-point circle algorithm. 10
52

15
6

5
6B
E
CC

3A
D
3

7D
13

B7

D
AF

27
5

E
b) Given a line AB where A(3,1) and B(0,0) calculate all the points of line AB using 10
5D

C5
52

E4

15
C6

D5
6B
53

7D
13

B7

D
C
AF

7
45
DC

DDA algorithm.
E
D

B2
52

15
6

5
7E
35
53

CC

7D
57

56

ED
AF

21

B
DC
1

B2
E4
6
ED

D5
5

5
53

C
57

F3

13

56
C

Q.3 a) With neat diagram explain Composite transformation. 27 10

D5

6B
DC
1

5D
A

4
ED

6B
5

7E
53

C
27

57

13

b) Describe what is Homogeneous coordinates. 10

DC
F
D5

6B

45
DC
6B

52
ED

7E
35
53

CC
27
45

57

F3

21
D5

6B
C
6B
E

D1

5D
A
D
B7

35
3

CC
27
45

57
5E

Q.4 a) With neat diagram explain window to viewport coordinate transformation. 10

3
C5

21
6B
E

5D
3A
D

7D
B7

ED

35
27
45

b) With neat diagram explain Sutherland Hodgman polygon clipping algorithm. 10

13
5
15
6

AF
D5

DC
6B
E
CC

52
B7

ED

53
27
45

57

F3
5D

C6

DC
6B
E

D1

3A
D
13

B7
C

Q.5 a) Define projection, with neat diagram describe planar geometric projection. 10
27
45

57
5E
5D

C5
6

6B
E

D1
CC

7D

7D
3

B7

b) Describe properties of BEZIER curve. 10

21

45

E
D

B2

15
C6

D5
35

E
35

B7

56

ED
C
AF

27
21

5D

E4
C6

D5
B
35
3

56
C5

Q.6 a) Describe various principles of traditional animation. 10

C
F

27
21

6B
5D
3A

E4

6B
35

b) Write short note on Depth buffer algorithm. 10

3

B7
C5

C
AF

21

45
5D

6
D

35

7E
3

CC
57

3
C5

AF

21

6B
D1

5D
7D

35
3

CC

*************
5E

3
C5
15

AF

21

5D
7D
ED

35
3

13
C5
15

AF
5

52
7D

7D
ED

F3
C5
B2

15
5

11857
3A
7D

7D
56

ED

C5
B2
E4

15
5
7D

7D
56

ED
B2
E4

B7E456B27D5ED157DC53AF352135DCC6
15
D5