CS602-Midterm
1 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
2 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
3 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
4 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
5 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
6 / 50
A unit vector has zero magnitude.
7 / 50
________ is the set of points that are equidistant from its origin.
8 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
9 / 50
Process of moving points in space is called
10 / 50
Boundary Filling Algorithm can work for complex polygons.
11 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
12 / 50
We can draw the circle using _________
13 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
14 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
15 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
16 / 50
Rotating a point requires
17 / 50
Shadow mask methods can display a __________ range of colors.
18 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
19 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
20 / 50
In video text memory, ______ are used to display a character.
21 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
22 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
23 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
24 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
25 / 50
____is the tendency of the text to flash as it moves up or down.
26 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
27 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
28 / 50
Which one of the following is not the graphics library is use:
29 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
30 / 50
Two matrices are said to be equal, if they have
31 / 50
Polygons are basically concave polygons that may have self-intersecting edges
32 / 50
Which of the following is not true about matrices?
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
35 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
36 / 50
37 / 50
38 / 50
39 / 50
Various curve functions are useful in ______.
40 / 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.
41 / 50
_________ direct view storage tube maintains the picture display.
42 / 50
Perspective projection is specified with the function glFrustum().
43 / 50
The circle and ellipse are symmetric across 1 octants.
44 / 50
Rotation performed around a fixed point called ____________.
45 / 50
25 * 10 resolution with 16 colors supports
46 / 50
We can take transpose of any matrix.
47 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
48 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
49 / 50
Vectors can be multiplied in a way
50 / 50
Two points are said to be collinear, if they lie on the
Your score is
The average score is 54%
Restart quiz
