MC 0072

Subject : Computer Graphics (MC0072)<br><br>Provided by <a
href='http://www.programmer2programmer.net'>www.programmer2programmer.net</a><br><b
r><b><u>PART A</u></b><br><br><table border='0' width='600' id='table1_0_0'><tr><td
width='41' align='left' valign='top'><b>Q.1 </b></td><td width='749' align='left'
valign='top' colspan='2'>The error term of integer Bresenham’s <br>Algorithm is
given as</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'><b>A) </b></td><td width='711' align='left'
valign='top'>2edy</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'><b>B) </b></td><td
width='711' align='left' valign='top'>-2dex</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'><b>C)
</b></td><td width='711' align='left' valign='top'>2edxdy</td></tr><tr><td
width='41' align='left' valign='top'> </td><td width='34' align='left'
valign='top'><b>D) </b></td><td width='711' align='left'
valign='top'>2edx</td></tr></table><table border='0' width='600'
id='table1_0_1'><tr><td width='41' align='left' valign='top'><b>Q.2 </b></td><td
width='749' align='left' valign='top' colspan='2'>S-1sxsy =</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left'
valign='top'>Ssysx</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>S1/sx 1/sy</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>-Ssxsy</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>None of
these</td></tr></table><table border='0' width='600' id='table1_0_2'><tr><td
valign='top' colspan='2'>Disadvantage of edge fill algorithm is</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>Expense
associated with sorting the various
lists</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'><b>B) </b></td><td width='711' align='left'
valign='top'>Expense associated with maintaining</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Algorithm is limited to
input/output
considerations</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'><b>D) </b></td><td width='711' align='left'
valign='top'>All of the above</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>The error term for a non zero
intercept of <br>General Bresenham’s Algorithm is</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'><b>A)
</b></td><td width='711' align='left' valign='top'>2dy-dx</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>2dx-
dy</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left'
valign='top'>2dx+dy</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'><b>D) </b></td><td
width='711' align='left' valign='top'>2dy+dx</td></tr></table><table border='0'
width='600' id='table1_0_4'><tr><td width='41' align='left' valign='top'><b>Q.5
</b></td><td width='749' align='left' valign='top' colspan='2'>A object-space
algorithm for hidden surface <br>removal work concentrates on
_____</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>geometrical relationships among the objects
in the scene</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Final image</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'><b>C) </b></td><td
width='711' align='left' valign='top'>Both A) and B)</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'><b>D)
</b></td><td width='711' align='left' valign='top'>Spatial relationship of final
object</td></tr></table><table border='0' width='600' id='table1_0_5'><tr><td
valign='top' colspan='2'>A scaling constant indicates an expansion of
<br>length</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Equal to 1</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>greater than one</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>less than 1</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>less than
0</td></tr></table><table border='0' width='600' id='table1_0_6'><tr><td width='41'
align='left' valign='top'><b>Q.7 </b></td><td width='749' align='left' valign='top'
colspan='2'>After identifying visible surfaces by a hidden <br>surface algorithm,
is ______ is used to <br>compute the intensities and colors to display for <br>the
surface</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Shading model</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Perspective Projection</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left'
valign='top'>Scaling</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Mirror reflection</td></tr></table><table
border='0' width='600' id='table1_0_7'><tr><td width='41' align='left'
valign='top'><b>Q.8 </b></td><td width='749' align='left' valign='top'
colspan='2'>“The mouse cannot be used for tracing <br>paper”. This statement
is</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>A) </b></td><td width='711' align='left'
valign='top'>FALSE</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>TRUE</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Partially true</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Can’t
predictable</td></tr></table><table border='0' width='600' id='table1_0_8'><tr><td
valign='top' colspan='2'>Select the feature of Midpoint subdivision
<br>algorithm</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Requires calculation of the intersection of the
line with window page</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Hardware implementation of the algorithm is
slow</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='34' align='left' valign='top'><b>C) </b></td><td width='711' align='left'
valign='top'>Software implementation of the algorithm is
slow</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>None of the above</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>The process of determining which
pixel will <br>provided the best approximation to the desired <br>line is know
as</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>Scan conversion</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>lipping</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>rasterization</td></tr><tr><td
valign='top' colspan='2'>Refreshing of a CRT is done to avoid</td></tr><tr><td
valign='top'>Flickering</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Interlacing</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Blurring</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>None of the
above</td></tr></table><table border='0' width='600' id='table1_0_11'><tr><td
valign='top' colspan='2'>Find the slope of line from <br>P1 (-3/2, -1) to P2 (3/2,
2)</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>2/3</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>1/3</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>½</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>1</td></tr></table><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'>Representing a three
dimensional object in <br>a two dimensional medium is called</td></tr><tr><td
valign='top'>Projection</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Transformation</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Translation</td></tr><tr><td
valign='top'>Rotation</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>_____ is the process of
extracting a <br>portion of a database</td></tr><tr><td width='41' align='left'
valign='top'> </td><td width='34' align='left' valign='top'><b>A) </b></td><td
width='711' align='left' valign='top'>Flipping</td></tr><tr><td width='41'
align='left' valign='top'> </td><td width='34' align='left' valign='top'><b>B)
</b></td><td width='711' align='left' valign='top'>Clipping</td></tr><tr><td
valign='top'>Concatenation</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Spooling</td></tr></table><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'>In ordered, edge
list algorithm, each pixel <br>in the display is visited ______</td></tr><tr><td
valign='top'>twice</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>only once</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>thrice</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>cannot be
specified</td></tr></table><table border='0' width='600' id='table1_0_15'><tr><td
valign='top' colspan='2'>In a conventional CRT the yoke is connected <br>to a
___</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>Sweep</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Scan generator</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Either A) or B)</td></tr><tr><td
valign='top' colspan='2'>As the mouse is rolled around on a flat <br>surface, its
movement is in ____ direction is <br>translated into rotation of the
wheel</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Orthogonal</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Oblique</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Parallel</td></tr><tr><td
valign='top' colspan='2'>When phosphor will no longer be <br>fluoroscent, it is
said to be</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>dead</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Burned</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Inactive</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>all of the
valign='top' colspan='2'>_____ algorithms are not limited to simple
<br>polygons</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Edge fill algorithm</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Edge flag algorithm</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>Fence fill
algorithm</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>all of the above</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>_____ algorithm
can be used to handle on <br>cave polygons</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Weiler
valign='top'>Atherton algorithm</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Weiler and Atherton
width='749' align='left' valign='top' colspan='2'>If the slope of the line is zero,
the line is</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>parallel to left and right edges</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>perpendicular to top and bottom
edges</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>perpendicular to left and right edges</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>only top edges need to be
checked for
intersections</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>For the line from Pl(-3/2, 1/6)
to P2(1/2, <br>3/2), the slope is ______</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>1/3</td></tr></table><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'>1. If the refresh
rate is greater than the <br>phosphor’s persistence, moving object will tend <br>to
become</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Blurred</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Brightened</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Flickered</td></tr><tr><td
valign='top' colspan='2'>The process of scaling changes ___of an
<br>object</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Sign</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Dimension</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Both A) and B)</td></tr><tr><td
valign='top' colspan='2'>Bresenham’s circle algorithm uses ____ of a <br>circle to
generate a circle</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>2-way-symmetry</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>8-way-symmetry</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>4-way-
symmetry</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>6-way-symmetry</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>In modified scan line co-ordinate
system, <br>horizontal edges are ignored, because</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Horizontal edges intersect a
scan line</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Horizontal edges are not formed</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Horizontal edges are always
formed</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Horizontal edges cannot intersect a scan line</td></tr></table><table
colspan='2'>Integer (-8.5) =</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>-8</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>None of these</td></tr></table><table
colspan='2'>If 4 bit binary representation of ‘6’ is shifted <br>right 4time them
it yields</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>4</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>12</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>3</td></tr><tr><td width='41' align='left'
</b></td><td width='749' align='left' valign='top' colspan='2'>Choose the oblique
projections from <br>below</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>General</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Cavalier</td></tr><tr><td
valign='top'>Cabinet</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>All the above</td></tr></table><table
colspan='2'>Consider the line from (0, 0) to (5,5). <br>Rasterizing the line with
the Bresenham’s <br>algorithm yields error term =</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>-1/2</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>1/2</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>4/5</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>1/5</td></tr></table><table
colspan='2'>Process of determining which pixels will <br>provide the best
approximation to the desired <br>line is properly known as _____</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>Scan
conversion</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>rasterization</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Interlacing</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>All of the
valign='top' colspan='2'>Sutherland-Hodgman algorithm is used for</td></tr><tr><td
valign='top'><b>A)
</b></td><td width='711' align='left' valign='top'>line drawing</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>Polygon
clipping</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Circle generating</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>None of these</td></tr></table><table
colspan='2'>In Algorithm for identifying completely <br>visible and most invisible
line the number of <br>regions use is</td></tr><tr><td width='41' align='left'
</b></td><td width='749' align='left' valign='top' colspan='2'>______ statement is
false</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Farther an object is from the center of
projection, the smaller it appears</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Projections of lines that are parallel to the
view plane appear to meet at some point on the
view plane.</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Objects behind the center of projection are
projected upside down and backward on to the
view plane</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>A finite line segment joining a point which
lies back of viewer point in back of the viewer,
is actually projected to a broken line of infinite
extent</td></tr></table><table border='0' width='600' id='table1_0_34'><tr><td
valign='top' colspan='2'>The glow off by the, phosphor during <br>exposure to the
electron beam is known as</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Persistence</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Phosphorescence</td></tr><tr><td
valign='top'>Fluorescence</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>All of the above</td></tr></table><table
colspan='2'>The equation of the infinite line through <br>P1(X1 Y1) and P2(X2, Y2)
is Y =</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>m(x-x1)+y1</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>m(y-y1)+x1</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>m(x1-x)+y1</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>m(y1-y)
+XL</td></tr></table><table border='0' width='600' id='table1_0_36'><tr><td
valign='top' colspan='2'>Which of the following line is partially <br>visible?
</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>Line ab with end point codes 0100 and 0100</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Line bc with end point codes
1000 and 0010</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Line Pq with endpoint codes 1001 and 1000</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>line xy with end point codes
0000 and 0010</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>Disadvantage of using mouse
is</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>Cannot be used for tracing data from paper</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Very difficult to handprint
characters
recognition by the computer</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Both A) and B)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>None of the
above</td></tr></table><br><br><b><u>PART B</u></b><br><br><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'> In Cohen Sutherland
algorithm ___ bit is <br>set if the end point is to the right of the window <br>and
______ bit is set if the end point is below <br>the window</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>First,
Third</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Second, Third</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>First, Fourth</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Fourth,
Second</td></tr></table><table border='0' width='600' id='table1_1_1'><tr><td
valign='top' colspan='2'>_____ gives the correct definition of Edge <br>fill
valign='top'>For each scan line intersecting a polygon
edge at (x complement all pixels whose
midpoints lie to the right of(x</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>For each scan line intersecting a polygon
edge at (x complement all pixels whose
midpoints lie to the left of (xi.yi).</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>If the intersection is to the left of the
fence,
complement all pixels whose midpoint lies to
left or on the intersection of the scan line</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>If the intersection is to the
right of the
fence, complement all the pixels</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>Find the slop and mid point of
the line <br>P1(-3/2, 1/6) to P2 (1/2, 3/2)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>-2/3, (1/2,
5/3)</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>-3/2, (1/2, -5/3)</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>-1/2, (1/2 -5/3)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>2/3, (-1/2,
5/3)</td></tr></table><table border='0' width='600' id='table1_1_3'><tr><td
valign='top' colspan='2'>Select true statements regarding Edge Flag <br>Algorithm
<br>i) It is three step process <br>ii) The second step is to fill between bounding
<br>pixels <br>iii) The first step is to outline the contour</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>i) and
ii)</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>B) </b></td><td width='711' align='left'
valign='top'>ii) and iii)</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i) and iii)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>i), ii) and
iii)</td></tr></table><table border='0' width='600' id='table1_1_4'><tr><td
valign='top' colspan='2'>Choose the ingredients of the shading <br>models <br>i)
Properties of intensities <br>ii) Properties of the surface <br>iii) Properties of
the illumination falling on it</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i) and iii)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>ii) and iii)</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>i) and
ii)</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>D) </b></td><td width='711' align='left'
valign='top'>i), ii) and iii)</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'> ____is the place where displays
image is <br>stored as a matrix of intensity values and <br>_____ passes the
contents of the frame buffer <br>to the monitor</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Digital memory, Displays
controller</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Television monitor, Displays controller</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Digital memory, Television
monitor</td></tr><tr><td width='41' align='left' valign='top'> </td><td
width='749' align='left' valign='top' colspan='2'>Except at boundary edges,
adjacent pixels <br>are likely to have the same characteristics, and <br>this
property is referred as ______ and far a <br>raster scan graphics device adjacent
pixels on a <br>scan line are likely to have the same
<br>characteris</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Scan line, Boundary</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>Boundary,
Spatial</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Spatial, Scan line</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Scan line, Spatial</td></tr></table><table
colspan='2'>Midpoint of the line having the end points (- <br>308, 632) and (820,
-136) is</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>(247, 256)</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>(257,243)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>(256, 248)</td></tr><tr><td
valign='top'>(0,0)</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>In a CRT, at the end of each line
the beam <br>must turned off and redirected back to the left <br>hand side of the
CRT. The return sweep is <br>called _____ and shutting off of the electron <br>beam
as it returns from the bottom of the <br>display at the</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>Retracing,
Blanking</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Blanldng, retracing</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>horizontal retrace blanking, vertical retrace
blanking</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>vertical retrace blanking, horizontal retrace
blanking</td></tr></table><table border='0' width='600' id='table1_1_9'><tr><td
valign='top' colspan='2'>Which of the following specifies the process <br>of scan
converting a circle using Bresenham’s <br>algorithm</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>If the eight-way symmetry of a
circle is used
to generate a circle, points will have to be 90°
to 450 angle</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>If the eight-way symmetry of a circle is used
to generate a circle, moves will be made only in
the positive direction</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>If the eight-way symmetry of a circle is used
to generate a circle, points will only have to be
generated through a 90° angle</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>If the weight-way symmetry of a circle is
used to be generated a circle, points will only
have to be generated through a 450 angle and
if points are generated from 900 to 450 moves
will be made only in the +x and —y directions</td></tr></table><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'>The glow given off
by the, phosphor <br>during exposure to the electron beam is know <br>as _____ and
the continuing glow given off <br>after the beam is removed is known as
valign='top'>Persistence, fluorescence</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Phosphorescence,
fluorescence</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Fluorescence, phosphorescence</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Persistence,
phosphorescence</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>Match the following intersections
with the <br>window edges <br>Set – A <br>i) y=m(XL-X1)+y1 mK±M <br>ii) y=X1+
(y=X1+(1/m) (yB-y1) mK0 <br>Set – B <br>1. Right <br>2. Top <br>3. Left <br>4.
Bottom</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>i) -4, ii) -3</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i) -3, ii) -4</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>i) -2, ii) -1</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>i) -4, ii)
-1</td></tr></table><table border='0' width='600' id='table1_1_12'><tr><td
valign='top' colspan='2'>Choose the oblique projectors from below <br>i) General
<br>ii) Auxiliary views <br>iii) Trimetric <br>iv) One principal vanishing point
<br>v) Cabinet</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>i), iii) and iv)</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i), iii) and v)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>i), ii) and iv)</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>i) and
v)</td></tr></table><table border='0' width='600' id='table1_1_13'><tr><td
valign='top' colspan='2'>Consider the line from (0, 0) to (5, 5) then <br>applying
Bresenham’s Algorithm yields dy = <br>______ and e = _______</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>5,
½</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>B) </b></td><td width='711' align='left'
valign='top'>-5, -½</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>5, -½</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>-5, ½</td></tr></table><table
colspan='2'>Perspective drawing are characterized by <br>____ and
valign='top'>Vanishing Points, view confusion</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>View confusion, Perspective
foreshortening</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Perspective foreshortening, vanishing points</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>Topological
distortion, view confusion</td></tr></table><br><br><b><u>PART
C</u></b><br><br><table border='0' width='600' id='table1_2_0'><tr><td width='41'
colspan='2'>Match the following:- <br>Set A <br>i) Projection plane parallel to
principal planes <br>ii) Projection not perpendicular to projection <br>plane
<br>iii) Projection plane not parallel to principal <br>plane <br>Set B <br>1.
Orthographic <br>2. Axonometri</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i)-3, ii)-4, iii)-2</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>i)-4, ii)-1,
iii)-3</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>i)-3, ii)-4, iii)-1</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>i)-2, ii)-4, iii)-1</td></tr></table><table
colspan='2'>Consider the DDA algorithm. Consider the <br>line from (0, 0) to (-8,
-4) in the third quadrant <br>then value of length = _______, dx = ______ <br>and
dy = ______</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>-4, 1, -0.5</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>.4, 1, 0.5</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>-8, -1, 0.5</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>8, -1,
-0.5</td></tr></table><table border='0' width='600' id='table1_2_2'><tr><td
valign='top' colspan='2'> Which of the following statements are false <br>regarding
polygon dipping algorithm? <br>a. It is based on the observation that it is
<br>relatively easy to dip a polygon against a single <br>clipping edge <br>b.
Algorithm operates vertices of the polygo</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>c, d, e</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>a, b</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>a, d, e</td></tr><tr><td
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>b, d,
e</td></tr></table><table border='0' width='600' id='table1_2_3'><tr><td width='41'
colspan='2'>Select the points true for two dimensions <br>graphics transformation
<br>a. If the displacement of a object p(x, y) is <br>given by the vector V=t +
t. , then new object <br>co-ordinates are x+t and y+ty <br>b. In a scaling
transformation, only origin <b</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>a, b, c, d, e</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>a, b, c, d</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>c,
e</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>b, d, e</td></tr></table><table border='0' width='600'
id='table1_2_4'><tr><td width='41' align='left'
colspan='2'>Match the following:- <br>Set – A <br>i) Used to create a clear picture
<br>ii) Used to control the direction of the electron <br>beam <br>iii) Used to
regulate the flow of electrons <br>Set – B <br>1. Deflection yoke <br>2. Electron
gun <br>3. Focusing e</td></tr><tr><td width='41' align='left'
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>i)-3, ii)-4,
width='711' align='left' valign='top'>i)-3, ii)-1, iii)-4</td></tr></table><table
colspan='2'>State True or False for raster-scan CRT <br>a. An electron gun consists
of a heater and a <br>cathode <br>b. Control electrode is used to regulate the flow
<br>of electrons <br>c. Focusing electrode is used to control the <br>direction of
electron beam <b</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>a-T, b-T, c-F, d-F, e-F</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>a-I, b-F, c-
T, d-T, e-F</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>a-F, b-I, c-F, d-F, e-T</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>a-I, b-F, c-F, d-I, e-
T</td></tr></table><table border='0' width='600' id='table1_2_6'><tr><td width='41'
colspan='2'>Select true statements regarding edge fill <br>algorithm <br>i) This
algorithm is most conveniently used with <br>frame buffer <br>ii) This algorithm is
limited by input/output <br>considerations <br>iii) This algorithm allows the
polygon edges to <br>be </td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>ii), iii) and iv)</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>i), ii) and
iii)</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>i) and ii)</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>All the above</td></tr></table><table
colspan='2'>In two dimensional clipping, if any <br>coordinate of either end point
is outside the <br>window, then the line is _____ . If both end <br>points are
left, right above or below the <br>window, the line is _____. If both end points
<br>are interior to the </td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>Trivially invisible, not totally visible,
totally
visible</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Not tolally visible, trivially invisible, visible</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>Totally
visible, trivially invisible, not totally
visible</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>Visible, Not totally visible, trivially
invisible</td></tr></table><table border='0' width='600' id='table1_2_8'><tr><td
valign='top' colspan='2'>Select the features applicable for seed fill
<br>algorithms <br>a. Algorithm attempts to find and fill all pixels <br>interior
to the region <br>b. If the region is interior-defined, then all the <br>pixels in
the interior of the region boundary <br>have </td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>a, b, c, d, e</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>c, d,
e</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
align='left' valign='top'><b>C) </b></td><td width='711' align='left'
valign='top'>b, d</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>a, c, d, e</td></tr></table><table border='0'
</b></td><td width='749' align='left' valign='top' colspan='2'> ______ gives the
correct representation of <br>simple incremental algorithm</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'> position =
start
step = increment
1. If position end <accuracy then 4 if position>
end then 2
if position<end then 4
2. position = position_step go to 1
3. position = position + step go to 2
4. finish</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>position = start
step = increment
1. If position _ end <accuracy then 4 if position
> end then 3
2. position = position_2 go to 1
3. position = position + step go to 2
step = increment
1. If position_ end <accuracy then 4 if
position> end then 2
2. position = position_step go to 1
3. position = position + step go to I
step = increment
1. position=position_step go to 1
2. If position_end <accuracy then 4 if position>
end then 3
3. position = position +step go to 1
4. finish</td></tr></table><table border='0' width='600' id='table1_2_10'><tr><td
valign='top' colspan='2'>Consider the edge flag algorithm <br>Contour outline:
<br>for x+1/2>x intersection to the boundary value <br>Fill: <br>For each scan line
intersecting the polygon <br>Inside = _______ <br>for X = 0 (left) to X=Xmax(right)
<br>if the pixel at x is set to t</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>True, false, set, reset</td></tr><tr><td
valign='top'><b>B) </b></td><td width='711' align='left' valign='top'>False, true,
reset, set</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>False, True, set, reset</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>True, false, set, set</td></tr></table><table
colspan='2'>Bresenham’s line algorithm includes _____ <br>features <br>a. Algorithm
seeks to select the optimum raster <br>locations to represent a straight line
<br>b. If the error term is negative, the line will <br>pass below the middle of
the pixel <br>c. Algorit</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>a, b, c, d</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>a, d, e</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>only b and
d</td></tr><tr><td width='41' align='left' valign='top'> </td><td width='34'
valign='top'>a, b, c, e</td></tr></table><table border='0' width='600'
width='749' align='left' valign='top' colspan='2'>Match the following: <br>Set – A
<br>i) The farther an object is from the center of <br>projection, the smaller it
appears <br>ii) Object behind the center of projection are <br>projected upside
down <br>iii) A finite line segment joining a point which <b</td></tr><tr><td
valign='top'><b>A) </b></td><td width='711' align='left' valign='top'>i)-3, ii)-4,
valign='top'><b>D) </b></td><td width='711' align='left' valign='top'>i)-3, ii)-1,
iii)-4</td></tr></table><table border='0' width='600' id='table1_2_13'><tr><td
valign='top' colspan='2'>Consider the line (0, 0) to 5, 5) <br>Rasterizing the line
with the Bresenham’s <br>algorithms <br>yields initial calculations dx = ______dy =
____ <br>and e = ____</td></tr><tr><td width='41' align='left'
width='711' align='left' valign='top'>5. 0 -0.5</td></tr><tr><td width='41'
</b></td><td width='711' align='left' valign='top'>5, 5, 0.5</td></tr><tr><td
valign='top'><b>C) </b></td><td width='711' align='left' valign='top'>5, 5
-0.5</td></tr><tr><td width='41' align='left' valign='top'> </td><td
valign='top'>-0, 5, 0.5</td></tr></table><br><br>

MC 0072

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

MC 0072

Hochgeladen von

Copyright:

Verfügbare Formate

Subject : Computer Graphics (MC0072)<br><br>Provided by <a

Das könnte Ihnen auch gefallen