CS602-Midterm
1 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
2 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
3 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
4 / 50
Each hyperbola consists of two ___________.
5 / 50
DDA abbreviated for _________.
6 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
7 / 50
Process of moving points in space is called
8 / 50
9 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
10 / 50
The father of Computer Graphics is:
11 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
12 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
13 / 50
We can draw the circle using ___________.
14 / 50
Which one of the following is not the graphics library is use:
15 / 50
________is used to move a point, or a set of points, linearly in space
16 / 50
Boundary Filling Algorithm can work for complex polygons.
17 / 50
Twice the radius of circle is called as ___________.
18 / 50
A fractal is generally a property called ___________.
19 / 50
We can take transpose of any matrix.
20 / 50
21 / 50
To show 256 colors , the no of bits required for each pixel are
22 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
23 / 50
We can draw the circle
24 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
25 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
26 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
27 / 50
Three or more points that lie on the same line are called _____.
28 / 50
Various curve functions are useful in ______.
29 / 50
Each number that makes up a matrix is called an __________ of the matrix.
30 / 50
31 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
32 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
33 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
34 / 50
Rotating a point requires
35 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
36 / 50
Bezier curve is tangent to the lines connecting ____.
37 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
38 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
39 / 50
“Computer Graphics” and “Computer Vision” are ____________.
40 / 50
In __________ algorithm(s), old color must be read before it is invoked.
41 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
42 / 50
Vectors can be multiplied in a way
43 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
44 / 50
Set up your tripod and pointing the camera at the scene
45 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
46 / 50
_________ direct view storage tube maintains the picture display.
47 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
48 / 50
49 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
50 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
Your score is
The average score is 54%
Restart quiz
