Reg No.:_ Name:

Max. Marks: 100

10

11

12

G1010 Pages: 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION(S), MAY 2019

Course Code: CS401
Course Name: COMPUTER GRAPHICS

PARTA
Answer all questions, each carries 4 marks.

Differentiate between raster scan and random scan display systems.

How 8-way symmetry of circle can be used for writing circle drawing
algorithms? Write the symmetric points if (x, y) is a point on the circle with
centre at origin.

Write the DDA line drawing algorithm.

What do you mean by homogeneous coordinate system? What is 15
significance?

Define the terms window, viewport and windowing transformation in the context
of 2D viewing with suitable diagrams.

Describe the steps involved in scaling a 3D object with respect to a fixed point
(xf, yf, ൧. Derive the composite transformation matrix.

Distinguish between parallel and perspective projections.

Explain the back face detection algorithm for hidden surface removal.

Consider the image segment shown. Let V= {1, 2} and compute the lengths of
the shortest 4-path, 8-path, and m-path between pixels ற and ஏ.

3 1 2 1(q)
2 3 0 2
1 2 1 1

(p) 1 0 1 2

Define the following terms related to pixel of an image:
i) pixel neighbourhood 14) digital path 114) connected set
PART B
Answer any two full questions, each carries 9 marks.
Explain the architecture of raster graphics system with suitable diagrams.
Explain the working of Direct View Storage Tube (DVST).

Explain the boundary fill algorithm using 4-connected approach.

Rasterize the line segment from pixel coordinate (1, 1) to (8, 5) using
Bresenham’s line drawing algorithm.

Page lof 2

Duration: 3 Hours

Marks
(4)
(4)

(4)
(4)

(4)

(4)

(4)
(4)
(4)

(4)

(6)
(3)
(4)
(5)