CS602-Midterm
1 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
2 / 50
DDA abbreviated for ________.
3 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
4 / 50
Which of the following is not true about matrices?
5 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
6 / 50
_________ direct view storage tube maintains the picture display.
7 / 50
There are _______ basic types of polygon.
8 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
9 / 50
We can take transpose of __________.
10 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
11 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
12 / 50
Boundary Filling Algorithm can work for complex polygons.
13 / 50
Twice the radius of circle is called as ___________.
14 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
15 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
16 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
17 / 50
Save a line with both endpoints inside all clipping boundaries.
18 / 50
Various curve functions are useful in ______.
19 / 50
20 / 50
To show 256 colors , the no of bits required for each pixel are
21 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
22 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
23 / 50
Perspective projection is specified with the function glFrustum().
24 / 50
polygons are basically concave polygons that may have self-intersecting edges.
25 / 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.
26 / 50
Discard a line with both endpoints outside clipping boundaries is called as
27 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
28 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
29 / 50
Save a line with both endpoints inside all clipping boundaries is called as ____.
30 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
31 / 50
the horizontal refresh ------------------------------
32 / 50
Parity is a concept used to determine which ________ lie within a polygon.
33 / 50
Shadow mask methods can display a __________ range of colors.
34 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
35 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
36 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
37 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
38 / 50
Computer Graphics are used in _______.
39 / 50
Normalized cross product of two vectors on that surface provides normal vector
40 / 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.
41 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
42 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
43 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
44 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
45 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
46 / 50
Each number that makes up a matrix is called an __________ of the matrix.
47 / 50
Translation moves objects without ____________.
48 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
49 / 50
50 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
Your score is
The average score is 54%
Restart quiz
