0% found this document useful (0 votes)
81 views10 pages

Computer Graphics Unit 1 2 3 4 5 6 All Question Bank

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
81 views10 pages

Computer Graphics Unit 1 2 3 4 5 6 All Question Bank

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

lOMoARcPSD|47360048

Computer Graphics -unit-1-2-3-4-5-6 ALL question-bank

Computer Engineering (Savitribai Phule Pune University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university


Downloaded by Virendrasinh Patil ([email protected])
lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-I: GRAPHICS PRIMITIVES AND SCAN CONVERSION

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

1. What is computer graphics ? State the applications of computer graphics. [6]


2. Explain Bresenham’s line algorithm and find out which pixels would be turned on for the line
with end points (5,2) to (8,4) using the same. [6]
3. What is aliasing and anti-aliasing ? List and explain two antialiasing techniques. [6]

June-2015

1. Describe Frame buffer display in computer graphics. [4]


2. Explain display file and its structure. [4]
3. Explain Bresenham’s Line drawing algorithm. [4]
4. Write short notes on: Persistence, Resolution, Aspect ratio. [4]
5. Using DDA algorithm find out which pixels would be turned on for the line with end points
(1,1) to (5,3). [4]

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]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

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]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-II: POLYGONS AND CLIPPING ALGORITHMS

June-2014

1. Explain Sutherland-Hodgeman clipping algorithm with example. [6]


2. Explain scan line algorithm with example. [6]

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

1. Write Cohen-Sutherland line clipping algorithm. [4]


2. Explain concept of viewing parameters with an example. [4]
3. What is meant by coherence and how it can increase the efficiency of scan line polygon filling[4]
4. Write algorithm to fill the polygon area using flood fill method. [4]

Dec-2015

1. Explain even-odd inside test with an example. [3]


2. Write flood fill algorithm. [3]
3. Write and explain Cohen-Sutherland line clipping algorithm. [8]

May-2016

1. What is inside test? Explain even-odd method in detail. [6]


2. Write and explain with an example Cohen-sutherland line clipping algorithm. [6]

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]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-III: 2-D, 3-D TRANSFORMATIONS AND PROJECTIONS

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]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-IV: SEGMENT AND ANIMATION

June-2014

1. Define animation. Explain the methods for controlling animations. [7]


2. Describe various operations carried out on the segment. [6]

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

1. Compare RGB and HSV color model. [3]


2. What are the applications of morphing? [3]
3. Describe the various operations carried out on the segment. [6]
4. Explain image transformations with example. [3]
5. Write advantages and disadvantages of segments. [4]

Dec-2015

1. Explain RGB color model. [4]


2. Give any four basic guidelines for animations. [4]
3. What is segment? Explain segment table. [5]

May-2016

1. Explain RGB and HSV color model. [4]


2. What is segment ? Explain transformation operations of segment. [3]
3. Explain basic guidelines for animation and gaming technology. [4]
4. What is segment and segment table? [3]
5 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Dec-2016

1. Explain RGB and HSV color model. [6]


2. What is animation? Explain different animation techniques. [6]
3. Explain the features of computer graphics and animation software. [6]
4. Explain the segment table with an example along with the data structure used to implement the
segment table. [5]

6 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-V: SHADING, AND HIDDEN SURFACES

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

1. What is surface shading algorithm? Explain phong shading. [6]


2. What are the advantages of Warnock’s algorithm ? [3]
3. Explain the concept of reflection, shadows and ray tracing. [4]

Dec-2015

1. Explain point source illumination. [3]


2. Write painters algorithm. [3]
3. Explain diffused illumination. [3]

May-2016

1. Explain diffused and point source illumination. [3]


2. Explain reflection, shadows and ray-tracing. [6]
3. Write short notes on : (i) Painter’s algorithm, (ii) Warnock algorithm (iii) Z-buffer [6]

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]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

Question Bank (as per SE 2012 Pat.)

UNIT-VI: CURVES AND FRACTALS

June-2014

1. Explain Bezier curve with properties. [6]


2. Define Fractals? Explain Hilbert Curve and Koch curve. [7]
3. Explain BITBLT operation of raster technique. [4]
4. What is OpenGL ES? Explain in brief the libraries supported by OpenGL ES. [5]
5. Draw block diagram of i860. [4]

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

1. Explain the procedure to generate B-spline curve. [4]


2. Explain Hilbert’s curve with an example. [6]
3. Write a short note on 3D MaxStudio or Maya. [4]
4. Draw block diagram of i860. [6]

Dec-2015

1. Explain fractal limes with example. [3]


2. Explain need of NVIDIA workstation in gaming. [5]
3. Write a short note on OpenGL ES. [4]
4. Explain role of Maya/equivalent open source tool in graphics design. [4]
5. Explain architecture of any NVIDIA processor. [4]

8 DEPT OF COMPUTER ENGG, DYPCOE, AKURDI | [PREPARED BY: MS. VISHAKHA A. METRE]

Downloaded by Virendrasinh Patil ([email protected])


lOMoARcPSD|47360048

COMPUTER GRAPHICS

May-2016

1. Explain interpolation and B-spline for curve generation. [4]


2. Explain fractal lines with an example. [3]
3. Explain in brief NVIDIA workstation. [4]
4. Explain significance of OpenGL ES. [2]
5. Explain i86 with block diagram. [6]

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]

Downloaded by Virendrasinh Patil ([email protected])

You might also like