0% found this document useful (0 votes)
84 views3 pages

CST304 C

Uploaded by

ktusemester
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
84 views3 pages

CST304 C

Uploaded by

ktusemester
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

B 0300CST304052203 Pages: 3

Reg No.:_______________ Name:__________________________


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
B.Tech Degree S6 (R, S) / S4 (PT) (R, S) Examination June 2023 (2019 Scheme)

Course Code: CST304


Course Name: COMPUTER GRAPHICS AND IMAGE PROCESSING
Max. Marks: 100 Duration: 3 Hours

PART A

Answer all questions, each carries 3 marks. Marks

1 Differentiate the aspect ratio and resolution of a raster scan display? (3)
2 List out the applications of computer graphics. (3)
3 Write down the 4- neighbour Flood-filling algorithm (3)
4 Describe the basic 3-Dimension transformations (3)
5 Discuss the steps involved in window to viewport coordinate transformation in (3)
2D?
6 Illustrate the Oblique Projections (3)
7 Define the terms related to pixel of an image: (3)
i) Neighbours ii) Boundary iii) Path
8 Differentiate gray scale image and a colour image (3)
9 Write the algorithm for basic Global thresholding (3)
10 Compare Smoothening and sharpening techniques in image processing (3)
PART B
Answer one full question from each module, each carries 14 marks.
Module I
11 a) Explain the architecture of raster scan system with suitable diagrams. (6)
b) Rasterize the line segment from pixel coordinate (1, 1) to (8, 5) using (8)
Bresenham’s line drawing algorithm
OR
12 a) Scan convert the line segment with end points (0,0) and (10,5) using DDA line (10)
drawing algorithm. Find out and discuss the advantages and disadvantages of
this method.

Page 1of 3
0300CST304052203

b) Describe the working of a beam penetration CRT (4)

Module II
13 a) Compare the purpose of flood-fill and boundary-fill algorithm. Discuss the data (8)
structures used for scan-line polygon filling algorithm.
b) Given a triangle A(20,10) B(80,20) C(50,70). Find the co-ordinates of vertices (6)
when (a) Reflection about the line x=y, (b) Reflection about the diagonal y = -x.

OR
14 a) Consider a triangle at (2,2), (10,2), (2,10). Perform the following 2D (10)
transformations in succession and find the resultant vertices
(i) Scale with respect to (2,2) by scaling factors (2,2) respectively along x
and y directions.
(ii) Rotate by 900 counter clockwise direction
b) Discuss the techniques used to identify the inside and outside points of a (4)
polygon.

Module III
15 a) Write Cohen Sutherland Algorithm and illustrate the region and region code (8)
b) Summarize on multi view and axonometric projections. Write the equation for (6)
projection coordinates of a point P(x,y,z), if the view plane is placed along z-
axis.

OR
16 a) Describe the Depth buffer algorithm used for visible surface detection (8)
b) List out the applications of visible surface detection algorithms (6)

Module IV
17 a) Write short notes on (i) Illumination, (ii) Reflectance (6)
b) Describe the components of an image processing system with necessary diagram (8)
OR
18 a) Define convolution. List out the properties of convolution. Illustrate the steps (8)
involved in convolving an image with a mask.
b) List out the applications of image processing in Medical field (6)
Module V
19 a) A 3-bit image of size 4×5 is shown below. Compute the histogram equalized (8)

Page 2of 3
0300CST304052203

image.
0 1 1 3 4
7 2 5 5 7
6 3 2 1 1
1 4 4 2 1
b) Define edges in an image. Discuss on any two edge filters (6)
OR
20 a) Discuss on region based approaches used for segmentation (8)
b) Describe the Laplacian filter masks used for image processing (6)
****

Page 3of 3

You might also like