CS602-Midterm
1 / 50
Parity is a concept used to determine which ________ lie within a polygon.
2 / 50
Various curve functions are useful in ______.
3 / 50
There are _________ basic types of polygon.
4 / 50
A unit vector has zero magnitude.
5 / 50
We can take transpose of any matrix.
6 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
7 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
8 / 50
Boundary Filling Algorithm can work for complex polygons.
9 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
10 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
11 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
12 / 50
Rotating a point requires
13 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
14 / 50
We can draw the circle using _________
15 / 50
________is used to move a point, or a set of points, linearly in space
16 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
17 / 50
We can draw the circle using ___________.
18 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
19 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
20 / 50
21 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
22 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
23 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
24 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
25 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
26 / 50
Which one of the following is not the graphics library is use:
27 / 50
DDA abbreviated for _________.
28 / 50
To show 256 colors , the no of bits required for each pixel are
29 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
30 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
31 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
32 / 50
Translation moves objects without ____________.
33 / 50
Rotation performed around a fixed point called ____________.
34 / 50
35 / 50
Twice the radius of circle is called as ___________.
36 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
37 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
38 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
39 / 50
DDA abbreviated for ________.
40 / 50
41 / 50
A fractal is generally a property called ___________.
42 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
43 / 50
Monochrome Adapter (MA) is a single color adapter
44 / 50
Save a line with both endpoints inside all clipping boundaries.
45 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
46 / 50
________ is the set of points that are equidistant from its origin.
47 / 50
We can take transpose of __________.
48 / 50
Computer Graphics are used in _______.
49 / 50
In video text memory, ________ are used to display a character.
50 / 50
Your score is
The average score is 54%
Restart quiz
