CST 304- COMPUTER GRAPHICS & IMAGE

PROCESSING S6 CSE -(2019-23 BATCH)

QUESTION BANK

MODULE 1

1. Distinguish between raster scan display and random scan display.

2. What do you understand about the aspect ratio and resolution of a display screen in a
raster scan display?
3. Explain the working of a random scan display system with a suitable diagram.
4. Explain the working of a beam penetration CRT.
5. Explain the working of direct view storage tubes(DVST).
6. Consider a raster system with a resolution of 2560*2048. Determine the frame buffer
size (in bytes) needed for the system to store 12-bits per pixel. How much storage is
required if 24-bits per pixel are to be stored?
7. Explain the working of a delta-delta shadow mask CRT.
8. What is the use of computer graphics? List out and explain any 5 applications of
computer graphics.
9. Draw and explain the architecture of simple raster graphics systems.
10. Define the following terms.
a. Persistence.
b. Resolution.
c. Aspect ratio.
d. Frame buffer.
11. Describe in detail the basic video controller refresh operation used in interactive raster
graphics systems.
12. Explain the working of the cathode ray tube in detail.
13. What is the role of a display controller in a raster scan display system? Explain.
14. Explain the functioning of a random scan display system.
15. With a neat diagram describe the working of a cathode ray display device.

16. Write the methods used to plot a dashed line segment.

17. Using the midpoint circle drawing algorithm find out the first quadrant point of a circle
from x=0 to x=y where r=10. Also draw the complete circle using the same.
18. Using both DDA and Bresenhams’s line drawing algorithm, plot the line with endpoints
(20,15) and (34,20).
19. How 8-way symmetric points if (x,y) is a point on the circle with centre at origin.
20. Write the DDA line drawing algorithm.
21. Rasterize the line segment from pixel coordinate (1,1) to (8,5) using Bresenham’s
line drawing algorithm.
22. Write the midpoint circle drawing algorithm.
23. Use midpoint circle drawing algorithm to plot a circle whose radius =20 units and center
is (50,30)
24. What are the advantages and disadvantages of the DDA algorithm?
25. Describe the DDA line drawing algorithm. Use the algorithm to find the coordinate
along the line joining the pixel positions (5,12) and (15,20).
26. Explain DDA line drawing algorithm with examples.
27. Explain the midpoint circle drawing algorithm. Find the pixel locations approximately the
first octant of a circle having centre (10,13) and radius of 5 units using this algorithm.
28. Describe simple random scan display system and draw its architecture.
29. With a suitable figure, describe the shadow masking techniques in CRT.

MODULE 2

30. Given a triangle A(20,10) B(80,20) C(50,70). Find the co-ordinates of vertices after
each of the following transformations.
a. Reflection about the line x=y.
b. Rotation of the triangle ABC about vertex A in clockwise direction for an
angle 90 degree.
31. What do you mean by homogeneous coordinate system? What is its significance?
32. Derive the Initial decision parameter of midpoint circle drawing algorithm.
33. Perform the following transformations on a point (6,4).
a. Translate by tx=-2 and ty=4.
b. Then, scale by sx=2 and sy=1.
c. And rotate by 90 degree in a clockwise direction. Determine the final coordinates
of the transformed point.

34. What is meant by homogeneous coordinate system.

35. Prove that the multiplication of 2D transformation matrices for two successive rotations
is commutative.
36. Represent all transformations equations as matrix multiplication.
37. How can you get the mirror image of an object.
38. Prove that two successive translations are additive.
39. Write the boundary fill algorithm for filling a polygon using eight connected approach.
40. Perform 45 degree rotation of a triangle A(0,0) B(1,1) C(5,3) about the origin and
about the fixed point (-1,-1)
41. Explain shearing and formulate transformations matrix for conditions. Perform shearing
for the given unit square A(0,0) B(1,0) C(1,1) D(0,1) relative to the reference line Yref =-2
and shx=1/2.
42. Flip the given quadrilateral A(10,8) B(22,8) C(34,17) D(10,27) about the origin and
then zoom it to twice its size. Find the new position of the quadrilateral.
43. Clip the given line A(1,3) B(4,1) and against a window P(2,2)
44. Write short notes on 2D rotation transformation.
45. What are the homogenous coordinates? Explain their relevance in simplifying the
geometric transformations of graphical objects.
46. Describe the relevance and various methods of inside-outside test used in polygon filling.
47. Magnify the triangle ABC with A(0, 0), B(1, 1) and C(5, 2) to twice its size
while keeping C(5, 2) fixed.
48. Show that the composition of two successive rotations are additive i.e. R(Ɵ1). R(Ɵ2) =
R(Ɵ1+ Ɵ2).
49. Generate the points between the end points of a line viz.(2,2) and (9,6) by using
Bresenham’s line drawing algorithm.
50. Scan convert the line segment with end points (30,20) and (15,10) using DDA
line drawing algorithm.
51. Prove that the multiplication of 3D transformations matrices for each of the following
sequences of operations is commutative.
● Any two successive translations.
● Any two successive scaling operations.
● Any two successive rotations about any one of the coordinate axes.

MODULE 3

52. Define window to viewport transformations.

53. Which are the steps involved in window to viewport coordinate transformation in 2D?
54. Draw the schematic of the general 2D transformations pipeline from modeling coordinate
to final device coordinate.
55. Describe the techniques that can be used to provide text clipping in a graphics package.
56. Given a clipping window A(-20,-20),B(40,-20),C(40,30) and D(-20,30) using Cohen
Sutherland line clipping algorithm, find the visible portion of the line segment joining
the points P(-30,20) and Q(60,-10).
57. Describe in detail the depth buffer visible surface detection technique. Derive
the equation to find the depth values for a surface position (x, y).
58. Derive an equation for window to viewport transformation by specifying the sequence of
basic transformations involved.
59. Describe the following terms
● Window
● Viewport
● World coordinate
● Device coordinate

60. Define the terms window, viewport and windowing transformations in the context of
2D viewing with suitable diagrams.
61. Explain the concepts of point clipping in 2D.
62. Explain the Cohen Sutherland line clipping algorithm with suitable examples.
63. Brief on 2D viewing transformations pipeline.
64. Why line clipping algorithms are not used for clipping polygons? Explain Sutherland
Hodgeman polygon clipping algorithm with an example.
65. What are the advantages of z-buffer algorithm? Also discuss what is its major drawback.
66. Explain scan line algorithm is used for visible surface detection.
67. Define the terms (i) Centre of projection (ii) Principal vanishing point.
68. Differentiate between oblique and orthogonal projection.Differentiate between
oblique and orthogonal projection.
69. What is meant by vanishing point in the context of a perspective projection.
70. Distinguish between object space methods and image space methods for visible surface
detection.
71. Define the following terms
● Centre of projection
● Vanishing point
● Isometric projection
● Oblique projection

MODULE 4

1. Consider the image segment shown below.

2.
 Compute the lengths of shortest 4, shortest 8 and shortest m paths between pixels p and q
where V={0,1}. If a particular path does not exist between these two points, explain
why.

3. What is meant by convolution? Give applications of 2D convolution in the field of image

processing.
4. Consider the image segment and compute the length of the shortest 4- , 8- and m-path
between p and q by considering two set of values for V: (i)V={0,1,2} (ii)V={1,2} . If a
particular path does not exist, explain the reason for the above two cases of V .

5. Explain the terms adjacency and connectivity in the context of digital images
6. 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 p and q.

7.
8. Define the following terms related to pixel of an image: i) pixel neighborhood ii) digital
path iii) connected set
9. Explain the components of a general purpose digital image processing system with a neat
diagram.
10. What do you understand by the following terms with respect to pixels.Neighbours,
Adjacency, Connectivity.
11. Explain the fundamental steps in Digital Image Processing with a neat diagram?
12. Describe the basic concepts of sampling and quantization with a neat sketch.
 MODULE 5

1. Explain any two edge detectors in detail.

2. What is mean by convolution? Give applications of 2D convolution in the field of
image processing.
3. Explain how scene segmentation and labeling are used with examples.
4. What is meant by the perimeter of a region in an image? Distinguish between
pixel perimeter and crack perimeter.
5. Define Resolution of an image. Explain the spatial and gray level resolution of an
image with an example.
6. What is edge detection? Explain any one edge detection technique in digital
image processing.
7. Explain the components of an image processing system with suitable diagram .
8. Using any one application, explain the steps involved in image processing.
9. Illustrate Histogram equalization technique .
10. Differentiate Gradient filter mask and Laplacian filter mask .
11. Differentiate Sobel and Prewitt edge detection masks .
12. Define Image segmentation and describe in detail the method of edge and region
based Distinguish between smoothing and sharpening filters .
13. Describe how an image is segmented using split and merge technique in
association with the region adjacency graph.
14. What is meant by equalization in image processing?
15. What is edge detection? Explain any one edge detection technique in digital
image processing.
16. How edge detection is performed in digital images using ( i) Sobel operator (ii)
Prewitt operator.What are the advantages of Sobel operator over Prewitt
operator?
17. Discuss the role of histogram equalization in a digital image.
18. What do you mean by histogram of a digital image? Discuss the histogram of four
basic image types.
19. What do you understand about correlation and convolution operations in case of
image processing?
20. The gray levels in an image g1(x,y) range from a to b. It is decided to change it
into an image g2(x,y) in which the gray levels range from c to d using a linear
transformation of its gray levels. Derive the equation for g2(x,y) as a function of
g1(x,y) by specifying the steps.