Scribd
Upload
133 views2 pages

Btech Cs 5 Sem Computer Graphics kcs053 2023

The document discusses a computer graphics exam containing multiple sections and questions. It covers topics like line drawing algorithms, polygon clipping, illumination models, and curve properties. Students are asked questions to test their understanding of concepts in computer graphics.

Uploaded by

Divyansh Goel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
133 views2 pages

Btech Cs 5 Sem Computer Graphics kcs053 2023

The document discusses a computer graphics exam containing multiple sections and questions. It covers topics like line drawing algorithms, polygon clipping, illumination models, and curve properties. Students are asked questions to test their understanding of concepts in computer graphics.

Uploaded by

Divyansh Goel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Printed Pages:02 Sub Code:KCS 053

Paper Id: 231658 Roll No.

B.TECH
(SEM V) THEORY EXAMINATION 2022-23
COMPUTER GRAPHICS
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

(a) What are the components of computer graphics?


(b) Explain aliasing and ant aliasing.
(c) Explain curve clipping and text clipping with examples.
(d) Why are Homogeneous co-ordinates used for transformation computations in
computer graphics?
(e) What do you mean transformation in computer graphics?
(f) Explain 3-D geometric primitives.
(g) Explain important terms used in projection.

2
90
(h) What is the difference between interpolation spline and approximation spline?

13
(i) What do you understand by quadratic surfaces? Explain Sphere.
_2

2.
(j) Explain different type of coherence.
P1

24
5.
3D

SECTION B

.5
P2

2. Attempt any three of the following: 10x3 = 30


17
Q

|1
(a) What is the difference between Bresenham and DDA Line drawing algorithms?
(b) Describe Cohen Sutherland line Clipping Algorithm what is its limitations?
6
:3

(c) Explain 3-dimensional clipping? What are the problems that are encountered in
27

perspective projections?
:
13

(d) Discuss relative advantages and disadvantages of Gouraud Shading and


Phong Shading.
3
02

(e) What is hidden surface detection? Explain Depth buffer or Z-buffer


algorithm.
-2
01

SECTION C
6-

3. Attempt any one part of the following: 10x1 = 10


|1

(a) What do you understand by shadow mask CRT? Give its advantages and
disadvantages.
(b) Obtain the mirror reflection of the triangle formed by the vertices A (0, 3), B (2,0)
and C(3,2) about the line passing through the points (1,3) and (–1, –1).

QP23DP1_290 | 16-01-2023 13:27:36 | 117.55.242.132


4. Attempt any one part of the following: 10x1 = 10

(a) Describe Weiler Atherton Polygon Clipping Algorithm with example.


(b) Given a clipping window A(20,20),B(60,20), C(60,40),D(20,40).Using Sutherland
Cohen Algorithm find the visible portion of line segment joining the points
P(40,80),Q(120,30).

5. Attempt any one part of the following: 10x1 = 10

(a) What do you mean by projection? Differentiate between parallel projection and
perspective projection with the help of diagram.
(b) Explain 3-dimensional clipping? What are the problems that are encountered in
perspective projections?

6. Attempt any one part of the following: 10x1 = 10

(a) Explain B-spline curves. Also describe its salient properties.


(b) What is the role of Bezier curves in designing curves and surfaces? Discuss

2
90
its properties.

13
_2

2.
P1

24
7. Attempt any one part of the following: 10x1 = 10

5.
3D

(a) What is back face removal algorithm? Describe the limitations of back face

.5
P2

algorithm.
17
Q

(b) Describe the Phong’s illumination model.


|1
6
:3
: 27
13
3
02
-2
01
6-
|1

QP23DP1_290 | 16-01-2023 13:27:36 | 117.55.242.132

You might also like