CSE Department

Question Bank
Subject : Computer Graphics
Semester: VI
Sr.
No.

Questions

Chapter 1. Introduction
1.

Write the differences between Random Scan display and Raster Scan
display.
2.
Explain the working principle of Scanner
3.
How coordinate value of selected screen position is determined in touch
screens?
4.
List advantages and disadvantages of plasma panel display and DVST.
5.
Briefly explain the any five computer graphics applications
6.
Explain the following terms:
1) Persistence
2) Resolution
3) Raster scan display system.
7.
What is frame buffer? How long would it take to load a 1280 by 1024
frame buffer with 12 bits per pixel if transfer rate is 1Mbps.
8.
Explain the working of Cathod Ray tube.
9.
Briefly explain the following display technologies (1) Raster refresh
systems (2) Vector refresh systems (3) LCDs
10. List various techniques used for display graphics in computer. Explain CRT
display with the help of diagram.
11.
Write a short note on: (1) Cathode ray tube (2) Shadow Mask
12.
1. Explain shadow mask method.
2. How long it would take to load a 640 x 400 frame buffer with 12 bits per pixel, If 106
bits can be transferred per second?
3. Define aspect ratio. If image of size 1024 x 800 needs to resize to one that has 640
pixels width with the same aspect ratio, what would be the height of the resized image?
13. 1. What is computer Graphics? List the application of Computer Graphics.
2. Explain working of LED with diagram.
14.
Explain Direct-View Storage Tubes (DVST). How persistence characteristic of
phosphor affect on refresh rate of system?
15. Explain working of Touch Panel and digitizer.
16. Differentiate Raster scan and random scan.
Chapter 2. Graphics Primitives
1.
2.

For what purpose winding number method is used? What is a winding

number?
Explain boundary fill and flood fill for polygon filling.

3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.

15.
16.
17.

Explain the three methods of character generation.

Write the basic principle of Bresenhams line algorithm and write
Bresenhams line algorithm.
Define the term : 1) Antialiasing 2) anchoring
What is aliasing? How to compensate the aliasing? Explain in detail.
What are the limitations of DDA line drawing algorithm? Explain
Bresenhams line algorithm.
Explain the property of circle and calculate the pixel position along circle
with radius r=10 centered on the origin using midpoint circle algorithm
up to x=y.
Derive all necessary formulas for Bresenham line drawing algorithm.
Bresenham line drawing algorithm is used to draw a line from (0, 0) to
(6, 4). Determine all the pixels which will be on as the line is drawn.
Briefly explain the attributes associated with line and characters. Briefly
explain the different methods for the generation of thick lines
Derive all necessary formulas for Midpoint circle drawing algorithm.
Write pseudo code for Midpoint circle drawing algorithm.
What is antialiasing ? Explain different methods to minimizing its effect.
Develop and implement a flood-fill algorithm to fill the interior of any
specified area. What are the differences between flood-fill and boundary
fill algorithm?
1. Pros and Cons of DDA Line Drawing Algorithm.
2. Write short note on Flood fill algorithm.
3. Write short note on Boundary fill algorithm.
Consider the line from (20, 10) and (30, 18). Use the Bresenham Line
Drawing
algorithm to rasterizing the line.
Explain DDA line drawing algorithm. What are the limitations of DDA
line drawing algorithm?
1. Explain trigonometric method for circle generation.
2. Discuss midpoint circle algorithm with example.

18.
Write and explain the midpoint ellipse drawing algorithm.
19.

Compare DDA line drawing with bresenhams line drawing algorithm.

20.

Consider the line from (20, 10) and (30, 18). Use the Bresenham Line
Drawing
algorithm to rasterizing the line.
Explain rules are used to identify interior regions of an object with an
example.

21.
22.

Explain Odd-Even Rule and Non Zero Winding Rules.

23.

24.

Explain shadow mask technique and explain how does it differ

from beam penetration technique?
Give advantages and disadvantages of DDA algorithm. Draw a line from
(20,10) to (30,18) using DDA algorithm.

25.

Explain scan line polygon filling algorithm with example.

Chapter 3. 2 D Transformation And Viewing

1.
2.
3.
4.
5.

6.
7.
8.

9.
10.
11.
12.

13.
14.

Explain the term region codes. Write the steps of Cohen Sutherland
line clipping algorithm.
Explain scaling in 2D transformations.
Explain and write Liang Bersky line clipping algorithm.
Explain NLN line clipping algorithm with example.
Prove that the multiplication of 2D transformation matrices for each
of the following sequence of operations is commutative:
1) Two successive rotations
2) Two successive translations
What is window and viewport? Retrieve equations for the
scalling factors to match the window to viewport in 2D viewing
system.Clipping. Explain the Cohen Sutherland line clipping algorithm.
Define
What is 2D shear transformation? Convert the unit square to shifted
parallelogram using x-direction shear transformation operation
where
parameter shx=1/2 and Yref=-1 and unit square dimensions are
(0,0),(1,0),(0,1).(1,1).
Find out the composite transformation matrix to rotate a given 2D object
by an amount about given point P1(x1, y1).
What is homogeneous coordinate? Why is it required?
Find out composite transformation matrix to reflect a triangle with
vertices A (-2, 1), B (-1, 2) and C (-2, 2) about line y=x+2. Also find
the coordinates of reflected object.
Clip the line PQ having coordinates A(4,1) and B(6,4) against the clip
window having vertices A(3,2) , B(7,2) , C(7,6) and D(3,6) using
Cohen Sutherland line clipping algorithm. Mention the limitations of
algorithm. How it can be overcome?
Develop and implement Cyrus-beck line clipping algorithm.

Write 2 X 2 transformation matrix for each of the following rotation

about origin (a).Counter clock wise rotation by 1800 (b) Clock wise
rotation by 900
15. List and explain various 2D transformations.
16. What is polygon clipping? Explain Sutherland Hodgeman polygon
clipping algorithm with the help of example.
17.

What is polygon clipping? Explain Weiler Atherton polygon clipping

algorithm with the help of example.

18.
19.

What is view port? Explain window to viewport transformation.

Write a short on: (1) 2D Rotation (2) Reflection about an arbitrary line

20.
21.
22.

Write a short on: (1) 2D Reflection (2) Rotation about an arbitrary point
Define Clipping. Explain the Liang Barskey line clipping algorithm.
Solve the followings: Locate the new position of the triangle [(5,4),
(8,3), (8,8)] after its rotation by 900 clockwise about the Centroid.

23.

24.

Prove that the reflection of a square ABCD [(2,2), (4,2), (4,4), (2,4)]
about
x axis (y =0) and then rotation of the resulting square about 600 will not
be

Clip the line using Liang Barsky algorithm against window with
(xwmin, ywmin)= (0,0) and (xwmax, ywmax)=(100,50). Line end points
are
25. A(10,10) and B(110, 40).
Perform 45O rotation of a triangle A(0, 0), B(1, 1) and C(5, 2).
Find transformed coordinates after rotation, (a). About origin,
(b) About P(-1, -1)
26.
Write and explain the Sutherland Hodgeman polygon clipping
algorithm. State its limitations.
27. Consider the clipping window with Lower Left coordinate (1,2) and
Upper Right coordinate (8,4). Clip a line P(-6,-1) and Q(-1, 4) using
Cohen Sutherland line clipping algorithm.
28.
What is window and view-port? Retrieve equations for the scaling
factors to map the window to view-port in 2D viewing system.
29. Consider the clipping window with Lower Left coordinate (0,0) and
Upper Right coordinate (1023,1023). Clip a line P(-307,631) and Q(320,
136) using Cohen Sutherland line clipping algorithm.
30. Translate a Square ABCD with the coordinates A(0,0), B(5,0), C(5,5),
D(0,5) by 2 units in X-direction and 3 units in Y-direction.
31. Apply the shearing transformation to Square with A(0,0), B(1,0), C(1,1)
and
D(0,1) as given below:
a) Shear parameter value of 0.5 relative to line Yref = -1
32. Write a brief note on 2D Translation, 2D Rotation and 2D Scaling.
Chapter 4.3 D Concepts and Object Representation
1.
2.
3.
4.
5.
6.
7.

List and explain the properties of Bazier curves.

Explain the propertises of B-spline curves
List the advantages of the B-spline over the Bezier splines and explain the Bspline curves properties.
Explain prespective projection in 3D display methods.
What is a polygon mesh? Discuss various ways to represent a polygon mesh
with their merits and demerits.
Briefly explain parametric cubic curve and its applications.
Write short note on a) Bazier Surface b) B-Spline Surface

8.
1) What do you mean by view plane?
(2) What is type face?
(3) Define: B-Spline curve
9.

(4) What is Polygon mesh?

(1) What is the need of homogeneous coordinates?
(2) What is Transformation?
(3) What is cubic spline?
(4) What is Bezier Basis Function?
(5) What is bitmap and what is pixmap?

Chapter 5. 3 D Transformation and Viewing

1.

Explain reflection with respect to any plane in 3D transformation.

2.

Explain the three types of axonometric projection in 3D.

3.

Prove that the transformation matrix for the rotation about an arbitrary
axis can be expressed as the composition of following seven individual
transformations :
R()=T-1.Rx-1().Ry-1().Rz().Ry( ).Rx().T

4.

Prove that the general prespective projection transformation is obtain by

the composition of shear and scaling operation and shows the matrix
formulation for the both operations.

5.

Explain the parallel and prespective projection techniques to project 3D

object onto 2D view plane.

6.

Compare parallel and perspective projection. Derive perspective

transformation matrix with centre of projection (0, 0, -d) and xy as a
plane of projection.

7.

Find out the 3D transformation matrix to rotate a given 3D object by an

amount 60 about line passing from point(1,1,1) and the direction vector
V=2i+2j+2k.

8.

What is Parallel Projection? Explain in details types of Parallel

Projection.

9.

Find out the 3D transformation matrix to rotate a given 3D object by an

amount 60 about line passing from point(1,1,1) and the direction vector
V=i-k

10.
List out the different types of projections and explain any two in detail.

11.

Derive equation for 3-D scaling, 3-D rotation and 3-D translation.

12.

Explain parallel and perspective projection with the help of diagram.

13.

Explain 3D viewing pipeline and coordinates with diagram.

Chapter 6.Advance Topics

1.
2.
3.
4.
5.
6.

7.

8.

9.
10.
11.
12.
13.
14.

Which two types of sensors are used in digital cameras?

Which is the simplest and commonly used image space approach
to eliminate hidden surfaces? Explain.
Explain the term hue and saturation. Explain specular reflection in detail.
Explain ambient light and diffuse illumination.
Classify the visible surface detection algorithms and explain one the
image space based algorithm.
Explain the following color model :
1) XYZ color model
2) RGB color model
Explain the property of light using electromagnetic spectrum. Also
explain the following terms:
1)
Dominant frequency
2)
Purity
3)
Luminance
Explain the following color model :
1) YIQ color model
2) CMY color model
Explain shadow mask technique and explain how it differs from
beam penetration technique?
Briefly explain Z-buffer visible surface determination algorithm.
Briefly explain specular and diffuse reflection. What is the importance of
illumination and shading model in creating realistic image?
1. Briefly explain Back Face Detection algorithm.
2. Define Ambient Light.
1. Define Gouraud Shading.
2. Write Short note on RGB Color Model.
What is depth buffer method? Write and explain the steps of a depth
buffer algorithm.

15.
1. Define: Complementary Colors, Saturation, Luminance
2. Explain various light sources.
16.

Explain CIE diagram with its usefulness.

17.

Explain Z buffer algorithm for hidden surface removal.

18.

Explain RGB and CMY color models. How conversion from RGB to CMY is
done?
Explain Back face detection algorithm.

19.