Download Visvesvaraya Technological University (VTU) BE ( Bachelor of Engineering) CSE 2015 Scheme 2020 January Previous Question Paper 6th Sem 15CS62 Computer Graphics and Visualization
USN
tin
Sixth Semester B.E. Degree Examination, Dec.2 fian.2020
Computer Graphics and Visualization
Time: 3 hrs. Max. Marks: 80
ti
.
?
.1.
-
:
Note: Answer any FIVE full questions, choosing ONE full question from each module.
Fs
t-J
P.:
Module-1
0
-0 1 a. Describe various applications of computer graphics with appropriate examples. (08 Marks)
t)
b. With a neat diagram, explain the architecture of a raster display system with integrated
1.4
vi -c" )
display processor. (08 Marks)
..,,
= ?
=
._
a.
3
.; <0
OR
in
......-,' ..
t43 " 2 a. With necessary steps explain Bresenham's line drawing algorithm. Consider the line from
c oc
-1-
'E +
.... N
(5, 5) to (13, 9), use the Bresenham's algorithm to rasterize the line. (08 Marks)
ct
E 4
b. Explain with diagram the different Cartesian reference frames are used in the process of
2 v
tu a
constructing and displaying a scene.
.c u
(08 Marks)
=
o
cu
,
4
,
?
=,
Module-2
: A t'
3 a. Explain with example any two algorithms used for to identify the interior area of a polygon. CA =
2 =
(06 Marks)
7
.2
8
b. Explain with illustrations the basic 2-dimension geometric transformations used in computer
CA
O-0
C
at ci graphics. (06 Marks)
...
3
-0
'Fz'
.-
? c. Explain the different Open GL routines used for manipulating display window. (04 Marks)
4 To
-
>, t
.
o OR
0 ?
......
P
0
4 a. Explain the scan line polygon filling algorithm. And also explain the use of sorted edge table
C ,9"
and active edge list. (08 Marks)
2
b. What is the need of homogeneous coordinates? Give 2-dimension homogeneous coordinate
> , matrix for translation, rotation and scaling. (04 Marks)
c. Obtain a matrix representation for rotation of a object about a specified pivot point in
,. .,. _
. ,
2-dimension.
- .-
(04 Marks)
7,
?
I.
Module-3
? :
5 a. What is clipping? Explain with example the Sutherland-Hodgman polygon clipping
>,
-
algorithm.
8
q
(08 Marks)
b. Explain basic illumination models.
N
(08 Marks)
u
o
z
OR
4E'
6 a. Explain RGB and CMY color models with examples. Explain the transformation between
a
c. CMY and RGB color spaces. (08 Marks)
E
b. Obtain the matrix representation for rotation of a object about an arbitrary axis. (08 Marks)
1 of 2
FirstRanker.com - FirstRanker's Choice
15CS62
USN
tin
Sixth Semester B.E. Degree Examination, Dec.2 fian.2020
Computer Graphics and Visualization
Time: 3 hrs. Max. Marks: 80
ti
.
?
.1.
-
:
Note: Answer any FIVE full questions, choosing ONE full question from each module.
Fs
t-J
P.:
Module-1
0
-0 1 a. Describe various applications of computer graphics with appropriate examples. (08 Marks)
t)
b. With a neat diagram, explain the architecture of a raster display system with integrated
1.4
vi -c" )
display processor. (08 Marks)
..,,
= ?
=
._
a.
3
.; <0
OR
in
......-,' ..
t43 " 2 a. With necessary steps explain Bresenham's line drawing algorithm. Consider the line from
c oc
-1-
'E +
.... N
(5, 5) to (13, 9), use the Bresenham's algorithm to rasterize the line. (08 Marks)
ct
E 4
b. Explain with diagram the different Cartesian reference frames are used in the process of
2 v
tu a
constructing and displaying a scene.
.c u
(08 Marks)
=
o
cu
,
4
,
?
=,
Module-2
: A t'
3 a. Explain with example any two algorithms used for to identify the interior area of a polygon. CA =
2 =
(06 Marks)
7
.2
8
b. Explain with illustrations the basic 2-dimension geometric transformations used in computer
CA
O-0
C
at ci graphics. (06 Marks)
...
3
-0
'Fz'
.-
? c. Explain the different Open GL routines used for manipulating display window. (04 Marks)
4 To
-
>, t
.
o OR
0 ?
......
P
0
4 a. Explain the scan line polygon filling algorithm. And also explain the use of sorted edge table
C ,9"
and active edge list. (08 Marks)
2
b. What is the need of homogeneous coordinates? Give 2-dimension homogeneous coordinate
> , matrix for translation, rotation and scaling. (04 Marks)
c. Obtain a matrix representation for rotation of a object about a specified pivot point in
,. .,. _
. ,
2-dimension.
- .-
(04 Marks)
7,
?
I.
Module-3
? :
5 a. What is clipping? Explain with example the Sutherland-Hodgman polygon clipping
>,
-
algorithm.
8
q
(08 Marks)
b. Explain basic illumination models.
N
(08 Marks)
u
o
z
OR
4E'
6 a. Explain RGB and CMY color models with examples. Explain the transformation between
a
c. CMY and RGB color spaces. (08 Marks)
E
b. Obtain the matrix representation for rotation of a object about an arbitrary axis. (08 Marks)
1 of 2
Module-4
7 a. Explain the 2 classifications of visible surface detection algorithm. (04 Marks)
b.
Explain with example the depth buffer algorithm used for visible surface detection. And also
list the advantages and disadvantages of depth buffer algorithm. (07 Marks)
c. Bring out the differences between perspective and parallel projections. (05 Marks)
OR
? 8 a. Explain the OpenGL 3-dimensional viewing functions. (06 Marks)
b. What is projection reference point? Obtain the general and special case perspective
transformation equations. (06 Marks)
c. Explain Back-face detection method with example. (04 Marks)
Module-S
9 a. Explain the logical classifications of input devices with examples. (06 Marks)
b. Discuss request mode, sample mode and event mode with figures.
(06 Marks)
c. List the various features that a good interactive program should include. (04 Marks)
OR
10 a. Explain how an event driven input can be performed for a keyboard and mouse device.
(06 Marks)
b. List the properties of Bezier curve. And also explain Bazier techniques of generating curves.
(10 Marks)
2 of 2
FirstRanker.com - FirstRanker's Choice
This post was last modified on 02 March 2020