Code.

No: 45094
R07 SET-1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER REGULAR EXAMINATIONS NOVEMBER, 2009
COMPUTER GRAPHICS
(Common to CSE, IT, CSSE, E.COMP.E)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---

1. a) List the operating characteristics of the display systems which follow raster refresh
display technology. What are the applications of such devices?
b) Consider a raster display system with resolution of 800 by 400. How many pixels
could be accessed per second by a display controller that refreshes the screen at the rate
of 60 frames per second? [8+8]
2 a) Explain the steps involved in generalized DDA algorithm.
b) What is the principle followed in Flood fill algorithm. Explain the steps in the
algorithm [8+8]
3 a) Derive the transformation matrices for rotation and translation in 2-D Cartesian co-
ordinate system.
b) Reflect the object with vertices A(5,5), B(4.0) and C(7.5) about i) x-axis and ii) y-
axis using the appropriate transformation matrices. [8+8]

4 a) Describe the stages in viewing pipeline in 2-D graphics.

b) Explain the steps involved in Sutherland-Hodgeman algorithm. Explain.[8+8]

5 a) What is quadric surfaces. Explain how a sphere and Ellipsoid are mathematically
represented.
b) What are the steps involved in Phong shading model. What are its advantages and
dis-advantages. [8+8]

6 a) List the three basic rotation matrices for rotation about the three Principle axis. Explain
about their nature of operation.
b) Give a brief note about the approaches followed for clipping in 3-D space. [8+8]

7 a) Classify the visible surface detection algorithms. Explain briefly about each class.
b) Give a detailed note about octree methods for visible surface detection methods.
[8+8]
8 a) Discuss the characteristics of key-frame animation.
b) Distinguish between procedural controlled and constraint based controlling.[8+8]

****************
Code.No: 45094
R07 SET-2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER REGULAR EXAMINATIONS NOVEMBER, 2009
COMPUTER GRAPHICS
(Common to CSE, IT, CSSE, E.COMP.E)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1 a) List the operating characteristics of the display systems which follow raster refresh
display technology. What are the applications of such devices?
b) Consider a raster display system with resolution of 800 by 400. How many pixels
could be accessed per second by a display controller that refreshes the screen at the rate
of 60 frames per second? [8+8]

2 a) Explain the generalized Bresenham’s algorithm. Why is it superior to traditional DDA

algorithm?
b) List the data structures used in scan-line polygon fill algorithm. Illustrate the procedure
with an example. [8+8]
3 a) What is meant by composite transformation? When is it used.
b) Find the reflection of a point A(5.9) about the line y= x+5 [8+8]

4 a) Derive the window to view port transformation matrix. Give the graphical illustration.
b) What is the principle of Cyrus-Beck algorithm for clipping a polygon. Illustrate with
an example. [8+8]
5 a) State the Blending function for Bazier curve. What are the properties of Bazier curve?
b) Explain about the basic illumination model. Give a brief note about the elements
involved of this model. [8+8]
6 a) Explain how the issues involved in rotation and reflection are different in 3-D from 2-
D. Give a detailed note.
b) Give the steps involved in viewing pipe-line. Explain briefly about each stage of
operations. [8+8]
7 a) Explain the steps involved in depth buffer algorithm. Analyze its space complexity.
b) Explain with graphical illustrations, the BSP tree methods for visible surface detection.
[8+8]
8 Explain in detail about the graphical languages followed in achieving the animation
effects. [16]

**************************
Code.No: 45094
R07 SET-3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER REGULAR EXAMINATIONS NOVEMBER, 2009
COMPUTER GRAPHICS
(Common to CSE, IT, CSSE, E.COMP.E)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---

1. a) What are the application areas of computer graphics? Explain briefly.

b) Distinguish the raster-scan and random-scan systems. [8+8]

2. a) Explain the steps involved in mid-point circle generation algorithm. Analyze its
time complexity.
b) What are the steps involved in scan-line polygon fill algorithm. Explain its merits
and limitations. [8+8]
3. a) What is meant by i) homogeneous transformation matrices and ii) transformation
between co-ordinate systems.
b) Prove or disprove that the two successive rotations are commutative. [8+8]
4. a) Define the terms: i) viewing pipeline and ii) window to view port transformation
b) Explain how the function is implemented for finding whether two lines are
intersecting or not in Sutherland-Hodgeman algorithm [8+8]
5. a) Give a detailed note about Hermite interpolation.
b) List various polygon rendering methods. Compare their merits and demerits.
[8+8]
6. a) What are the steps involved in rotating a 3-D object about an arbitrary axis in 3-D
space. Explain about the effects at each intermediate stage of the processing.
b) Define view volume. Explain about it briefly. [8+8]
7. a) Compare the scan-line and depth sorting algorithms for visible surface detection.
b) Explain the steps involved in the area sub-division algorithm. [8+8]
8. a) What is meant by inter-frame coherence. Explain.
b) Discuss about the problem of temporal aliasing. [8+8]

********************************
Code.No: 45094
R07 SET-4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER REGULAR EXAMINATIONS NOVEMBER, 2009
COMPUTER GRAPHICS
(Common to CSE, IT, CSSE, E.COMP.E)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1 a) List the graphical input devices. Briefly explain about any two of the devices.
b) How much time is spent scanning across each row of pixels during screen refresh on
a raster system with a resolution of 640 by 480 and a refresh rate of 60 frames per
second? [8+8]
2 a) What is meant by 8-way symmetry of the circle. How is it helpful in generation
efficient circle generation algorithm.
b) Compare the flood-fill and boundary fill algorithms. [8+8]
3 a) List the basic transformation techniques. Graphically illustrate their effects. State the
corresponding matrix representations.
b) What are the steps involved in the reflecting the object about an arbitrary axis using
2-D transformations. [8+8]
4 a) Explain the terms: i) parametric representation of a line segment and
ii) viewing functions
b) Explain the steps involved in the Sutherland-Hodgeman algorithm for polygon
clipping. What are its advantages. [8+8]
5 a) Define the blending function for B-Spline curve. Explain the terms involved in it.
b) Compare the characteristics of Bazier and B-spline curves. [8+8]
6 a) Derive the matrix form for the rotation about z- axis in 3-D space.
b) Classify the projections and give a brief note about the projection transforms.
[8+8]
7 a) What are the steps involved in depth buffer algorithm. What are its advantages and
disadvantages?
b) What is the principle of area sub-division methods? Illustrate the working of this
algorithm with suitable examples. [8+8]

8 a) Give a detailed note about the ‘stage action’ rules of animations

b) What are the advantages and disadvantages of generation purpose animation
languages. [8+8]

********************************