CS602-Midterm
1 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
2 / 50
We can draw the circle using _________
3 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
4 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
5 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
6 / 50
Each hyperbola consists of two __________ .
7 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
8 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
9 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
10 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
11 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
12 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
13 / 50
Which of the following is not true about matrices?
14 / 50
Normalized cross product of two vectors on that surface provides normal vector
15 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
16 / 50
Twice the radius of circle is called as ___________.
17 / 50
Set up your tripod and pointing the camera at the scene
18 / 50
Shadow mask methods can display a __________ range of colors.
19 / 50
To show 256 colors , the no of bits required for each pixel are
20 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
21 / 50
22 / 50
A scaling transformation alters the ______ of an object.
23 / 50
Monochrome Adapter (MA) is a single color adapter
24 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
25 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
26 / 50
In video text memory, ______ are used to display a character.
27 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
28 / 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.
29 / 50
________ is the set of points that are equidistant from its origin.
30 / 50
Two points are said to be collinear, if they lie on the
31 / 50
We can take transpose of any matrix.
32 / 50
33 / 50
We can draw the circle
34 / 50
Polygons consisting of ________ can cause problems when rendering.
35 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
36 / 50
Three or more points that lie on the same line are called _____.
37 / 50
38 / 50
Parity is a concept used to determine which ________ lie within a polygon.
39 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
40 / 50
There are _________ basic types of polygon.
41 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
42 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
43 / 50
Perspective projection is specified with the function glFrustum().
44 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
45 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
46 / 50
25 * 10 resolution with 16 colors supports
47 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
48 / 50
“Computer Graphics” and “Computer Vision” are ____________.
49 / 50
________is used to move a point, or a set of points, linearly in space
50 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
Your score is
The average score is 54%
Restart quiz
