10CS65

am
USN

43
Sixth Semester B.E. Degree Examination, July/August 2021
Computer Graphics & Visualization

1:
Time: 3 hrs. Max. Marks:100

:5

F
08
Note: Answer any FIVE full questions.

-S
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

1 a. With a neat diagram, explain the components of a graphics system. (06 Marks)

1
b. With a neat diagram, explain the human visual system. (06 Marks)

F
02
c. With a neat block diagram, explain the graphics pipeline architecture. (08 Marks)

-S
2
-2
a. What are the graphics functions which give good API support? Explain them. (06 Marks)
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

F
09
b. Explain RGB color and indexed color model. (06 Marks)

-S
c. What are the two classes of primitives OpenGL supports? Discuss various polygon types in
OpenGL
3-

(08 Marks)

F
-1

3 a. Which are the six classes of logical input devices? Explain. (06 Marks)
-S
b. What are the measure and trigger. Explain the different modes that application program can
U

obtain from the measure of a device. (08 Marks)

VT

c. Describe window events and keyboard events. (06 Marks)

F

am
-S

4 a. Explain : (i) Affine sums (ii) Convexity (iii) Dot and Cross products. (06 Marks)

F
b. Explain rotation, transformation and scaling with respect to 2-dimensions.
18

(06 Marks)
F

-S
c. Explain the modeling of colored cube and bilinear interpolation. (08 Marks)
-S

2:

5 a. What is concatenation of transformation? Derive concatenated final matrix M for rotating a

F
:1

3D object about a fixed point. (10 Marks)

F

-S

b. What are quanternions? With an example, explain its mathematical representations.

09
-S

(10 Marks)
F

a. Explain the various types of views that are employed in computer graphics system with neat
21

6
F

-S

sketches. (10 Marks)

-S

b. Explain the hidden surface removal algorithm.

20

(10 Marks)
F

a. Explain phong-lighting model. Indicate advantage and disadvantage of this method.

SF

7
-S
9-

(10 Marks)
b. Discuss the polygonal shading and its types.
-0

(10 Marks)
F
13

-S

8 a. What is a Clipper? Explain the Cohen-Sutherland clipping. (08 Marks)

b. Describe DDA algorithm for scan conversion of line segment. (06 Marks)
c. Write a note on antialiasing. (06 Marks)
F
-S

*****
F
-S
F
-S
SF
 10IS665

pm
USN

Sixth Semester B.E. Degree Examination, Jan./Feb. 2021

6
:1
Computer Graphics and Visualization

1
Time: 3 hrs. Max. Marks:100

:1
Note: Answer any FIVE full questions, selecting at least TWO questions from each part.

F
01
PART – A

-S
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

1 a. Define computer graphics. Explain in detail the application of computer graphics in current

1
day. (10 Marks)

F
02
b. Explain the working of pinhole camera. Derive angle of view. (10 Marks)

-S
-2
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

2 a. Explain the seven major groups of OpenGL API functions, with example for each function.

F
03
(10 Marks)

-S
b. List out different OpenGL Primitives, giving examples for each. (10 Marks)
6-

F
-1

-S
3 a. What are the various classes of logical input devices that are supported OpenGL? Explain
U

the functionality of each of these classes. (08 Marks)

b. What is a measure and trigger of a logical input device? Explain the different modes to
VT

obtain the measures with example. m (08 Marks)

-S

c. List out the characteristics of a good interactive program. (04 Marks)

0p

F
F

-S
:1

4 a. Explain different frame coordinates in OpenGL, with suitable example. (10 Marks)
-S

b. Explain translation, rotation and scaling objects in 2-dimensions.

38

(10 Marks)
F
F

-S
:
01
-S

PART – B
5 a. How an object transformation is implemented in OpenGL? Explain with suitable example.
F

(10 Marks)
21
F

-S

b. What are quaternions? How it is useful in a three dimensional space. (10 Marks)
-S

20

6 a. Briefly discuss the following along with the functions used for the purpose in OpenGL.
SF

-S
3-

i) Perspective projections ii) Orthogonal projections. (10 Marks)

b. What is canonical view volume? Explain the mapping of a given view volume to the
-0

canonical form. (10 Marks)

F
16

-S

7 a. Explain phong lighting model. Indicate the advantages and disadvantages. (10 Marks)
F

b. What are the different methods available for shading a polygon? Briefly discuss any two of
-S

them. (10 Marks)

F

8 a. Explain the Cohen-Sutherland line clipping algorithm in detail. (10 Marks)

-S

b. Explain the Liang-Barsky line clipping algorithm. (10 Marks)

*****
F
-S
SF
 am
USN 18CS62

17
Sixth Semester B.E. Degree Examination, July/August 2022
Computer Graphics and Visualization

3:
:4
Time: 3 hrs. Max. Marks: 100

F
08
Note: Answer any FIVE full questions, choosing ONE full question from each module.

-S
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

2
Module-1

F
02
1 a. Explain Refresh Cathode ray tube with neat diagram. (10 Marks)

-S
b. What is Computer Graphics? Explain the application of Computer Graphics. (10 Marks)
-2
OR
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

F
08
2 a. With a neat diagram, explain the architecture of a raster display system with integrated

-S
display processor. (10 Marks)
5-

b. Explain Bresenham’s Line drawing algorithm, with an example. (10 Marks)

F
-0

Module-2
-S
U

3 a. What is the need of Homogeneous Coordinate System? Explain Translation , Rotation and
Scaling in 2D Homogeneous Coordinate System, with matrix representation. (10 Marks)
VT

b. Explain with example any two algorithms used to identify interior and exterior area of a
am
-S

polygon. (05 Marks)

c. Explain two dimensional viewing transformation pipe line. (05 Marks)

F
41
F

OR -S
-S

1:

4 a. Explain Scan Line polygon fill algorithm. (10 Marks)

b. Explain different OpenGL routines used for manipulating display window. (05 Marks)
F
:0

c. Explain OpenGL 2D – viewing function. (05 Marks)

F

-S
09
-S

Module-3
F

5 a. What is Clipping? Explain Cohen – Sutherland Line Clipping algorithm, with suitable
22
F

-S

example. (10 Marks)

-S

b. Explain Basic Illumination Model and explain Phong’s Lighting model. (10 Marks)
20

OR
SF

-S
8-

6 a. Explain Sutherland – Hodgman Polygon Clipping algorithm .Find the final clipping polygon
for the following Fig. Q6(a). (10 Marks)
-0

F
05

-S
F
-S

Fig. Q6(a)
F
-S

b. Write an OpenGL program to rotate a cube in all directions. (10 Marks)

F

1 of 2
-S
SF
 18CS62

am
17
Module-4
7 a. Explain with example, Depth buffer algorithm used for visible surface detection. Discuss the

3:
advantages and disadvantages. (10 Marks)

:4
b. Explain 3D viewing pipeline with neat diagram and transformation from World to viewing
coordinates. (10 Marks)

F
08

-S
OR
8 a. Explain Orthogonal Projection in details. (10 Marks)

2
b. Explain Perspective Projection with reference point and vanishing point with neat diagram.

F
02
(05 Marks)

-S
c. Explain Symmetric Perspective – Projection Frustum.
-2 (05 Marks)

F
Module-5
08

-S
9 a. What are the different Logical input devices and explain with an example. (10 Marks)
b. Discuss the various input modes with diagram. (05 Marks)
5-

c. Explain the creation of display list with an example. (05 Marks)

F
-0

-S
OR
U

10 a. List the properties of Bezier curve and also explain Beizer techniques of generating curves.
VT

(10 Marks)
F

am
b. Describe the various features that a good interactive program should incorporate. (05 Marks)
-S

c. Explain how menus in OpenGL are created. (05 Marks)

F
41
F

-S
-S

1:

F
:0
F

-S
09
-S

F
22
F

-S
-S

20

F
SF

-S
8-

*****
-0

F
05

-S
F
-S
F
-S

2 of 2
F
-S
SF
 am
18CS62

07
USN

9:
Sixth Semester B.E. Degree Examination, Jan./Feb. 2023
Computer Graphics and Visualization

:5

F
Time: 3 hrs. Max. Marks: 100

08

-S
Note: Answer any FIVE full questions, choosing ONE full question from each module.

3
Module-1
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

F
02
1 a. List and explain any six applications of computer graphics. (08 Marks)

-S
b. Explain the Refresh Cathod Ray Tubes with the neat diagram. (12 Marks)
-2 OR

F
02
2 a. Develop the code of the Bresenhams Line Drawing Algorithm. Also illustrate the algorithm

-S
the line end points are (20, 10) and (30, 18). (10 Marks)
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

2-

b. Write circle drawing algorithm. Given a circle radius r = 10, solve the midpoint circle
algorithm by determining positions along the circle octant in the first quadrant from x = 0 to
F
-2

x = y. (10 Marks)
-S
U

Module-2
3 a. Classify the polygon. Explain two methods for inside-outside test of a polygon. (10 Marks)
VT

am
b. Develop the concept of Scanfill algorithm for filling algorithm for filling polygon with
-S

suitable diagrams. (10 Marks)

F
02

OR
F

4 a. Explain translation, rotation and scaling of 2D transformation with suitable diagrams, code
-S
-S

and matrix. (10 Marks)

7:

b. Explain OpenGL raster transformations and OpenGL geometric transformation functions.

F
:0

(10 Marks)
F

-S

Module-3
09
-S

5 a. Develop the Cohen Sutherland Line Clipping program using OpenGL. (10 Marks)
b. Explain any two of the 3D geometrical transformation. (10 Marks)
F
23
F

-S

OR
-S

6 a. Explain the Sutherland Hodgeman Polygon clipping with example. (10 Marks)
20

b. Discuss the RGB color model and CMY color model. (10 Marks)
F
SF

Module-4
-S
2-

7 a. Define orthogonal projections. Explain clipping window and orthogonal projection view
-0

volume in 3D. (10 Marks)

F

b. Explain the three dimensional view pipeline. (10 Marks)

22

-S

OR
8 a. Construct perspective-projection transformation coordinates and perspective projection
F

equations special cases. (10 Marks)

b. Explain the Depth-Buffer method and develop its algorithm.
-S

(10 Marks)

Module-5
9 a. Explain any three programming event driven input with suitable examples. (10 Marks)
F

b. Explain the various input modes with neat diagram. (10 Marks)
-S

OR
10 a. Explain Animating Interactive Program. (10 Marks)
F

b. Discuss Logical Device and Hierarchical Menus. (10 Marks)

-S

*****
SF