Code No: RR420306 Set No.

1
IV B.Tech II Semester Supplimentary Examinations, May 2008
COMPUTER GRAPHICS
( Common to Mechanical Engineering, Production Engineering and
Automobile Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain the ‘stroke method’and the ‘bitmap method’ for generating characters.
(b) Discuss the antialiasing methods for lines. [8+8]

2. (a) Using the syntax of display file structure, write the algorithm to put an in-
struction into the display file.
(b) Explain the role of display file in the graphical image generation. [8+8]

3. (a) How the magnification and reduction of the graphical objects is done.
(b) Derive the composite transformation matrix which magnifies an object by ‘s’
units in x and y directions about its center c(h,k). [8+8]

4. (a) Write procedure copy-segment (old-segment, new-segment) which copies old

segment to new segment.
(b) Distinguish between window and view port. [12+4]

5. Explain the Cohen-Sutherland algorithm for finding the category of a line segment.
Show clearly how each category is handled by the algorithm. [16]

6. (a) Write the tranformation matrix to rotate a point (x,y,z) about Z axis through
an angle q in the clockwise direction.
(b) Explain about different projection in 3-D . [8+8]

7. Outline the z-buffer algorithm. List the advantages and disadvantages of the z-
buffer algorithm. [16]

8. (a) What are the advantages of B-splines over Bezier Curves?

(b) Differentiate between interpolation and approximation in spline representa-
tions.
(c) Give the applications of raster scan graphics. [4+5+7]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR420306 Set No. 2
IV B.Tech II Semester Supplimentary Examinations, May 2008
COMPUTER GRAPHICS
( Common to Mechanical Engineering, Production Engineering and
Automobile Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Write an algorithm for circle generation, given the center and radius. [16]

2. (a) Briefly explain the steps involved in scan-line algorithm for polygon filling.
(b) What are the merits and demerits of flood-fill and scan-line algorithms?[10+6]

3. Give the homogeneous co-ordinate transformation matrices for the following trans-
formations:

(a) Scale x direction four times as large and the y-direction un-changed.
(b) Clock-wise rotation about the origin, by 60 degrees. [8+8]

4. Find the normalization transformation that maps a window whose lower left corner
is at (1,1) and upper right corner is at (3,5) onto

(a) a view port that is the entire normalized device screen and
(b) a view port that has the lower left corner at (0,0) and upper right corner at
(1/2,1/2). [16]

5. Explain the logic of the Sutherland-Hodgman algorithm with the help of a neat
flowchart. Illustrate the working of your flowchart with the help of a suitable
example. [16]

6. Explain the method to derive the transformation matrix for rotating an object
about any arbitrary axis. [16]

7. Describe, in detail, Gouraud shading.Using Gouraud shading, if pixels A,B,C and

D have the intensities
A: 0.3
B: 0.11
C: 0.5
D: 0.2
What intensities should be assigned to pixels E and F? as shown as in figure7.[16]

1 of 2
Code No: RR420306 Set No. 2

Figure 7
8. Describe Bezier surface generation technique with examples. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR420306 Set No. 3
IV B.Tech II Semester Supplimentary Examinations, May 2008
COMPUTER GRAPHICS
( Common to Mechanical Engineering, Production Engineering and
Automobile Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Illustrate the applications of computer graphics.

(b) What is the stair-care effect in line generation? [8+8]

2. (a) Using the syntax of display file structure, write the algorithm to put an in-
struction into the display file.
(b) Explain the role of display file in the graphical image generation. [8+8]

3. (a) What is meant by homogeneous co-ordinate system for transformations? What

are its advantages?
(b) What is meant by composite transformations? How does it achieved? [8+8]

4. Find the normalization transformation N that uses the rectangle A (1,1), B (5,3),
C (4,5) and D (0,3) as a window and the normalized device screen as a view port.
[16]

5. Explain the following:

(a) Generalised clipping

(b) Multiple windowing. [8+8]

6. Explain the method to derive the transformation matrix for rotating an object
about any arbitrary axis. [16]

7. Outline the z-buffer algorithm. List the advantages and disadvantages of the z-
buffer algorithm. [16]

8. Give the advantages and disadvantages of hard copy displays, vector refresh displays
and raster displays. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR420306 Set No. 4
IV B.Tech II Semester Supplimentary Examinations, May 2008
COMPUTER GRAPHICS
( Common to Mechanical Engineering, Production Engineering and
Automobile Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Define:
i. Aspect ratio
ii. Resolutions
(b) What is the aspect ratio of 12-inchX16 inch display?
(c) Explain the functioning of the vector refresh display system. [3+3+4+6]

2. Explain the scan-line algorithm for polygon filling. [16]

3. Prove that a line can be transformed by applying the transformation to the end
points of the line and then constructing a new line between the transformed end
points. [16]

4. Write procedures for creating and closing segments. [16]

5. Explain the Cohen-Sutherland algorithm for finding the category of a line segment.
Show clearly how each category is handled by the algorithm. [16]

6. Explain the method to derive the transformation matrix for rotating an object
about any arbitrary axis. [16]

7. (a) Explain the basic conepts of hidden surfaces and line removal methods with
suitale examples.
(b) Write about z-buffers. [10+6]

8. Explain the following:

(a) Simple raster display system

(b) Sweeping method of interpolation. [8+8]

⋆⋆⋆⋆⋆

1 of 1