Important Practice Question Available for Exam. This Questions are based on Repeated Topics and Frequently Ones with the Help of this you can Score Good Marks in Exam and you will Pass in Exam.
Get Updates on: WhatsApp YouTube Instagram
1. Attempt any FIVE of the
following : 10
(a) Define :
(i)
Pixel
(ii)
Frame Buffer
(b) Give the characteristics of display
adaptor.
(c) Explain Raster Scan.
(d) State two line drawing algorithms. **
(e) List types of Polygon.
(f) List various polygon filling algorithms.
(g) Give matrix representation for 2D scaling.
*
(h) Define aspect ratio. Give one example of
an aspect ratio.
(i) List any four applications of computer
graphics.
(j) Define virtual reality. List any two advantages
of virtual reality.
(k) Define convex and concave polygons.
(l) Write the transformation matrix for
y-shear. *
(j) Give two applications of computer
graphics.
(k) Draw Cubic Bezier Curve.
(l) Define Bitmap graphics
2. Attempt any THREE of the
following : 12
(a) Differentiate between Random Scan/ Vector
Scan and Raster Scan. ***
(b) Explain and write steps for DDA line
drawing algorithm.***
(c) List out basic transformations techniques.
Explain scaling transformation with respect to 2D. *
(d) Explain differ types of Text clipping in
brief. *
(e) Translate the polygon with co-ordinates
A(3, 6), B(8, 11) & C(11, 3) by 2 units in X direction and 3 units in Y
direction.
(f) Write the midpoint subdivision algorithm
for line clipping. *
(g) Write short note on Augmented Reality.
(h) Explain scan line algorithm of polygon
clipping.
(i) Write 2D and 3D scaling matrix.
3. Attempt any THREE of the
following : 12
(a) Explain stroke method and Bitmap method
with example. *
(b) Explain types of Parallel Projection with
example.
(c) Write down Cohen-Sutherland Line clipping
algorithm. *
(d) Explain Koch curve with diagram. *
(e) State the different character generation
methods. Describe any one with diagram. *
(f) Obtain a transformation matrix for
rotating an object about a specified pivot point.
(g) Describe Sutherland-Hodgeman algorithm for
polygon clipping. *
(h) Explain with diagram the technique of
Raster Scan Display.
(i) Write procedure to fill polygon with flood
fill.
(j) Explain 2D transformation with its types.
4. Attempt any THREE of the
following : 12
(a) Compare Bitmap Graphics and Vector based
graphics.
(b) Consider line from (4, 4) to (12, 9). Use
Bresenhaum’s algorithm to rasterize this line. *
(c) Use Cohen-Sutherland algorithm to clip two
lines P1 (40, 15) – P2 (75, 45) and P3(70, 20) – P4(100, 10) against a window
A(50, 10), B(80, 10), C(80, 40) & D(50, 40) **
(d) Consider the square A(1, 0), B(0, 0), C(0,
1), D(1, 1). Rotate the square ABCD by 45 anticlockwise about point A(1, 0). *
(e) Explain curve generation using
Interpolation technique. **
(f) Explain inside and outside test for
polygon.
(g) Explain composite transformation over
arbitary point.
(h) Write
DDA Arc generation algorithm.
5. Attempt any TWO of the
following : 12
(a) Rotate a triangle defined by A(0, 0), B(6,
0) & C(3, 3) by 90 about origin in anti-clockwise direction. *
(b) Explain boundary fill algorithm with
pseudo-code. Also mention its limitations, if any.
(c) Obtain the curve parameters for drawing a
smooth Bezier curve for the following points A(0, 10), B(10, 50), C(70, 40)
& D(70, –20). *
(d) Consider the line from (5, 5) to (13, 9).
Use the Bresenham’s algorithm to rasterize the line. *
(e) Apply the shearing transformation to
square with A(0, 0), B(1, 0), C(1, 1), D(0, 1) as given below :
(i)
Shear Parameter value of 0.5 relative to the line yref = –1.
(ii) Shear Parameter value of 0.5 relative to
the line xref = –1
(f) Write a program in ‘C’ to generate Hilbert’s
curve. *
6. Attempt any TWO of the
following : 12
(a) Write matrices in homogeneous co-ordinate
system for 3D scaling transformation. **
(b) Write down Cyrus-Beck line clipping
algorithm.
(c) Derive the expression for decision
parameter used in Bresenhaum’s circle drawing algorithm.
(d) Write a program in ‘C’ for DDA circle
drawing algorithm.
(e) Perform a 45 rotation of a triangle A(0,
0), B(1, 1), C(5, 2) *
(i)
About the origin
(ii)
About P(–1, –1)
(f) Apply the Liang-Barsky algorithm to the
line with co-ordinates (30, 60) & (60, 25) against the window : (Xmin,
Ymin) = (10, 10) & (Xmax, Ymax) = (50, 50)
(g) Explain character generation
methods :
(i)
Stroke
(ii)
Starburst
(iii)
Bitmap
(h) Apply shearing transformation to square
with A(0, 0), B(1, 0), C(1, 1) and D(0, 1) as shear parameter value of 0.5
relative to the line Yref = –1 and Xref = –1.
(i)
Explain Cyrusblek line clipping algorithm
NOTE: This is Not Official MSBTE Website: We Provide Important Practice Questions for Students to Score Good Marks in Exam and this Questions is based on Important Topics of Syllabus and Repeated Ones. So, with the help of this we help student to Not get KT / or / They will Not get Fail in Exam.