CS602-Midterm
1 / 50
Boundary Filling Algorithm can work for complex polygons.
2 / 50
Two matrices are said to be equal, if they have
3 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
4 / 50
We can draw the circle using ___________.
5 / 50
We can draw the circle using _________
6 / 50
UV light is used in Plasma Panel displays to excite phosphor.
7 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
8 / 50
Three or more points that lie on the same line are called _____.
9 / 50
Various curve functions are useful in ______.
10 / 50
the horizontal refresh ------------------------------
11 / 50
Normalized cross product of two vectors on that surface provides normal vector
12 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
13 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
14 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
15 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
16 / 50
Cross product of two vectors result in a ___________.
17 / 50
Twice the radius of circle is called as ___________.
18 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
19 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
20 / 50
Two points are said to be collinear, if they lie on the
21 / 50
polygons are basically concave polygons that may have self-intersecting edges.
22 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
23 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
24 / 50
_________ direct view storage tube maintains the picture display.
25 / 50
A unit vector has zero magnitude.
26 / 50
There are _________ basic types of polygon.
27 / 50
We can take transpose of any matrix.
28 / 50
DDA abbreviated for ________.
29 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
30 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
31 / 50
In video text memory, ______ are used to display a character.
32 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
33 / 50
To show 256 colors , the no of bits required for each pixel are
34 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
35 / 50
Monochrome Adapter (MA) is a single color adapter
36 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
37 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
38 / 50
25 * 10 resolution with 16 colors supports
39 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
40 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
41 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
42 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
43 / 50
It is safe to assume that all raster-type monitors can accept the same input
44 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
45 / 50
A scaling transformation alters the ______ of an object.
46 / 50
Set up your tripod and pointing the camera at the scene
47 / 50
48 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
49 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
50 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
Your score is
The average score is 54%
Restart quiz
