CS602-Midterm
1 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
2 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
3 / 50
We can take transpose of any matrix.
4 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
5 / 50
Two points are said to be collinear, if they lie on the
6 / 50
We can draw the circle using ___________.
7 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
8 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
9 / 50
Shadow mask methods can display a __________ range of colors.
10 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
11 / 50
Two matrices are said to be equal, if they have
12 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
13 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
14 / 50
A scaling transformation alters the ______ of an object.
15 / 50
Perspective projection is specified with the function glFrustum().
16 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
17 / 50
UV light is used in Plasma Panel displays to excite phosphor.
18 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
19 / 50
20 / 50
Discard a line with both endpoints outside clipping boundaries is called as
21 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
22 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
23 / 50
Boundary Filling Algorithm can work for complex polygons.
24 / 50
DDA abbreviated for _________.
25 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
26 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
27 / 50
Process of moving points in space is called
28 / 50
Various curve functions are useful in ______.
29 / 50
Save a line with both endpoints inside all clipping boundaries.
30 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
31 / 50
25 * 10 resolution with 16 colors supports
32 / 50
In video text memory, ______ are used to display a character.
33 / 50
Monochrome Adapter (MA) is a single color adapter
34 / 50
Parity is a concept used to determine which ________ lie within a polygon.
35 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
36 / 50
37 / 50
Vectors can be multiplied in a way
38 / 50
The father of Computer Graphics is:
39 / 50
40 / 50
41 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
42 / 50
Rotating a point requires
43 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
44 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
45 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
46 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
47 / 50
In __________ algorithm(s), old color must be read before it is invoked.
48 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
49 / 50
50 / 50
Your score is
The average score is 54%
Restart quiz
