CS602-Midterm
1 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
2 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
3 / 50
In video text memory, ______ are used to display a character.
4 / 50
A scaling transformation alters the ______ of an object.
5 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
6 / 50
Perspective projection is specified with the function glFrustum().
7 / 50
Boundary Filling Algorithm can work for complex polygons.
8 / 50
9 / 50
UV light is used in Plasma Panel displays to excite phosphor.
10 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
11 / 50
Various curve functions are useful in ______.
12 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
13 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
14 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
15 / 50
Three or more points that lie on the same line are called _____.
16 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
17 / 50
We can draw the circle using ___________.
18 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
19 / 50
To show 256 colors , the no of bits required for each pixel are
20 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
21 / 50
Vectors can be multiplied in a way
22 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
23 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
24 / 50
25 / 50
26 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
27 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
28 / 50
The curve is always contained within the _______ of the control points
29 / 50
30 / 50
Rotation performed around a fixed point called ____________.
31 / 50
Twice the radius of circle is called as ___________.
32 / 50
In __________ algorithm(s), old color must be read before it is invoked.
33 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
34 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
35 / 50
This projection technique has the direction of projection perpendicular to the viewing plane, and the viewing direction is perpendicular to one of the principle faces.
36 / 50
37 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
38 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
39 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
40 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
41 / 50
Normalized cross product of two vectors on that surface provides normal vector
42 / 50
Two points are said to be collinear, if they lie on the
43 / 50
44 / 50
We can take transpose of any matrix.
45 / 50
Shadow mask methods can display a __________ range of colors.
46 / 50
DDA abbreviated for ________.
47 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
48 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
49 / 50
50 / 50
Process of moving points in space is called
Your score is
The average score is 54%
Restart quiz
