GALGOTIAS UNIVERSITY

SCHOOL OF COMPUTING SCIENCE AND ENGINEERING

QUESTION BANK
Course Name / Code : CSE323 – COMPUTER GRAPHICS Programme: B. Tech / III Yr / VI Sem
Course Coordinator : Gokul Rajan V

UNIT – I INTRODUCTION AND LINE GENERATION

Compe
Bloom’s
S. C Difficult titive Ma
Questions Taxonomy Area Topic Unit
No O y Level Questio rk
Level
n Y/N
An e-publishing company is in the process of converting e-book in the Yes
Frame
1 form of document image to text. Discuss on the challenges faced by the 1 Understand Medium (UGC Introduction
Buffer
1 2
NET)
company in implementing the process.
Random
2 Compute the resolution of a 2 X 2 inch image that has 512 X 512 pixels. 1 Apply Medium No Introduction Scan 1 2
Display
If we want to resize a 1024 X 768 image to one that is 640 pixels wide the Frame
3 1 Remember Low No Introduction 1 2
same aspect ratio, find out the height of the resized image? Buffer
If we use 2-byte pixel values in a 24 bit lookup table representation, Find Frame
4 1 Remember Low No Introduction 1 2
how many bytes does the lookup table occupy? Buffer
List the steps required to plot a line whose slope is between 0 degree and Frame
5 1 Remember Low No Introduction 1 2
45 degree using the slope intercept equation? Buffer
List steps are required to plot a line whose slope is between 0 degree and Frame
6 1 Remember Low No Introduction 1 2
45 degree using Bresenham’s Algorithm? Buffer

Calculate the pixel location approximating the first octant of a circle Yes
Types of
7 1 Apply Medium (UGC Introduction 1 6
having centre at (4, 5) and radius 4 units using Bresenham algorithm. CG
NET)
List the steps are required to generate a circle using the polynomial Types of
8 1 Remember Low No Introduction 1 2
method? CG
Yes
List the steps are required to generate a circle using the trigonometric Points and
9 1 Remember Low (UGC Introduction 1 2
method? Lines
NET)
 Points and
10 Define Computer Graphics. 1 Remember Low No Introduction
Lines
1 2

Write bresenham’s line drawing algorithm and trace the algorithm for the Points and
11 1 Apply Medium No Introduction 1 6
given points (2, 1) to (10, 12) Lines
Consider a raster system with a resolution of 1024 X 1024. Calculate the Points and
12 1 Remember Low No Introduction 1 2
size of raster needed to store 4 bit per pixel. Lines
Raster
13 Define halftone image? 1 Remember Low No Introduction Scan 1 2
Display
Raster
14 What is aspect ratio? 1 Understand Medium No Introduction Scan 1 2
Display
Yes Raster
Using the Bresenham line generation algorithm, digitize the line with end
15 1 Analyze Medium (UGC Introduction Scan 1 6
points (20, 10) and (30, 18). NET) Display
Introducti
16 Compare Bresenham line generation with DDA line Generation. 1 Understand Medium No Introduction
on
1 6

Using the Bresenham line generation algorithm, digitize the line with end
17 1 Evaluate High No Introduction Points 1 6
points (15, 5) and (25, 13).
Rasterize the line from (-1,1) to (5,-8) using Bresenham’s line drawing
18 1 Apply Medium No Introduction Lines 1 6
Algorithm.
Yes
19
Given radius r=10 determine positions along with the circle octants in 1st 1 Apply Medium (UGC Introduction Lines 1 10
Quadrant from x=0 to x=y. NET)
Do you need to generate the full circumference of the circle using the Yes
Introducti
20 algorithm, or can we generate it in a quadrant or octant only and then use 1 Understand Low (UGC Introduction
on
1 2
it to produce the rest of the circumference? NET)

Given a circle radius r=5 determine positions along the circle octants in Circle
21 1 Apply Medium No Introduction 1 6
1st Quadrant from x=0 to x=y. Algorithm
Using midpoint circle generation algorithm, compute the coordinates of
Circle
22 points that lie on the circumference of the circle with radius 5 and center 1 Analyze High No Introduction
Algorithm
1 10
as (7,7).
Distinguish between scan line polygon fill and seed fill (flood fill) Circle
23 1 Analyze High No Introduction 1 9
algorithm. Algorithm
Yes
Circle
24 How vector CRT is different from Raster CRT. 1 Remember Low (UGC Introduction
Algorithm
1 2
NET)
25
Introducti
26 Consider a Non-Interlaced raster system with resolution of 1280 By 1024, 1 Remember Low No Introduction
on
1 2
 a refresh rate of 60 Hz, a horizontal retrace time of 5 Microseconds and a
vertical retrace time of 500 μs. What is the fraction of the total refresh
time per frame spent in horizontal retrace of the electron beam?
Find the equation of the line y’=mx’+b in xy coordinates if the x’y’
Ellipse
27 coordinate system results from a 90 degree rotation of the xy coordinate 1 Understand Medium No Introduction
Algorithm
1 6
system.
What are the criteria of generating a straight line on raster scan display Yes
Ellipse
28 1 Understand Medium (UGC Introduction 1 6
device? Algorithm
NET)
Yes
Ellipse
29 Explain shadow mask and beam penetration method. 1 Understand Medium (UGC Introduction
Algorithm
1 6
NET)
Yes
30 Explain Scan line fill polygon filling algorithm. 1 Understand Medium (UGC Introduction Attributes 1 6
NET)
Line
31 Explain midpoint ellipse algorithm 1 Remember Low No Introduction
Algorithm
1 2
Line
32 Differentiate emissive and non-emissive displays? 1 Understand Medium No Introduction
Algorithm
1 2
Line
33 Explain: Sampling and quantization 1 Understand Medium No Introduction
Algorithm
1 2

State whether the given statement is true or false: “Fluorescence is the

34 term used to describe the light off by a phosphor after it has been exposed 1 Evaluate High No Introduction Display 1 4
to an electron beam”. Explain your answer.
If a boundary is 8-connected, can 8-boundary fill algorithm be used to fill Midpoint
35 1 Apply Medium No Introduction 1 6
the region bounded by that boundary? If no, Why? Algorithm
Define seed-fill algorithms? Write 8-connected region filling algorithm? Yes
Midpoint
36 Out of 4-connected and 8-connected seed fill algorithm, which algorithm 1 Apply Medium (UGC Introduction
Algorithm
1 8
would you use to fill 8-connected boundary region? NET)
Yes
Midpoint
37 Write are the principal of vanishing point? 1 Understand Medium (UGC Introduction
Algorithm
1 6
NET)
Input
38 Explain in detail working of shadow mask and beam penetration CRT. 1 Remember Low No Introduction
Devices
1 2

39
List steps are required to plot a line whose slope is between 0 to 60 degree 1 Understand Medium No Introduction
Input
1 2
using Bresenham’s method? Devices
Give an equation for the plane containing the point (0,0,0) and normal to Input
40 1 Apply Medium No Introduction 1 6
vector (-1,0,-1). Devices
Yes Output
41 Discuss why is the electron beam allowed to overscan? 1 Understand Low
(UGC
Introduction
Primitives
1 2
 NET)
Output
42 Explain the 3D display methods. 1 Evaluating High No Introduction
Primitives
1 4

When 8 way symmetry is used to obtain a full circle from pixel

coordinates generated for the 0 degree to 45 degree or the 90 degree to 45 Output
43 1 Remember Low No Introduction 1 6
degree octant, certain pixels are set or plotted twice. This phenomenon is Primitives
sometimes referred to as overstrike. Justify where overstrike occurs.
3D
44 List steps required to generate an ellipse using polynomial method? 1 Remember Low No Introduction
Display
1 2

When 4-way symmetry is used to obtain a full ellipse form pixel Yes
Display
45 coordinates generated for the first quadrant, does overstrike occurs? 1 Analyze High (UGC Introduction
Devices
1 10
Where? NET)

List the operating characteristics for the folLowing display technologies: Yes
Introducti
46 1 Apply Medium (UGC Introduction 1 6
raster refresh systems, vector refresh systems, plasma panels, and .CDs. on
NET)
Determine the resolution (pixels per centimeter) in the x and y directions
47
for the video monitor in use on your system. Determine the aspect ratio, 1 Apply Medium No Introduction
Display
1 6
and explain how relative proportions of objects can be maintained on your Devices
system.
Consider three different raster systems with resolutiuns of 640 by 400,
1280 by 1024 and 2560 by 2048. What size frame buffer (in bvtejl is Introducti
48 1 Apply Medium No Introduction 1 6
needed for each of these systems to store 12 bits per pixel? How, much on
storage is required for each system if 24 bits per pixel are to be stored?
Suppose an RGB raster system is to be designed using an 8-inch by 10-
inch screen with a resolution of 100 pixels per inch in each direction. If Introducti
49 1 Remember Low No Introduction 1 2
we want to store h bit5 per pixel in the frame buffer, how much storage on
(in bytes) do we need for the frame buffer?
Yes
Introducti
50 Define refreshing of the screen? 1 Remember Low (UGC Introduction
on
1 2
NET)
Display
51 List out the merits and demerits of DVST. 1 Remember Low No Introduction
Devices
1 2
Yes
Introducti
52 Describe in detail about the DDA scan conversion algorithm? 1 Understand Medium (UGC Introduction
on
1 6
NET)
Write down and explain the midpoint circle drawing algorithm. Assume Introducti
53 1 Understand Medium No Introduction 1 6
10 cm as the radius and co-ordinate origin as the centre of the circle. on
Display
54 Explain in detail about Bresenham‟s ellipse generating algorithm. Give 1 Analyze Medium No Introduction
Devices
1 10
 example.
Display
55 Differentiate raster and random scan systems. 1 Remember Low No Introduction
Devices
1 6

UNIT-II TRANSFORMATIONS

Competi
Bloom’s tive
S. C Difficult Mar
Questions Taxonomy Exam Area Topic Unit
No. O y Level ks
Level Questio
n Y/N
Basic
1 Define Transformation. 2 Apply Medium No Transformation
Transformation
2 2
2 List out the various Text clipping. 2 Remember Low No Transformation Clipping 2 2
Window to
3 Explain about window to viewport coordinate transformation. 2 Remember Low No Transformation viewport 2 8
coordinate
Cohan
4 Write a detailed note on the basic two dimensional transformations. 2 Understand Medium No Transformation
Sutherland
2 6

Explain with an example the Cohen-Sutherland line clipping Yes

5 2 Analyze Medium (UGC Transformation Liang barsky 2 6
algorithm. NET)
Compare Cohen-Sutherland line clipping algorithm and Liang- Polygon
6 2 Understand Medium No Transformation 2 6
Barsky line clipping algorithm. Clipping
Write the general form of the matrix for rotation about a point P(h, Basic
7 2 Evaluate High No Transformation 2 10
k). transformation
Perform a 45 degree rotation of triangle A(0, 0), B(1, 1), C(5, 2) Basic
8 2 Apply Medium No Transformation 2 8
about P(-1, -1) transformation
Yes
9
Magnify the triangle with vertices A(0, 0), B(1, 1) and C(5, 2) to 2 Apply Medium (UGC Transformation
Basic
2 6
twice its size while keeping C(5, 2) fixed. transformation
NET)
Reflect the diamond shaped polygon whose vertices are A(-1, 0), Yes
Basic
10 2 Apply Medium (UGC Transformation 2 6
B(0, -2), C(1, 0) and D(0, 2) about the line y=x+2. transformation
NET)

11
The matrix defines a transformation called a simultaneous 2 Apply Medium No Transformation
Basic
2 6
transformation
shearing for short. The special case when b=0 is shearing in the x
 direction. When a=0, we have shearing in the y direction. Illustrate
the effect of these shearing transformations on the square A(0, 0),
B(1, 0), C(1, 1), and D(0, 1) when a=2 an b=3.
1. An observer standing at the origin sees a point P(1, 1). If the point is
translate one unit in the direction v=1, its new coordinate position is
12 P’(2, 1). Suppose instead that the observer stepped back one unit 2 Apply Medium No Transformation Clipping 2 6
along the x axis. What would be the apparent coordinates of P with
respect to the observer?
2. Find the instance transformation which places a half size copy of the
Window
13 square A(0, 0), B(1, 0), C(1, 1) and D(0, 1) into a master picture 2 Remember Low No Transformation 2 2
coordinate
coordinate system so that the centre of the square is at (-1, -1).
3. Find the mirror image of the triangle ABC about y=x axis with the
Basic
14 help of matrices. What do you understand by homogeneous 2 Remember Low No Transformation 2 2
transformation
coordinates?
Basic
4.
15 What do you understand by clipping, windowing and viewport? 2 Understand Medium No Transformation
transformation
2 6

5. Explain the procedure to convert the normalized device coordinate to Yes

Basic
16 2 Analyze Medium (UGC Transformation 2 6
transformation
the device coordinate used by the output device. NET)

6. Rotate a triangle ABC with vertices A(2, 3, 1), B(3, 4, 5) and C(5, 6, Window
17 2 Understand Medium No Transformation 2 6
coordinate
7) about a line Y = 2
7. Scale the surface A(2, 2, 2), B(4, 4, 4), C(5, 5, 5), D(6, 6, 6) with Composite
18 2 Evaluate High No Transformation 2 10
Translation
respect to point (7, 7)
8. Derive the general perspective termination onto a plane with reference
Basic
19 point R0(x0,y0,z0), normal vector N=n1l+n2 j+n3 K, using C(a,b,c) as the 2 Apply Medium No Transformation 2 2
transformation
centre of projection.
9. Prove that rotation followed by translation is not same as translation Yes
Composite
20 2 Apply Medium (UGC Transformation 2 6
Translation
followed by rotation in three dimension NET)

10. Derive transformation matrix for rotation about a line parallel to one Yes
Composite
21 2 Apply Medium (UGC Transformation 2 6
Translation
of the principle axis in space. NET)
22
11. Prove two translations are additive 2 Analyze High No Transformation Composite 2 10
 Translation
Composite
12.
23 Prove two Rotation are additive 2 Analyze High No Transformation
Translation
2 9
Yes
13.
24 Prove two Scaling are multiplication 2 Remember Low (UGC Transformation Clipping 2 6
NET)
25
14. How will you clip a point? 2 Apply Medium No Transformation Clipping 2 6
Composite
15.
26 What is the use of clipping? 2 Remember Low No Transformation
Translation
2 2

27
16. What is the relationship between the rotations Rᶱ, R-ᶱ, Rᶱ-1? 2 Understand Medium No Transformation Clipping 2 6

17. Why line clipping algorithms are not use for clipping a polygon on Yes
Basic
28 2 Understand Medium (UGC Transformation 2 6
transformation
line to line basis? NET)

18. Find the transformation A which aligns a given vector V with the Yes
Homogeneous
29 2 Understand Medium (UGC Transformation 2 6
Coordinate
vector K along the positive z-axis. NET)
19. Find out the conditions under which scaling and rotation forms a Yes
30 2 Understand Medium (UGC Transformation Clipping 2 6
commutative pair of operations. NET)
20. Define homogeneous coordinates. Mention the role do they play in Homogeneous
31 2 Remember Low No Transformation 2 2
Transformation
composite transformations?
21. Application program often use floating point numbers to define
picture, whereas the display uses integers. Should the conversion from
32 2 Understand Medium No Transformation Clipping 2 2
floating point to integer format be done before or after clipping?
How?
22. Write the three dimensional homogeneous transformation matrix for Homogeneous
33 2 Understand Medium No Transformation 2 2
scale z to double of its size. Representation
23. Find the form of transformation matrix for reflection about a line L Basic
34 2 Evaluate High No Transformation 2 9
with slope m and y-intercept (0, b) Transformation
24. Find out the conditions under which scaling and rotation forms a Composite
35 2 Apply Medium No Transformation 2 6
commutative pair of operations. Translation
25. A mirror is placed vertically such that it passes through the points (10, Yes
Composite
36 0) and (0, 10). Fin the reflected view of a triangle ABC with co 2 Apply Medium (UGC Transformation 2 2
Translation
NET)
ordinates A(5, 50), B(20,40), C(10,70).
26. Derive the transformation matrices for Reflection about line Y=-X, Yes Composite
37 2 Understand Medium Transformation 2 6
(UGC Translation
 X=Y. NET)
27. Give the transformation matrix for rotating a point P(x,y), about x-axis Composite
38 2 Remember Low No Transformation 2 2
by 90 degrees. Translation
28. Calculate the new position vector by Applying a translation in the xyz
Basic
39 direction by -2, -4 and -6 respectively on the homogeneous coordinate 2 Understand Medium No Transformation 2 2
Transformation
position vector [1,6,4].
29. Give a clipping window A(20, 20), B(60, 20), C(60, 40) and D(20, 40)
Basic
40 using Cohen Sutherland algorithm find the visibe portion of the line 2 Apply Medium No Transformation 2 6
Transformation
segment joining the point P(40, 80) Q(120, 30).
30. Consider the triangle A(4, 1), B(5, 2), C(4, 3). Rotate it by ann angle Yes
Basic
41 90 degrees about a point A. Give the coordinates of the rotated 2 Understand Low (UGC Transformation 2 2
Transformation
triangle. NET)

31. Consider a line AD with coordinates A(1, 1) an B(10, 10). Refect the
line about Y axis and then about the line Y=-X. Let this be case 1. In Basic
42 2 Evaluating High No Transformation 2 10
case 2 simply rotate the line by -270 degrees. Prove that the Transformation
transformed object in both the cases is same.
32.
43
Rotate the point P(2, -4) about the origin 30 degrees in anti clockwise 2 Remember Low No Transformation
Composite
2 2
direction. Transformation
33. Derive the matrix representation of composite transformation.
44 2 Remember Low No Transformation Clipping 2 2
34. A polygon has four vertices locate at A(20, 10), B(60, 10) C(60, 30)
and D(20, 30). Calculate the vertices after Applying a transformation Basic
45 2 Understand Low No Transformation 2 2
matrix to double the size of polygon with point A located on the same Transformation
place.
35. Explain the method to rotate an object about an axis that is not parallel Yes
Basic
46 to the coordinate axis with neat block diagram and derive the 2 Understand Low (UGC Transformation 2 2
Transformation
NET)
transformation matrix for the same.
36. Explain about composite transformation in general and explain the Composite
47 2 Understand Low No Transformation 2 2
two successive translation Transformation
37. Explain about composite transformation in general and explain the Yes
Composite
48 2 Understand Medium (UGC Transformation 2 6
two successive Rotation NET)
Transformation

38. Explain about composite transformation in general and explain the Composite
49 2 Understand Medium No Transformation 2 6
two successive Scaling Transformation
Composite
50 Explain about composite transformation
39. in general and explain the 2 Understand Medium No Transformation 2 6
Transformation
 general pivot point rotation
Explain about composite transformation in general and explain the Composite
51 2 Understand Low No Transformation 2 6
general fixed point scaling Transformation
Find the reflection of a triangle defined by the vertices A(1,1), B(5,1) Circle
52 1 Apply Medium No Introduction 1 6
and C(1,5) about a line y=2x+10. Algorithm

UNIT – III THREE DIMENSIONAL

Comp
etitive
Bloom’s
S. Difficult Exam Mar
Questions CO Taxonomy Area Topic Unit
No. y Level Questi k
Level
on
Y/N
1 Explain in detail about three dimensional display methods.
1. 3 Understand Medium No 3D 3D Display 3 6

2. Explain in detail about the boundary representation of three dimensional Object

2 3 Understand Low No 3D 3 6
Representation
objects.
3 Explain in detail about the three dimensional transformations.
3. 3 Understand Low No 3D Transformation 3 6

4 Explain in detail about 3D window to viewport coordinate transformation.

4. 3 Understand Medium No 3D Projection 3 6
Yes
5.
5 List the various representation schemes used in three dimensional objects? 3 Understand Medium (UGC 3D
Object
3 6
representation
NET)
6. Write short notes on rendering bi-cubic surface patches of constant u and v Object
6 3 Understand Medium No 3D 3 6
representation
method.
Object
7.
7 What are the steps involved in 3D transformation? 3 Understand High No 3D
representation
3 10
Object
8.
8 Write about view distance? 3 Understand Medium No 3D
representation
3 2
Yes
9.
9 What you mean by parallel projection? 3 Understand Medium (UGC 3D
Object
3 6
representation
NET)
 Yes
10.
10 Define Perspective projection? 3 Apply Medium (UGC 3D
Object
3 6
representation
NET)
Object
11.
11 Define Projection reference point? 3 Apply Medium No 3D
representation
3 2
Object
12.
12 Define the use of Projection reference point? 3 Apply Medium No 3D
representation
3 2
Object
13.
13 List the different types of parallel projections? 3 Remember Low No 3D
representation
3 2
Object
14.
14 Define orthographic parallel projection? 3 Remember Low No 3D
representation
3 2
Object
15.
15 Define orthographic oblique projection? 3 Understand Medium No 3D
representation
3 2
Yes
16.
16 Define an axonometric orthographic projection? 3 Analyze Medium (UGC 3D
V Object
3 2
representation
NET)
V Object
17.
17 Define cavalier projection? 3 Understand Medium No 3D
representation
3 2
Object
18.
18 Define cabinet projection? 3 Evaluate High No 3D
representation
3 2
Object
19.
19 Define vanishing point? 3 Apply Medium No 3D
representation
3 2
Yes
20.
20 Define principle vanishing point. 3 Apply Medium (UGC 3D
Object
3 2
representation
NET)
Yes
21.
21 Define view reference point? 3 Apply Medium (UGC 3D
Object
3 2
representation
NET)
Object
22.
22 Define Projection. 3 Analyze High No 3D
representation
3 2

23. Briefly explain about the basic transformations performed on three

23 3 Analyze High No 3D Projection 3 8
dimensional objects.
Yes
24.
24 Write short notes on parallel and perspective projections. 3 Remember Low (UGC 3D Projection 3 2
NET)
25. Derive the 3D transformation matrix for rotating an object by an angle in the
25 3 Apply Medium No 3D Projection 3 6
direction of Y Z plane.
26. Derive transformation matrix for 3D scaling folLowed by rotation about fixed
26 3 Remember Low No 3D Projection 3 2
point
27. Define isometric projection in 3D graphics
27 3 Understand Medium No 3D Projection 3 6
28. Explain the terms projection plan, view volume with references to 3D
28 3 Understand Medium Yes 3D Projection 3 6
 graphics, State and explain the anomalies of perspective projection. (UGC
NET)
Yes
29.
29 How can the effect of aliasing be minimized? 3 Understand Medium (UGC 3D Projection 3 6
NET)
30. Determine the 3D transformation matrices to scale a line PQ in the x direction Yes
30 by 3 by keeping point P fixed. To rotate this line by 45 degree anti-clockwise 3 Understand Medium (UGC 3D Projection 3 6
about the Z axis. Give P(1, 5, 2) and Q(4, 5, 6). NET)

31
31. Explain different 3D object representation in detail. 3 Remember Low No 3D Projection 3 10
32. Derive the 3D transformation matrix for rotation on an arbitrary axis.
32 3 Understand Medium No 3D Projection 3 2
33
33. Derive the 3D transformation matrix for rotation on an arbitrary plane. 3 Understand Medium No 3D Projection 3 2

34
34. What do you meant Blobby object? 3 Unerstand High No 3D Projection 3 4

35
35. Define Octrees 3 Apply Medium No 3D Projection 3 6
Yes
36.
36 Distinguish between convex and concave polygons 3 Apply Medium (UGC 3D Projection 3 2
NET)
37. Determine the projected image on the xy plane of a tetrahedron
ABCD= using standard single point perspective transformation. Yes
37 3 Understand Medium (UGC 3D Projection 3 6
The distance of the vanishing point P on the view plane may be taken as 5 NET)

units.
38. Set up a procedure for establishing polygon tables for any input set of data
38 3 Remember Low No 3D Projection 3 2
points defining an object.
39. Given the plane parameters B, B, C, and D for all surfaces of an object, devise
39 an algorithm to determine whether any specified point is inside or outside the 3 Understand Medium No 3D Projection 3 2

object.
40. How would the values for parameters A, B, C, and D in the equation of a plane
Object
40 surface have to be altered if the coordinate reference is changed from a right 3 Apply Medium No 3D 3 10
representation
handed system to a left-handed system?
41. Prove that the multiplication of three dimensional transformation matrices for Yes
Object
41 3 Understand Low (UGC 3D 3 10
representation
each of the folLowing sequence of operations is commutative NET)
 Object
42 a) Any two successive translations. 3 Evaluating High No 3D
representation
3 10
Object
43 b) Any two successive scaling operations. 3 Remember Low No 3D
representation
3 10

44 c) Any two successive rotations about any one of the coordinate axes 3 Remember Low No 3D Transformation 3 10

42. Derive the transformation matrix for scaling an object by a scaling factor s in
45 3 Understand Low No 3D Transformation 3 2
a direction defined by the direction angles α, β, γ.
43. Discuss a procedure for rotating an object that is represented in an octree Yes
46 3 Understand Low (UGC 3D Transformation 3 4
structure. NET)

44. Develop a procedure to converting an object defined in one coordinate

47 3 Understand Low No 3D Transformation 3 8
reference to anv other coordinate system defined device to the first system.
Yes
45.
48 Show that the Rotation matrix is equal to the composite matrix R y(β).Rx(α) 3 Understand Medium (UGC 3D Transformation 3 6
NET)
49
46. Write a procedure to perform a one-point perspective projection of an object. 3 Understand Medium No 3D Transformation 3 6

50
47. Write a procedure to perform a two-point perspective projection of an object. 3 Understand Medium No 3D Transformation 3 6

48. Extend the Sutherland-Hodgeman polygon clipping algorithm to clip three

51 3 Understand Low No 3D Transformation 3 6
dimensional planes against a regular parallelepiped.
49. Devise an algorithm to clip objects in a scene against a defined frustum.
52 Compare the operations needed in this algorithm to those needed In an 3 Remember Low No 3D Transformation 3 10

algorithm that clips against a regular parallel piped

50. Modify the two-dimensional Liang-Barsky line-clipping algorithm to clip a
53 3 Understand Medium No 3D Transformation 3 8
given polyhedron against a specified regular parallelepiped
 UNIT – IV CURVES AND SURFACES

Competiti
Bloom’s
S. Difficult ve Exam
Questions CO Taxonomy Area Topic Unit Mark
No. y Level Question
Level
Y/N
Yes (UGC Curves and
1 Define Polygon mesh? 4 Analyze Medium
NET) Surface
Illumination 4 6
Curves and
2 Define Bezier Basis Function? 4 Understand Medium No
Surface
Illumination 4 6
Curves and
3 Define surface patch? 4 Evaluate High No
Surface
Illumination 4 10
Curves and
4 Write the advantages of rendering polygons by scan line method? 4 Apply Medium No
Surface
Illumination 4 2
Yes (UGC Curves and
5 Write the advantages of rendering by patch splitting? 4 Apply Medium
NET) Surface
Illumination 4 6
Yes (UGC Curves and Representati
6 Define B-Spline curve. 4 Apply Medium
NET) Surface on
4 6
Curves and
7 Define spline? 4 Analyze High No
Surface
Illumination 4 10
Curves and
8 Write the use of control points? 4 Analyze High No
Surface
Illumination 4 9
Yes (UGC Curves and
9 List different ways of specifying spline curve? 4 Remember Low
NET) Surface
Illumination 4 2
Curves and
10 List the important properties of Bezier Curve?. 4 Apply Medium No
Surface
Illumination 4 6
Curves and
11 Differentiate between interpolation spline and approximation spline. 4 Remember Low No
Surface
Illumination 4 2
Curves and
12 Write about parabolic splines? 4 Understand Medium No
Surface
Illumination 4 6
Yes (UGC Curves and
13 Define cubic spline? 4 Understand Medium
NET) Surface
Illumination 4 6
Yes (UGC Curves and
14 Explain spline representation 4 Understand Medium
NET) Surface
Illumination 4 6

Define an efficient polygon representation for the cylinder. Justify your Yes (UGC Curves and Representati
15 4 Analyze Medium 4 6
NET) Surface on
choice of the representation.
Curves and Representati
16 What do you mean by convex hull property of Bezier curves? 4 Understand Medium No
Surface on
4 6
Curves and Representati
17 Find the equation of the bazier curve which passes through (0,0) and (- 4 Understand Medium No
Surface on
4 6
 4,2) and controlled through (14,10) and (4,0)
Find the points on the Bezier curve which has starting and ending points Curves and Representati
18 4 Evaluate High No 4 10
P0(2, 3) and P3(4, -3) and controlled by P1(5, 6) and P2(7, 1) for u=0.9. Surface on

Show that the Bezier curve always touches the starting point (for u=0) Curves and
19 4 Apply Medium No Light 4 2
Surface
and the ending point (for u=1).
Give a detailed note on the ways in which motion of object can be Yes (UGC Curves and
20 4 Apply Medium Light 4 6
specified in an animation system. NET) Surface
What is a Koch curve? Yes (UGC Curves and
21 4 Apply Medium Light 4 6
NET) Surface
What is CSG technique? Curves and
22 4 Analyze High No Light 4 10
Surface
Determine the blending function for uniform periodic B-spline curve for Curves and
23 4 Analyze High No curve 4 9
n=4, d=4. Surface
Explain in detail about quadric surface. Yes (UGC Curves and
24 4 Remember Low Curve 4 2
NET) Surface
Deflne an efficient polygon representation for a cylinder. justify your Curves and
25 4 Apply Medium No Curve 4 2
choice of representation. Surface

26
Se: up an algorithm for converting any specified sphere, ellipsoid, or 4 Remember Low No
Curves and
Curve 4 2
cylinder to a polygon-mesh representation Surface
Write a routine to display a two-dimensional, cardinal-spline curve, Curves and
27 4 Understand Medium No Spline 4 6
given an input set of control points in the xy plane. Surface
Determine the quadratic Bazier blending functions for three control Yes (UGC Curves and
28 4 Understand Medium Spline 4 6
points. Plot each function and label the maximum and minimum values NET) Surface
Determine the Bezier blending functions for five control points. Plot Yes (UGC Curves and
29 4 Understand Medium B spline 4 6
each function and label the maximum and minimum values. NET) Surface
Write an efficient routine to display two-dimensional, cubic Bezier Yes (UGC Curves and
30 4 Understand Medium B spline 4 6
curves, given a set of four control points in the xy plane. NET) Surface
Determine the blending functions for uniform, periodic B-spline curves Curves and
31 4 Remember Low No BSpline 4 2
for d = 5. Surface
Determine the blending functions for uniform, periodic B-spline curves Curves and
32 4 Understand Medium No B Spline 4 2
for d = 6. Surface
Explain a cubic Bezier curve using a subdivision method Curves and
33 4 Understand Medium No Spline 4 2
Surface
Write a Procedure to display any specified conic in the xy plane using a Curves and
34 4 Evaluate High No Spline 4 9
rational Bazier-spline representation Surface
 Set up an algorithm for loading a quadtree representation of a scene into Polygon
Curves and
35 4 Apply Medium No Representati 4 6
a frame buffer for display of the scene. Surface
on

36
Develop an algorithm for performing constructive solid-geometry 4 Apply Medium
Yes (UGC Curves and Blobby
4 2
modeling using a primitive set of solids defined in octree structures NET) Surface Object
Develop procedure for generating the description o i .3 three- Polygon
Yes (UGC Curves and
37 dimensional object using input parameters that define the object in terms 4 Understand Medium
NET) Surface
Representati 4 6
on
of a rotational sweep.
Develop an algorithm for encoding a two-dimensional scene as a Curves and Blobby
38 4 Remember Low No 4 2
quadtree representation. Surface Object
Using the random, midpoint-displacement method, write J routine to Polygon
Curves and
39 4 Understand Medium No Representati 4 2
create a mountain outline starting with a horizontal line in the xy plane Surface
on
Write a procedure to interactively select different color combinations for Curves and Blobby
40 4 Apply Medium No 4 6
displaying the Mandelbrot set. Surface Object
 UNIT – V SURFACE DETECTION & ILLUMINATION MODEL

Competitive
Bloom’s
S Difficulty Exam
Questions CO Taxonomy Area Topic Unit Mark
No. Level Question
Level
Y/N
1 Mention some surface detection methods. 5 Understand Medium No Graphics Shadow 5 6

2 What is tweening? 5 Evaluate High No Graphics Shadow 5 10

3 Discuss on Grammar based models in detail. 5 Apply Medium No Graphics Shadow 5 2

Yes (UGC
4 What do you mean by shading of objects? 5 Apply Medium
NET)
Graphics Shadow 5 6

List the properties of light? Yes (UGC

5 5 Apply Medium Graphics Shadow 5 6
NET)

6 What are the types of reflection of incident light? 5 Analyze High No Graphics Shadow 5 10
Surface
7 Define rendering 5 Analyze High No Graphics
Detection
5 2
Surface
8 Differentiate flat and smooth shading 5 Analyze High No Graphics
Detection
5 9
Yes (UGC Surface
9 What is a shadow? 5 Remember Low
NET)
Graphics
Detection
5 2
Surface
10 What are two methods for computing shadows? 5 Apply Medium No Graphics
Detection
5 6
Surface
11 Write any two Drawbacks of Phong Shading 5 Remember Low No Graphics
Detection
5 2
Surface
12 What are the two common sources of textures? 5 Understand Medium No Graphics
Detection
5 6
Yes (UGC Surface
13 Write two types of smooth shading. 5 Understand Medium
NET)
Graphics
Detection
5 6

Develop a procedure, based on a back-face detection technique, for

Yes (UGC Surface
14 identifying all the visible faces of a convex polyhedron that has different- 5 Understand Medium Graphics 5 6
NET) Detection
colored surfaces. Assume that the object is defined in a right-handed viewing
 system with the xy-plane as the viewing surface.
Implement a back-face detection p r ~ e d u r eus ing an orthographic parallel
projection to view visible faces of a convex polyhedron. Assume that all Yes (UGC Surface
15 5 Analyze Medium Graphics 5 6
NET) Detection
parts of the object are in front of the view plane, and provide a mapping onto
a screen viewport for display.
Implement a back-face detection procedure using a perspective projection to
view visible faces of a convex polyhedron. Assume that all parts of the Surface
16 5 Understand Medium No Graphics 5 6
Detection
object are in front of the view plane, and provide a mapping onto a screen
viewport for display.
Implement the depth-buffer method to display the visible surfaces of a given Surface
17 5 Understand Medium No Graphics 5 6
Detection
polyhedron.
How can the storage requirements for the depth buffer bedetermined from Surface
18 5 Evaluate High No Graphics 5 10
Detection
the definition of the objects to be displayed?
Implement the depth-buffer method to display the visible surfaces in a scene
Surface
19 containing any number of polyhedrons. Set up efficient methods for storing 5 Apply Medium No Graphics 5 2
Detection
and processing the various objects in the scene.
Implement the A-buffer algorithm to display a scene containing both opaque
Yes (UGC Surface
20 and transparent surfaces. As an optional feature, you[ algorithm may be 5 Apply Medium Graphics 5 6
NET) Detection
extended to include antialiasing.
Develop a depth-sorting program to display the visible surfaces in a scene Yes (UGC Surface
21 5 Apply Medium Graphics 5 6
NET) Detection
containing several polyhedrons.
Discuss how antialiasing methods can be incorporated into the various Surface
22 5 Analyze High No Graphics 5 10
Detection
hidden-surface elimination algorithms.
Devise an algorithm for viewing a single sphere using the ray-casting Surface
23 5 Analyze High No Graphics 5 9
Detection
method.
Yes (UGC Surface
24 Discuss how wireframe displays might be generated with the various visible- 5 Remember Low
NET)
Graphics
Detection
5 2
 surface detection methods discussed in this chapter.
Surface
25 Write a procedure to render a polygon interface mesh using Phong shading 5 Apply Medium No Graphics
Detection
5 6

Discuss how different visible surface methods can be combined with Color
26 5 Remember Low No Graphics 5 2
Consieration
intensity model for displaying a set of polyhedrons with opaque surface.
27 Define intensity of light. 5 Understand Medium No Graphics Illumination 5 6
Yes (UGC
28 Explain about shading and graphics pipeline. 5 Understand Medium
NET)
Graphics Illumination 5 6
Yes (UGC
29 Compare Flat shading and Smooth shading. 5 Understand Medium
NET)
Graphics Illumination 5 6
Yes (UGC
30 Explain Gouraud shading and Phong shading. 5 Understand Medium
NET)
Graphics Light 5 6

31 Explain Back face detection method and Depth buffer method 5 Remember Low No Graphics Light 5 2

32 Explain area subdivision and A- Buffer method 5 Understand Medium No Graphics Light 5 2

33 Define frame. 5 Understand Medium No Graphics Light 5 2

Specular
34 What is computer graphics realism? 5 Evaluate High No Graphics
reflection
5 9
Specular
35 How realistic pictures are created in computer graphics? 5 Apply Medium No Graphics
reflection
5 6
Yes (UGC
36 Define Fractals and Koch curve? 5 Apply Medium
NET)
Graphics Scan method 5 2
Yes (UGC
37 Give an account about Peano curves. 5 Understand Medium
NET)
Graphics Scan method 5 6

Explain the methods for crating images by means of iterated function

38 5 Remember Low No Graphics Scan method 5 2
systems.
Hidden
39 Explain about the Mandelbrot set and Julia sets 5 Understand Medium No Graphics surface 5 2
detection
Hidden
40 Explain about reflections and transparency. 5 Apply Medium No Graphics surface 5 6
detection
Hidden
41 Explain the Boolean operations that can be performed on objects. 5 Understand Low
Yes (UGC
Graphics surface 5 2
NET)
detection
Back face
42 Describe the different techniques used in the animation control mechanisms 5 Evaluating High No Graphics
detection
5 10
Back face
43 Explain: (A). Standard motions in key frame animation, (B)Image synthesis 5 Remember Low No Graphics
detection
5 2
 Back face
44 What is meant by diffuse and specular reflection? 5 Understand Medium No Graphics
detection
5 2
Back face
45 Explain Gourard method for shading. 5 Understand Medium No Graphics
detection
5 2
Back face
46 Describe in detail z-buffer algorithm for visible surface detection. 5 Understand Medium No Graphics
detection
5 6

Explain depth buffer algorithm for hidden surface removal in three Yes (UGC Back face
47 5 Understand Medium Graphics 5 6
NET) detection
dimensional objects.
Yes (UGC Back face
48 Discuss the various animation techniques in detail with example for each. 5 Understand Medium
NET)
Graphics
detection
5 6

Which shading model do you use to render shiny plastic or glass objects? Yes (UGC Back face
49 5 Analyze Medium Graphics 5 6
NET) detection
Why?
How can you improve the realism of objects using reflection mapping Back face
50 5 Understand Medium No Graphics 5 6
detection
technique?
Hidden
51 Explain the process of adding image texture onto surfaces. 5 Understand Medium No Graphics surface 5 2
detection
Explain in detail about the properties of light and draw chromaticity Hidden
52 5 Apply Medium No Graphics surface 5 6
diagram. detection

Describe the process of Ray Tracing. Explain how it is used to create Hidden
Yes (UGC
53 5 Understand Low Graphics surface 5 2
NET)
Reflection and Transparency. detection
Back face
54 Explain the vector interpolation techniques used by phong shading model. 5 Evaluating High No Graphics
detection
5 10

External Expert:
Dr. Naveen Kumar,
Professor,
IGNOU,
Contact: +09716518686,
E-Mail: [email protected]
Research Area: Digital Imaging

Appendix II

Bloom’s Taxonomy Levels Distribution of Questions in Question Bank

School of Computing Science and Engineering

Date: 09 Jan 2019 Course Name: Computer Graphics Course Code: CSE323

Serial
Bloom’s Taxonomy Level Percentage Distribution
No.

1 Knowledge 34%

2 Understand 22%
 3 Apply 9%

4 Analysis 20%

5 Evaluate 5%

6 Create 10%

Signature of Course Coordinator/DC:

Signature of Dean:

IQAC:

Appendix III

Difficulty Levels Distribution of Questions in Question Bank

School of Computing Science and Engineering

Date : 09 Jan 2019 Programme / Sem : B.Tech / III Yr / VI Sem

Course Name : Computer Graphics Course Code : CSE323

Serial No. Difficulty Level Percentage Distribution

 1 Low 26%

2 Medium 60%

3 High 14%

Signature of Course Coordinator/DC:

Signature of Dean:

IQAC: