CS602-Midterm
1 / 50
Translation moves objects without ____________.
2 / 50
25 * 10 resolution with 16 colors supports
3 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
4 / 50
Each hyperbola consists of two __________ .
5 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
6 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
7 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
8 / 50
We can draw the circle
9 / 50
DDA abbreviated for _________.
10 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
11 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
12 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
13 / 50
Twice the radius of circle is called as ___________.
14 / 50
A scaling transformation alters the ______ of an object.
15 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
16 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
17 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
18 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
19 / 50
We can take transpose of any matrix.
20 / 50
Finding unit vector is done by simply dividing each component by the width.
21 / 50
22 / 50
In __________ algorithm(s), old color must be read before it is invoked.
23 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
24 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
25 / 50
26 / 50
Save a line with both endpoints inside all clipping boundaries.
27 / 50
28 / 50
polygons are basically concave polygons that may have self-intersecting edges.
29 / 50
A unit vector has zero magnitude.
30 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
31 / 50
We can draw the circle using ___________.
32 / 50
Discard a line with both endpoints outside clipping boundaries is called as
33 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
34 / 50
Various curve functions are useful in ______.
35 / 50
________ is the set of points that are equidistant from its origin.
36 / 50
There are _________ basic types of polygon.
37 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
38 / 50
_________ direct view storage tube maintains the picture display.
39 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
40 / 50
Cross product of two vectors result in a ___________.
41 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
42 / 50
43 / 50
Rotating a point requires
44 / 50
Computer Graphics are used in ____________.
45 / 50
46 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
47 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
48 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
49 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
50 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
Your score is
The average score is 54%
Restart quiz
