CS602-Midterm
1 / 50
polygons are basically concave polygons that may have self-intersecting edges.
2 / 50
Boundary Filling Algorithm can work for complex polygons.
3 / 50
Bezier curve is tangent to the lines connecting ____.
4 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
5 / 50
We can draw the circle using _________
6 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
7 / 50
Global coordinate systems can be defined with respect to local coordinate system
8 / 50
Perspective projection is specified with the function glFrustum().
9 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
10 / 50
DDA abbreviated for _________.
11 / 50
To show 256 colors , the no of bits required for each pixel are
12 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
13 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
14 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
15 / 50
Each number that makes up a matrix is called an __________ of the matrix.
16 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
17 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
18 / 50
Various curve functions are useful in ______.
19 / 50
Monochrome Adapter (MA) is a single color adapter
20 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
21 / 50
Twice the radius of circle is called as ___________.
22 / 50
Which of the following is not true about matrices?
23 / 50
Process of moving points in space is called
24 / 50
A unit vector has zero magnitude.
25 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
26 / 50
27 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
28 / 50
In __________ algorithm(s), old color must be read before it is invoked.
29 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
30 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
31 / 50
Discard a line with both endpoints outside clipping boundaries is called as
32 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
33 / 50
34 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
35 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
36 / 50
37 / 50
We can take transpose of any matrix.
38 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
39 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
40 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
41 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
42 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
43 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
44 / 50
Rotation performed around a fixed point called ____________.
45 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
46 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
47 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
48 / 50
A scaling transformation alters the ______ of an object.
49 / 50
Shadow mask methods can display a __________ range of colours.
50 / 50
Your score is
The average score is 54%
Restart quiz
