Computer Graphics Unit 1 2 3 4 5 6 All Question Bank
Computer Graphics Unit 1 2 3 4 5 6 All Question Bank
COMPUTER GRAPHICS
June-2014
1. Define Persistence, Random scan and Raster scan displays? Explain functioning of flat panel
display. [6]
2. Write Bresenham’s line algorithm and find out which pixel would be turned on for the line
with end points (2, 2) to (6, 5) using the same. [6]
3. Explain Bresenham’s circle drawing algorithm with mathematical derivation. [6]
Dec-2014
June-2015
DEC-2015
1. Explain the following: (a) Frame Buffer, (b) Resolution, (c) Aspect Ratio. [6]
2. Find out points for line segment having end points (0,0) to (-8 -4) using DDA line drawing
algorithm. [6]
1 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
3. What is error factor in Bresenham’s circle drawing algorithm? Write Bresenham’s circle drawing
algorithm. [8]
4. Explain in brief: (a) Raster Scan Display (b) TIFF file format [4]
May-2016
1. Write and explain any four state of the applications of computer graphics. [4]
2. Explain significance of error term in Bresenham’s circle drawing algorithm. Explain
3. its mathematical derivation. [8]
4. Write a Bresenham’s line drawing algorithm. Compare pixel values for line P(0,0) to Q(6,6). [6]
5. Write short notes on: (a) Frame buffer (b) Display devices (c) Character Generation Methods [6]
Dec-2016
1. What is scan conversion? Using DDA algorithm rasterize a line from (0,0) to (6,7) [6]
2. Scan convert the line from (5,5) to (13,9) using Bresenham’s line drawing algorithm. [6]
2 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
June-2014
Dec-2014
1. Explain the different methods for testing a pixel inside a polygon. [5]
2. Explain Sutherland-Hodgeman clipping algorithm with example. [6]
June-2015
Dec-2015
May-2016
Dec-2016
1. Explain Boundary fill algorithm using recursive approach for 4-connected and 8-connected
pixels. [8]
3 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
June-2014
1. Write 2D transformation matrices of translation, scaling and shearing. Give the derivation of
2D rotation matrix. [6]
2. How to perform rotation about an arbitrary axis in 3-D. [6]
Dec-2014
1. Explain the concept of 3D rotation about an arbitrary axis with an example. [7]
2. Write transformation matrix for Scaling and Rotation and scale the polygon with co-ordinates
A(4, 5), B(8, 10) and C(8, 2) by 2 units in x-direction and 3 units in y-direction. Find the
transformed A, B and C points. [6]
June-2015
1. Write the transformation matrix for the scaling and translation. [2]
2. Explain the concept of 2D rotation about an arbitrary point with matrix representation. [4]
Dec-2015
1. Explain rotation about an arbitrary point. Generate transformation matrix for the same. [6]
2. Explain parallel and perspective projection with example. [4]
May-2016
1. What is homogeneous coordinate system? Derive transformation matrix for rotation about an
arbitrary point. [8]
2. Write matrices in homogeneous coordinate systems for the following transformations:
(i) 3-D rotation with respect to Y-axis (iii) 3-D scaling
(ii) 2-D reflection with respect to origin (iv) 2-D Y-shear [4]
4 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
June-2014
Dec-2014
1. What is a segment ? Give its structure and also describe various operations carried out on the
segment. [7]
2. What is the difference between conventional and computer based animations ? What are the
various methods of controlling animation? [7]
June-2015
Dec-2015
May-2016
COMPUTER GRAPHICS
Dec-2016
6 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
June-2014
1. Enlist hidden face removal algorithm and explain any two. [7]
2. Explain and compare shading algorithms. [6]
Dec-2014
1. Explain the light, reflectivity, color and shading in computer graphics. [5]
2. Explain and compare shading algorithms. [6]
3. Describe any two hidden face removal algorithm with diagram. [7]
June-2015
Dec-2015
May-2016
Dec-2016
1. Write a short note on following back face removal algorithm: (i) Painter algorithm (ii) Z-buffer [4]
2. Explain point source illumination and diffused illumination. [3]
7 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
June-2014
Dec-2014
1. Define Bezier curve. State its properties. Derive blending function of Bezier curve. [8]
2. Write a short note on 3D MaxStudio or Maya. [6]
3. Draw block diagram of i860. [6]
June-2015
Dec-2015
8 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]
COMPUTER GRAPHICS
May-2016
Dec-2016
1. Explain B-spline curve. What are its advantages over Bezier curve? [8]
2. What are fractals? Explain any two applications of fractals. [5]
3. Explain block diagram of i86 processor. [7]
4. Explain the significance of NVIDIA workstation in gaming. [4]
9 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]