CS602-Midterm
1 / 50
We can draw the circle
2 / 50
Parity is a concept used to determine which ________ lie within a polygon.
3 / 50
25 * 10 resolution with 16 colors supports
4 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
5 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
6 / 50
A unit vector has zero magnitude.
7 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
8 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
9 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
10 / 50
Each number that makes up a matrix is called an __________ of the matrix.
11 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
12 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
13 / 50
14 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
15 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
16 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
17 / 50
A scaling transformation alters the ______ of an object.
18 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
19 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
20 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
21 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
22 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
23 / 50
Polygons consisting of ________ can cause problems when rendering.
24 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
25 / 50
UV light is used in Plasma Panel displays to excite phosphor.
26 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
27 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
28 / 50
Set up your tripod and pointing the camera at the scene
29 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
30 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
31 / 50
It is safe to assume that all raster-type monitors can accept the same input
32 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
33 / 50
The dot product of two vectors A and B is __________. Iff the angle between them is less than 20 or greater than 270 degrees.
34 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
35 / 50
We can take transpose of any matrix.
36 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
37 / 50
The curve is always contained within the _______ of the control points
38 / 50
We can draw the circle using _________
39 / 50
________ is the set of points that are equidistant from its origin.
40 / 50
Three or more points that lie on the same line are called _____.
41 / 50
Save a line with both endpoints inside all clipping boundaries is called as ____.
42 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
43 / 50
There are _________ basic types of polygon.
44 / 50
Perspective projection is specified with the function glFrustum().
45 / 50
Rotating a point requires
46 / 50
47 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
48 / 50
We can take transpose of __________.
49 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
50 / 50
Your score is
The average score is 54%
Restart quiz
