Code No: R05221201 Set No.

1
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
COMPUTER GRAPHICS
( Common to Information Technology and Computer Science & Systems
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) List and explain the applications of Computer Graphics.

(b) With a neat cross- sectional view explain the functioning of CRT devices.
[8+8]
2. (a) Write the modified version of boundary-fill algorithm for a 4-connected region
to avoid excessive stacking by incorporating scan-line methods.
(b) Devise a parallel method for implementing line-type function. [8+8]
3. Show that the order in which the transformations are performed is important by
the transformation of triangle A(1,0), B(0,1), C(1,1) by

(a) rotating 450 about the origin and then translating in the direction of vector I
by 4 units and
(b) translating and then rotation. [8+8]

4. Explain the algorithm for line clipping by Cohen-Sutherland algorithm. Demon-

strate with an example all the three cases of lines. [16]
5. Given the plane parameters A, B, C and D for all surfaces of an object, explain the
procedure to determine whether any specified point is inside or outside the object.
[16]
6. Prove that the multiplication of three-dimensional transformation matrices for each
of the following sequence of operations is commutative.
(a) Any two successive translations
(b) Any two successive saling operations
(c) Any two successive rotations about any one of the coordinate axes. [16]
7. (a) Explain about the octree method for visible surface detection.
(b) Write an algorithm for back-face detection using a perspective projection to
view visible faces of a convex polyhedron. [8+8]
8. Explain the procedure to simulate the linear, two-dimensional motion of a filled
circle inside a given rectangular area. The circle is to be given an initial velocity
and the circle is to rebound from the walls with the angle of reflection equal to the
angle of incidence. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05221201 Set No. 2
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
COMPUTER GRAPHICS
( Common to Information Technology and Computer Science & Systems
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Assuming that a certain full-color (24-bit per pixel) RGB raster system has
a 512 by 512 frame buffer, how many distinct color choices (intensity levels)
would be available.
(b) Explain how virtual reality systems can be used in design applications. [10+6]
2. (a) Explain the DDA scan conversion algorithm for generating the points on line
segment, when two end-points are given as input.
(b) Digitize the line with end-points (20,10) and (30,18) using DDA algorithm.
[8+8]
3. Prove that the multiplication matrices for each of the following sequence of opera-
tions is commutative [16]
(a) Two successive rotations
(b) Two successive translations
(c) Two successive scalings.
4. Let R be a rectangular window whose lower left corner is at L (-3,1) and upper
right-hand corner is at R(2,6). If the line segment is defined with two end points
with A (-4,2) and B (-1,7).

(a) The region codes of the two end points,

(b) Its clipping catezory and
(c) Stages in the clipping operations using Cohen-Sutherland algorithm. [16]

5. Explain the procedure to design two-dimensional, cubic Bezier curve shapes that
have first order piece-wise continuity. [16]
6. (a) What are the phases defined in typical viewing pipeline. Explain briefly about
each phase.
(b) Explain the steps involved in transformation form world to viewing coordinates
in 3-dimensional domain. [8+8]
7. (a) What happens when two polygons have the same z value and the z-buffer
algorithm is used?
(b) For hidden surface removal of objects with non-planar surface, which algo-
rithms (s) are suitable. Justify.

1 of 2
Code No: R05221201 Set No. 2
(c) What are the underlying concepts of the subdivision algorithm? [5+5+6]

8. What are the issues involved in design of a story board layout with accompanying
key frames for an animation of a single polyhedron. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: R05221201 Set No. 3
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
COMPUTER GRAPHICS
( Common to Information Technology and Computer Science & Systems
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Consider a non interlaced raster monitor with a resolution of n by m (m scan

lines and n pixels per scan line), a refresh rate of r frames per second, a
horizontal retrace time of t horiz and vertical retrace time of tvert. What is
the fraction of total refresh time per frame spent in retrace of the electron
beam.
(b) Explain the applications for large-screen displays. What graphical output
devices support it? [12+4]

2. (a) Explain the DDA scan conversion algorithm for generating the points on line
segment, when two end-points are given as input.
(b) Digitize the line with end-points (20,10) and (30,18) using DDA algorithm.
[8+8]

3. Determine the form of the transformation matrix for a reflection about an arbitrary
line with equation y = mx+b. [16]

4. Explain the algorithm for polygon clipping by Sutherland-Hodgeman algorithm.

Illustrate with an example. [16]

5. (a) What are the elements of Geometry matrix vector proposed by Hermite for
curve generation.
(b) What are the elements of Geometry vector proposed by Bazier for curve gen-
eration? [8+8]

6. Find the matrix for mirror reflection with respect to the plane passing through the
origin and having a normal vector whose direction is N = I + J + K. [16]

7. (a) Illustrate the procedure for implementing area-sub division method.

(b) Explain how the BSP-tree method is implemented for visible surface detection.
[8+8]

8. (a) What is raster animation? Describe it.

(b) List the typical tasks for which the animation functions are defined in anima-
tion languages. [8[+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05221201 Set No. 4
II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
COMPUTER GRAPHICS
( Common to Information Technology and Computer Science & Systems
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Consider the raster system with resolution of 1280 by 1024. What size frame
buffer (in bytes) is needed for the systems to store if 24 bits pixel are to be
stored.
(b) How long would it take to load a 640 × 480 frame buffer with 12 bits per
pixel, if 105 bits can be transferred per second. [8+8]
2. (a) What are the steps involved in Bresenham’s line drawing algorithm for |m| > 1,
where m is slope of the line.
(b) Generate all raster points on the line segments, if the two end-points are given
as (10,20) and (18,30) using the above algorithm. [8+8]
3. (a) Show that the composition of two rotations is additive by concatenating the
matrix representations for R(θ1 ) R(θ2 ) = R(θ1 + θ2 ).
(b) Give a brief note about the following transformations. [8+8]
i. Reflection
ii. Shear.
4. (a) Give a brief note about two dimensional viewing functions. Give an example
which uses two dimensional viewing functions.
(b) Explain the Cohen-Sutherland line clipping algorithm. [8+8]
5. (a) Distinguish between boundary representation and space-partitioning represen-
tation of solid object representation schemes.
(b) List and describe the polygon tables representation for polygon surfaces of a
3-D object. Give an example. [8+8]
6. (a) Classify the projections. Explain the properties of each.
(b) Distinguish the parallel projection and Perspective Projection view volumes.
Give suitable examples. [8+8]
7. Write an algorithm for generating a quad tree representation for the visible surfaces
of an object by applying the area subdivision tests to determine the values of the
quad tree elements. [16]
8. What are the steps in design of animation sequence? Describe about each step
briefly. [16]

⋆⋆⋆⋆⋆

1 of 1