B 0300CST304052202 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Sixth Semester [Link] Degree Examination June 2022 (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 How many bits are required for 1024×1024 raster with each pixel being (3)
represented by 24 bits ?
2 Derive the initial decision parameter of Midpoint Circle drawing algorithm. (3)
3 Explain the non-zero winding number rule to identify the interior regions of a (3)
polygon.
4 Write the boundary fill algorithm for filling a polygon using four connected (3)
approach.
5 Explain the window to viewport coordinate transformation. (3)
6 Explain the Cohen Sutherland line clipping algorithm with a suitable diagram. (3)
7 Explain sampling and quantization. (3)
8 What are the components of the image processing system? (3)
9 What are the applications of the nonlinear spatial filter? (3)
10 What is the histogram of an image? Explain the significance of the histogram. (3)
PART B
Answer one full question from each module, each carries 14 marks.
Module I
11 a) Compute the intermediate points to rasterize a line segment with end points (1,7) (6)
and (5,9) using Bresenham’s line drawing algorithm
b) Use the Mid Point circle drawing algorithm to plot a circle whose radius is 8 units (8)
and centre at (6,5).
OR
12 a) Explain the working of the random scan display system and draw its architecture (6)
diagram.
b) Apply the DDA line drawing algorithm to rasterize a line segment with endpoints (8)
(2,8) and (12,18).

Page 1 of 3
 0300CST304052202

Module II
13 a) Perform a 60 degree counter clockwise rotation of a triangle ABC having the (8)
vertices at A(4,4) B(12,4) and C(4,10) about the origin and draw the original and
resultant triangles.
b) Explain the steps involved in scaling a 3D object with respect to a fixed point (6)
(x, y, z). Also, derive the composite transformation matrix.
OR
14 a) Perform the following transformations on a line with end points A(3, 5) and (8)
B(6, 9). Also, plot original and resultant lines for each case.
i) Translate two unit in x-direction and three units in y-direction.
ii) Rotate the object by 45 degree counterclockwise about the origin.
b) Explain three-dimensional reflection based on zy,xy and xz planes Also, give the (6)
transformation matrices.
Module III
15 a) Explain the Depth Buffer method for visible surface detection. (6)
b) Explain in detail the scan line algorithm for visible surface detection by listing (8)
the tables used in this algorithm.
OR
16 a) Explain the Sutherland – Hodgeman Polygon clipping algorithm with an (8)
example.
b) Distinguish between parallel and perspective projections. What is the principal (6)
vanishing point?
Module IV
17 a) Explain any three applications of digital image processing. (6)
b) Define 4-adjacency, 8-adjacency and m-adjacency. Explain using an example (8)
for each.
OR
18 a) Explain the process of convolution with an example. (8)
b) With a neat diagram, explain the fundamental steps in Digital Image Processing. (6)
Module V
19 a) Explain the following region based segmentation methods. (8)
i) Region Growing
ii) Region Splitting and Merging
b) Explain the Prewitt and Sobel edge detectors. (6)
OR

Page 2 of 3
 0300CST304052202

20 a) Explain the following grey level transformation functions. (6)

i) Image negatives
ii) Gamma Transformation
b) What is histogram equalization? Also, apply the histogram equalization method (8)
on the following 3 bit image.

3 2 1 1
4 4 5 5
5 5 6 7
1 2 6 7
.
****

Page 3 of 3
B 0300CST304052203 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] 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
B 0300CST304052205 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S6 (R,S) / S4 (PT) (R,S) Examination May 2024 (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 Write any three applications of computer graphics. (3)

2 Find the points in the line from (5, 6) to (8, 12) using the DDA line drawing (3)
algorithm.

3 Given a triangle with vertices at coordinates (10,20), (10,10), (20,10). Find the (3)
coordinates of vertices after Scaling with parameters Sx=2, Sy=1.5, with respect
to the origin.

4 List the steps for general pivot point rotation. (3)

5 Differentiate parallel and perspective projections. (3)

6 Perform window to viewport transformation for the point (20,15). Assume that (3)
(Xwmin , Ywmin) is (0, 0); (Xwmax , Ywmax) is (100, 100); (Xvmin , Yvmin) is (5, 5);
(Xvmax , Yvmax) is (20, 20).

7 List any three applications of digital image processing. (3)

8 The spatial resolution of an image is given by 128 X 128. What is the storage (3)
requirement if it is represented by 256 gray levels?

9 Explain the terms (i) Smoothing (ii) Sharpening (3)

10 Explain any two thresholding techniques used in image segmentation. (3)

Page 1of 3
 0300CST304052205

PART B

Answer one full question from each module, each carries 14 marks.
Module I

11 a) Explain any seven applications of computer graphics. (7)

b) Write Bresenham’s circle drawing algorithm. Find the points in a circle octant in (7)
the first quadrant with the centre point coordinates (0, 0) and radius as 8.

OR

12 a) Explain the working of the raster scan system with suitable figures. (7)

b) Explain Bresenham’s Line drawing algorithm with the help of an example. (7)

Module II

13 a) Explain scan line polygon fill algorithm. What problem does the algorithm (7)
encounter when a scan line passes through a vertex?

b) Perform the following transformation on a triangle with vertices A(0, 0), B(1, 0) (7)
and C(1, 1). Find out the new coordinates and draw the result of each
transformation.

i) Rotate the triangle by 90 degree anticlockwise direction.

ii) ii) Reflection about x axis.
OR

14 a) Explain Boundary fill algorithm to fill the interior of any specified area. (7)
Differentiate Boundary fill and flood fill algorithms.

b) Prove that the multiplication of transformation matrices for each of the following (7)
sequence of operations is commutative :
i) Any two successive translations.
ii) Any two successive scaling operations.

Page 2of 3
 0300CST304052205

Module III

15 a) Explain Cohen Sutherland line clipping algorithm with an example. (7)

b) Explain the Scan line method for visible surface detection. (7)

OR
16 a) Explain Depth buffer algorithm for visible surface detection. Write any two (7)
disadvantages of the Depth buffer algorithm.

b) Describe perspective projection. Derive transformation matrix for perspective (7)

projection.

Module IV
17 a) With the help of a block diagram, describe in detail the fundamental steps in image (7)
processing.

b) What is image convolution? Explain various steps involved in image convolution (7)
with the help of an example.

OR
18 a) Explain the basic relationships between pixels? (7)

b) Explain the concept of image sampling and quantization. (7)

Module V
19 a) What is image segmentation? Explain edge and region based segmentation (7)
technique.

b) Explain histogram equalization method of image enhancement. (7)

OR
20 a) Explain any two gray level transformation functions. (7)

b) Describe how an image is segmented using split and merge technique in (7)
association with the region adjacency graph.

****

Page 3of 3
B 1200CST304042502 Pages: 4

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S6 (R,S) / (WP), S4 (PT) Exam April 2025 (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 Explain the pixel, resolution and aspect ratio of a display screen. (3)
Describe the beam-penetration technique in CRT displays. How does it contribute (3)
2
to color generation?
3 List the fundamental types of 3D transformations in computer graphics. (3)
A triangle with vertices A(2, 3), B(5, 4), and C(4, 1) is rotated counter clockwise (3)
4 by 45° about the origin. Determine the new coordinates of the triangle after
rotation.
List the steps involved in the Three-Dimensional Viewing Pipeline in computer (3)
5
graphics.
Define Perspective Projection and describe its characteristics. How does it differ (3)
6
from Parallel Projection?
7 List and explain any three applications of image processing. (3)
Differentiate between Spatial Resolution and Gray Level Resolution in image (3)
8
processing with examples.
What is Power-Law Transformation in image processing? Explain its significance (3)
9
with an example.
What is Contrast Stretching in image processing? Explain its importance in image (3)
10
processing.
PART B
Answer one full question from each module, each carries 14 marks.
Module I
a) Describe the raster scan display system. How does it generate images on the screen, (8)
11
and what role does refresh rate play in its functioning?

Page 1of 4
 1200CST304042502

b) Plot a line using Bresenham’s Line Drawing Algorithm for the coordinates (2, 3) (6)
to (10, 8). Show the step-by-step calculations and determine the sequence of pixel
positions.
OR
a) Apply the Digital Differential Analyzer (DDA) Algorithm to draw a line between (6)
12 the points (2,4) and (7,8). Show step-by-step calculations and determine the
intermediate pixel positions plotted.
b) Explain the Random Scan Display System in detail. How does it differ from the (8)
Raster Scan Display System?
Module II
a) Explain the Boundary Fill Algorithm, its working principle, and the step-by-step (8)
13 process. Compare the 4-connected and 8-connected approaches, and explain how
the 8-connected approach improves over the 4-connected approach.
b) Consider a triangle with vertices at points A(2, 2), B(5, 2), and C(3, 4). Apply the (6)
following transformations in sequence:
i. Translate the triangle by 4 units in the x-direction and 3 units in the y-
direction.
ii. Scale the translated triangle by a factor of 1.5 in the x-direction and 0.75 in
the y-direction.
Determine the final coordinates of the transformed triangle.
OR
a) Compare the Scan Line Algorithm and the Flood Fill Algorithm used for polygon (7)
14 filling in computer graphics. Discuss their working principles, advantages, and
limitations.
b) Prove that two successive 2D rotations are additive, while two successive 2D (7)
scaling are multiplicative. Derive the transformation matrices for both cases and
provide an example to illustrate this property.
Module III
a) Explain the Scan Line Visible Surface Detection Algorithm in computer graphics. (8)
15 Describe its working principle. Provide a suitable example to illustrate its
application in visible surface detection.
b) Apply the Sutherland-Hodgeman Polygon clipping algorithm to clip the polygon (6)
ABCD with respect to a given clipping rectangle. Explain the step-by-step process.

Page 2of 4
 1200CST304042502

OR
a) Consider a window defined by the coordinates (xmin, ymin) = (2, 2) and (xmax, (6)
ymax) = (8, 6). A line segment is given with endpoints P1(1, 5) and P2(7, 8). Using
16 the Cohen-Sutherland Line Clipping Algorithm, determine whether the line is
completely inside, outside, or partially inside the window. If it is partially inside,
compute the clipped coordinates of the line segment.
b) Explain the Depth Buffer Algorithm used in computer graphics for hidden surface (8)
removal. Discuss its operational mechanism and benefits.
Module IV
a) Explain the components of an Image Processing System. Describe each component (8)
17 in detail, highlighting its role in image processing. Illustrate the system with a
diagram.
b) Given a 2D image data f(x) and a mask (filter) weight w(x), perform convolution (6)
to compute the output.

0 0 0 0 0 3 2 1
0 0 0 0 0
1 1 1
Image Data: f(x)= 0 0 2 0 0 Mask Data w(x)=
0 0 0 0 0 1 2 1
0 0 0 0 0
OR
a) Explain the basic relationships between pixels in an image. Discuss concepts such (7)
18 as neighbourhood, adjacency, connectivity and distance measures. Illustrate with
examples
b) Explain the fundamental steps in image processing with a detailed description of (7)
each step. Illustrate the process with a block diagram.
Module V
a) Explain Histogram Equalization. Perform Histogram Equalization for the given (6)
19
image.

Page 3of 4
 1200CST304042502

b) Explain the concept of Sharpening Spatial Filtering in image processing. Discuss (8)
different sharpening techniques, such as Gradient filter mask and Laplacian filter
mask.
OR
a) Explain the concept of Edge Detection in image processing. Discuss different edge (7)
20
detection techniques such as Sobel, Prewitt edge detectors.
b) Explain the Region-Based Approach in image segmentation. Discuss the concepts (7)
of Region Growing, Region Splitting, and Merging with step-by-step explanations.
****

Page 4of 4
 B 0300csT30405220L

RegNo.: Name:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERS

Sixth Semester [Link] Degree Supplementary Examination May 2023 (

Course Code: CST304

Course Name: COMPUTER GRAPHICS AI\D IMAGE PROCESSING
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, eoch canies 3 marks. Marks

I List any six applications of Computer Graphics. (3)

lr 2 Explain the architecture of the raster scan display system. (3)

3 Differentiate between boundary filling and flood filling algorithms (3)

4 What are homogenous coordinates and why are they necessary? (3)

5 Derive the equations of Window to Viewport transformation. (3)

6 Explain the three dimensional viewing pipeline. (3)

7 Define the term connected component. (3)

8 Write short notes on sampling and quantization. (3)

9 Explain use of the Laplacian filter. (3)

l0 How is intensity thresholding used in image segmentation? (3)

PART B
Answer one futl question from each module, each carries 14 marks.
Module I

I I a) Derive all the decision parameter equations of the Bresenham's line drawing (7)

algorithm with the help of neat labelled diagrams.

,. b) Plot the line segment joining the pixels with coordinates (-2,-4) and (4,3) using . (7)

the DDA line drawing algorithm. Show thfiteps in detail.

OR
12 a) Explain the beam penetration and shadow mask method for displaying colour (7)

pictures.

b) Plot the circle with centre (5,3) and radius 5 using Bresenham's circle drawing (7)

algorithm. Show the steps in detail.

Page lof3
-tt

't
0300csr3040,5220L

Module ll
13 a) A square in 2D doordinates is specified by its vertices in the order (8)
(2,6),(6,6),(6,2), and (2,2). C ompute th e fo I I owi n g tran s form at i on s,'

(D Rotate the square by 45o about its vertex (2,6)

(ii) Scale the original square by a factor of 2 about its centre

b) Explain the basic 3D transformations using homogeneous coordinates. (6)

OR
14 a) Explain the scan line polygon filling algorithm and the data structures used. (8)

b) Prove that (i) two successive 2D rotations are additive and (ii) two successive (6)
2D scaling are multiplicative.
Module lll
15 a) Consider the clipping window with vertices in the order (0,0), (0,5), (8,5), and (6)
(8,0). Perform clipping of the line segmentjoining Pl(-1,-2) and P2(9,7) using

the Cohen-sutherland line clipping algorithm. Also find the intersection with
the clipping window.
b) Explain the different types of projections with taxonomy diagram. (8)

OR

16 a) Apply the Sutherland-Hodgeman algorithm to clip the polygon with respect to (8)

the clipping rectangle .

'{ I
,/l

I
I
I
.l

\
l
I
-a

b) Illustrate the working of the Depth Buffer algorithm with the help of an (6)

example.
Module lV
17 a) Summarize the fundamental steps in digital image processing with the help of a (8)

neat labelled diagram.

b) Differentiate between spatial and gray level resolution. (6)

Page 2of3
 0300csT30405220L

18 a) Outline the components of an image processing system with the help of a neat (6)
labelled diagram.
b) Compute the length of shortest 4,8 and, m-path between pixels p and q in the (S)
given figure where V={0,1}. If a particular path does not exist between these
pixels, write suitable justification.
Repeat computations using V:{1,2}

3 I 2 l(q)
2202
t2ll
(p)l 0 I 2
Module V
19 a) Explain the following basic intensity transformations : (6)
i) Image Negatives ii) Power law transformation
b) (i) Apply Histogram Equalization method on the following 3-bit image. Also, (S)
plot image histogram before and after equalization with detailed steps.

4 3 2 I
5 ) 6 6
6 6 7 6
2 3 7 6

OR

20 a) Illustrate the working of the following edge detectors : (g)

i)Sobel ii)Prewitt
b) Explain region splitting and merging segmentation methods using suitaQle (6)
diagrams. -;
*rt*!t

Page 3of3
B 0300csT304052204

Reg No.: Name:

APJ ABDUL KALh,M TECHNOLOGICAL

[Link] Degree 56 (S, FE) / 54 (PT) (S) Examination January 2024 (

Course Code: CST304

Course Name: COMPUTER GRAPHICS AI\D IMAGE PROCESSING
Max. Marks: 100 Duration: 3 Hours
PART A
Answer all questions, each canies 3 marks. Marks

I Suppose you have a raster system designed using an l0 inches x 12 inches (3)

screen with a resolution of 100 pixels per inch in each direction. Find the frame
buffer size required if 6 bits are used to store one pixel in the buffer?
2 Compare DDA and Bresenham's line drawing algorithm. (3)
Describe the 2-Dimension basic transformations
a
J (3)
4 Write down 4-neighbour boundary filling algorithm (3)

5 Discuss on homogeneous coordinate system and specifu one significance (3)

6 Illustrate a window and a viewport in a 2D coordinate system (3)
7 Describe the steps involved in converting an analog image to a digital image (3)
8 List out any 3 Applications of image processing in medical field (3)
9 Discuss on Power-law transformation and its significance in image processing (3)
l0 Differentiate low pass filtering and high pass filtering concept (3)
PART B
Answer onefull questionfrom each module, each corries 14 marks.
Module I

I I a) Describe the working principle of a Refresh CRT monitor with suitable diagrams (6)
b) Calculate the points between the starting pdnt (9,18) and ending point (14,22) (S)

Bresenham's line drawing algorithm.

OR
l2'a) Differentiate raster ican display with randoln scan display. List oufr the (7)
appiications of shadow masking techniques used in CRT.
b) Generate all the first and second octant points of a circle using midpoint circle (7)
drawing algorithm, given with the centre point coordinates as (0, 0) and radius as
t0.

Page lof3
 o300csr:104052204

Module ll
manages the (e)
algorithm and illustrate how it
13 a) Describe scanJine polygon htting
special cases. (5)
shear with an example
b) Define shear. Demonstrate x direction
OR
(10)
on a point (6' 4)'
14 a) Perform the following transformations
i) Translate bY tx = -2 andtt: 4

ii) Then, Scale bY s*=2and s' = I

iii)[Link]
point'
coordinates of the transformed
and show that two successive (4)
b) Describe on composite ffansformations
translations are additive'
Module lll
polygon clipping algorithm and explain
with an (8)
Hodgeman
15 a) write the Sutherland

examPle

b) Showhowintersectionpointsarecalculatedwithclippingwindowboundaryin(6)
algorithm'
Cohen Sutherland line clipping
OR
(6)
projections'
16 a) Discuss on the types of perspective
(8)
used for visible surface detection
b) Describe the scan line algorithm
Module lV

17 a) [Link](8)
b) Discussonvariousimageclassesbasedonthestoragespaceallocatedforpixel(6)
intensities.
OR
.-; (8)
below'
l8 a) Consider an image segment shown

3 I 2 1(q)
2-3 0 2
I 2l I
. (p)l 0 I 2
shortest 4-'8- and m- path
(D Let V:{1,2} and compute the length of the
[Link],
explain *1'tV?-

PageZof3
 o3o(rcsT3o{I,/s2204-

b) Define the basic relationships dbtween pixels in an image. (6)

Module V
lg a) Compare and contrast linear and nonlinear filters used in image processing (8)
b) Two images have the same histogram. Which ofthe following properties must (6)
they have in common? Justiff your answer. (I is the gray level)
' (i) Same total power (sum of squares of pixel values)
(ii) Same Entropy (sum of I ln I over alt pixel values)
(iii) Same degree of pixel to pixel correlation?
. OR

20 a) flefine Image segmentation. Discuss on any three thresholding methods used for (8)
segmentation with suitable diagrams.
b) Discuss why spatial differentiation is used in sharpening filters. Discuss the (6)
properties of first order and second order derivatives
*t**

Page 3of3