Reg No.: Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Seventh Semester B.Tech Degree Examination (Regular and Supplementary), December 2020

Course Code: CS401
Course Name: COMPUTER GRAPHICS

Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions, each carries 4 marks. Marks
1 Describe simple raster scan system and draw its architecture. (4)
2

Generate 4 pixel positions of a circle in the first quadrant with radius 510 (4)
centered on the origin, using the midpoint circle algorithm.
3 (a) Which algorithm is better for line drawing - DDA or Bresenham’s? Defend (2)

your view.
(b) Write a note on any two interactive graphics input devices. (2)

4 Write 2D transformation matrix for reflection and rotation of an object about x- (4)
axis.

5 Write the A-buffer algorithm for visible surface detection. (4)

6 Describe the various classifications of the visible-surface detection algorithms (4)
with example.

7 Describe the concept of vanishing point with relevant figures. (4)

8 Distinguish between one point perspective projection and two point perspective (4)
projection with suitable diagram.

9 Illustrate scaling with respect to a selected fixed position (Xp, Yr, 20) (4)

10 Describe the concept of spatial convolution. (4)

PART B

Answer any two full questions, each carries 9 marks.

11 a) Consider three different raster systems with resolutions of 640 by 480, 1280 by (5)
1024 and 2560 by 2048. What size frame buffer (in bytes) is needed for each of
these systems to store 12 bits per pixel? How much storage is required for each
system if 24 bits per pixel are to be stored?
b) Compare Boundary and flood fill algorithm. (4)

12 ൮) Explain the components and working of colour CRT with suitable diagrams. (6)

b) Indicate what raster locations would be chosen by Bresenham’s algorithm while (3)
scan converting 8 line from (5, 5) to (13, 9).
13 a) Mention the steps involved in the rotation of a 2D object about a selected pivot (5)
point.
b) Cohen Sutherland algorithm can totally reject a line in the first step itself.Justify (4)

Page lof2