On Line Question Bank

Computer Graphics (CS-309)

B-Tech5th Semester

Very short Questions (2 marks)

1. What do you understand by clipping?

2. Bresenham’s line drawing algorithm uses integer arithmetic.
What is the justification for this approach?
3. Why are homogeneous coordinates used for transformation
computations in Computer Graphics?
4. What is Z-buffer algorithm for removing hidden faces?
5. Why is a shadow mask used? Why is it needed?
6. Differentiate between view port and window.
7. What are orthographic projections? When do we need them?
8. What are the merits and demerits of various techniques for
hidden surface removal?
9. Explain the method of generating a raster image.
10. What are the basic attributes of graphics storage systems used
to evaluate competing storage systems?
11. What are the basic attributes of graphics storage systems used
to evaluate competing storage systems?
12. What is retracing blanking?
13. What happens to the pictures that are too large to fit on the
screen?
14. Define word size. What would be the maximum possible size
of the computer’s instruction set if it were based on a processor
with a 16-bit word size?
15. How can the effects of aliasing be minimized?
16. Find the equation of the line when its co-ordinates x and y
are rotated by 90 degree.
17. Compare the techniques of Phong and Gourard shading.
18. What is rendering? What are different stages of rendering and
image?
19. Align the vector V=I+J+K with vector K.
20. What are Bezier and b-spline curves different from non-
periodic B-spline curves?
21. What are the various input devices used for Graphics?
22. How are periodic B-spline curves different from non-periodic
B-spline curves?
23. What are the various input devices used for Graphics?
24. Explain why double buffering is needed to maintain display
files.
25. List different properties for designing curve and surfaces.
26. What are the positioning constraints?
27. What are graphics primitives? List them.
28. Define scan Conversion.
29. Write a routine to split a concave polygon using the vector
method?
30. Derive the matrix representation fort a workstation
transformation?
31. Write a routine to split a concave polygon using the rotation
method?
32. Modify the boundary-fill algorithm for a 4-connected region
to avoid excessive stacking by incorporating scan-line methods.
33. Write a program to display a bar graph in any selected screen
area .use the poly –line function to draw the bars.
34. Write a short note on electrostatic plotter.
35. Write a short note on cameras.
36. Give the comparison between various monochrome and color
hardcopy devices.
37. Write a short note on:
a) Beam penetration technique
b) Shadow mask technique
38. Explain the working of direct -view storage tubes.
39. List the advantages and disadvantages of DVST.
40. List the important characteristics of video display devices.
41. Write a short note on:
a) Flat Panel Display
b) Plasma panel Display
42. What is aliasing? Explain different methods of minimizing its
effect.
43. Explain the steps in mid point circle drawing algorithm.
44. Explain the steps in mid point ellipse algorithm.
45. Discuss different method of character generation.
46. Discuss the merits and demerits of real time scan conversion
and run length encoding.
47. Write a short note on viewing transformation.
48. Distinguish between view port and window.
49. What do you mean by normalization transformation? Why it
is needed?
50. Derive the transformation matrix for 2-D viewing
transformation?
51. Explain the Sutherland and Cohen subdivision algorithm for
line clipping.
52. Explain the mid point subdivision method of clipping a line
segment.
53. Explain the Cyrus -Beck algorithm for generalized line
clipping.
54. Explain Liang-Barsky line clipping algorithm.
55. Explain Sutherland-Hodgeman algorithm for polygon
clipping.
56. What do you main by interior and exterior clipping?
57. Explain how exterior clipping is useful in multiple window
environments.
58. Show how shear transformation may be expressed in terms of
rotation and scaling.
59. Find out final transformation matrix, when point p(x,y) is to
be reflected about a line : y=mx+c.
60. Prove that successive 2D rotation are additive.
61. What is the need of homogeneous coordinates? Give the
homogenous coordinates for translation, rotation, and scaling.
 62. What do you mean by composite transformation? How it is
useful?
63. Explain the two approaches used to determine hidden
surfaces.
64. Discuss the techniques for efficient visible surfaces algorithm.
65. What is coherence? Discuss various types of coherence that
can be used to make visible surface algorithm more efficient.
66. List the advantages of interactive Graphics.
67. Explain the resprentative uses of Computer Graphics.
68. Explain the classification use of Computer Graphics.
69. Draw andExplain the conceptual framework of inertactive
graphics.
70. Explain the basic concept in line drawing.
71. Explain the steps in the incremental line drawing.
72. Explain the steps in DDA line drawing algorithm.
73. Explain the steps in Bresnham’s line drawing algorithm.
74. Explain the steps in generalized Bresenham’s line drawing
algorithm.
75. What is Polygon? Explain different type of polygons.
76. Explain the various approaches used to represent polygon.
77. What is a Display file?
78. Write the difference between the display file and scan
conversion.
79. Explain the polygon entering algorithm in the display file.
80. Explian the boundary fill algorithm in detail.
81. Explain the steps required to fill the polygon using flood fill
technique.
82. Explain the steps required in the line algorithm for filling the
polygon.
83. What is the need of y-bucket and active edge list?
84. List various scan conversion techniques.
85. What is windowing and clipping?
86. What is point clipping and line clipping?
87. What is polygon clipping?
 Short questions (5 marks)

1. Give and explain the action of at least four turbo C/C++

output primitives and output of these output primitives.
2. Make a short note on functional characteristics of various
input device.
3. Derive the Bresenham’s circle algorithm .Generate the
intermediate points of a circle whose centre is at (0, 0) and
two given points on the circumference are (0, 10), and
(√10,√10) i.e., intermediate points in the second quadrant.
4. Find out the transformation matrix which reflects points
above the line, 3x+4y = 5.
5. Derive a composite matrix which maps a rectangular
window into a rectangular view port using the basic
geometric transformation in 2-D(i.e. using translation and
scaling)
6. Explain the different algorithms used for region filling. What
steps are required to be added to a fill algorithm if a region
is to be filled with a pattern?
7. Why need of hidden-surface algorithms? How does the Z-
buffer algorithm determine which surface are hidden?
8. Perform a 45 degree rotation of triangle A(0,0),B(1,1),C(5,2)
(a) About the origin (b) About the P(-1,-1)
9. Find the matrix of mirror reflection with respect to the plane
passing through the origin and having a normal vector whose
direction is N=I+J+K
10. What do you mean by a projection? Classify its different
types. What are the perspective anomalies?
11. What do you understand by the interactive computer
graphics? What are the essential components of an interactive
computer package?
12. Explain Brehsenham’s line drawing algorithm and use it to
find all points on a line drawn between ((0,0) and (3,8) in a
raster scan display.
13. Explain viewing transformation and discuss the role of
clipping in the applications of these transformations. Describe
any one 2-D clipping algorithm for lines.
14. List and explain functions of a Graphic package.
15. Name various pointing and positioning devices. Briefly
explain the working of any 2 devices.
16. Draw and explain the block diagram of typical workstation.
17. Explain the architecture of vector scan display.
18. Explain the architecture of raster scan display.
19. Explain the simple raster display system.
20. Explain the raster display system with peripheral display.
21. Explain the raster display system with integerated display
processor.
22. Write a short note on Video Controller.
23. Explain the random scan display system.
24. Write a short note on:
a) Keyboard
b) Mouse
c) Trackball and spaceball
d) Joystick
e) Digitizer
f) Light pens
g) Touch Panels
h) Scanner
25. Explain the important characteristics of hard copy devices.
26. Define dot size, addressability, Interdot distance and
resolution.
27. Give the characteristics of Printers.
28. Explain various types of printers.
29. Give the differences between line printer and dot matrix
printer.
30. List the features of ink-jet printer.
 31. Write a short note on Laser printer.
32. Explain the principle of thermal transfer printer.
33. Write a short note on pen plotter.
34. Write a short note on:
a. Perspective transformation
b. Extend and bounding volumes
c. Back face cutting
35. Explain the Z-Buffer algorithm for hidden surface removal.
36. Explain the advantages and disadvantages of Z-Buffer
Algorithm
37. Explain the depth sort algorithm for hidden surface removal.
38. Explain the binary space partition tree visible surface
Algorithm and write a pseudocode for building a BSP tree.
39. Explain the scan line algorithm for hidden surface removal.
40. Explain any one area subdivision algorithm for visible surface
Detection.
41. Write a pseudocode for Weiler-Atherton algorithm.
42. Give the important steps involved in Weiler-Atherton
Algorithm visible surface algorithm.
43. Explain A-Buffer visible surface algorithm.
44. Describe floating horizon algorithm.
45. Describe the back-face removal algorithm.

Long Questions(10 marks)

1.(a) Let P0 (0 ,0) , P1(1,2) , P2 (2,1) , P3 (3,1) , P4 (4 ,10 ) and

P5 (5 ,5 ) be given data points. If interpolation based on
B-splines is used to find a curve interpolating these data
points, Find a kont set t0--------------,t9 that can be used to
Define B-splines (cubic B-splines ).
(b) What is Ray-tracing algorithm? What are its advantages?
2. (a) what steps are required to plot a line whose slope is between
45degree and 90 degree.using bresenham’s method?
(b) Discuss and compare the working principles of the
following:
 o LCD’s
o Raster scan
o Vector Refresh

3. Draw a flowchart to illustrate the logic of Sutherland-Hodgeman

Algorithm. Explain this method with one example.
4. Deduce relations for the following 2-D transformations:
a. Translation
b. Rotation about origin
c. Scaling
d. Rotation about any arbitrary point
e. Scaling w.r.t. any point
f. Mirror
g. Mirror about any line.
5. Discuss the scan-line algorithm for the removal of hidden lines
from a scene of 3D graphics display.
6. a) What is the difference between random scan and raster scan?
b) Let a display system has a resolution of n x m pixels and it
can display p-simultaneous colors. What is the video display
memory required?
c) Define bandwidth of a graphic monitor.