Hall Ticket No:
Question Paper Code: A3602
VARDHAMAN COLLEGE OF ENGINEERING
(AUTONOMOUS) B. Tech IV Semester Regular/Supplementary Examinations, May 2018
(Regulations: VCE-R15) COMPUTER GRAPHICS
(Information Technology) Date: 25 May, 2018 FN
Time: 3 hours
Max Marks: 75
Answer ONE question from each Unit
All Questions Carry Equal Marks
Unit I
1.
Mention the different input devices and explain two of them in detail.
8M
Suppose an RGB raster system is to be designed using an 8 inch x 10 inch screen with a resolution of 100 pixels per inch n each direction. If we want to store 6 bits/pixel in the frame buffer, how much storage (in bytes) do we need for the frame buffer?
7M
2.
Explain the working of a refresh-cathode ray tube.
8M
How much time is spent scanning across each row of pixels during screen refresh on a raster system with a resolution of 1280 x 1024 and a refresh rate of 60 frames/second?
7M
Unit II
3.
Write and explain the Bresenhams line drawing algorithm and compare its advantage over DAA line drawing algorithm.
9M
Using Midpoint circle algorithm generate pixel activation list for drawing a circle with the given radius of r 10.
6M
4.
Illustrate a procedure for implementation of mid-point ellipse algorithm.
9M
Discuss how boundary fill algorithm can be used to fill interior region of an arbitrary shaped object drawn on a scene.
6M
Unit III
5.
Define Shearing. Write the Shearing matrix for both X and Y direction in 2D.
8M
Rotate the rectangle formed by points and 300 about the pivot point
Fig.1
7M
6.
Define the following:
i. Clipping window
ii. Viewing-coordinate reference frame
iii. Viewport
iv. Workstation transformations
8M
Illustrate the procedure to clip a polygon using Sutherland-Hodgeman Algorithm. Write the steps involved in the same.
7M
Unit IV
7.
Write the 3D transformations with the transformation matrices.
8M
Illustrate the transformation from world to viewing coordinates.
7M
Cont…2

8.
Explain the method of perspective projection transformation.
8M
Explain geometric continuity conditions.
7M
Unit V
9.
Explain the depth sorting method for solving the hidden surface problem.
8M
Write short note on general computer animation functions and Raster animations.
7M
10.
Compare and contrast the difference between object space methods and image space methods in visible surface detection methods? Explain the back face detection algorithm.
9M
Explain the ways in which the motion of objects can be specified in an animation system.
6M