CS602-Midterm
1 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
2 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
3 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
4 / 50
Process of moving points in space is called
5 / 50
Each hyperbola consists of two ___________.
6 / 50
“Computer Graphics” and “Computer Vision” are ____________.
7 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
8 / 50
Computer Graphics are used in ____________.
9 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
10 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
11 / 50
Various curve functions are useful in ______.
12 / 50
Shadow mask methods can display a __________ range of colours.
13 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
14 / 50
15 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
16 / 50
We can take transpose of any matrix.
17 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
18 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
19 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
20 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
21 / 50
Vectors can be multiplied in a way
22 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
23 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
24 / 50
Parity is a concept used to determine which ________ lie within a polygon.
25 / 50
26 / 50
Two points are said to be collinear, if they lie on the
27 / 50
Finding unit vector is done by simply dividing each component by the width.
28 / 50
We can draw the circle using _________
29 / 50
Boundary Filling Algorithm can work for complex polygons.
30 / 50
31 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
32 / 50
A scaling transformation alters the ______ of an object.
33 / 50
Translation moves objects without ____________.
34 / 50
Bezier curve is tangent to the lines connecting ____.
35 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
36 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
37 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
38 / 50
Rotation performed around a fixed point called ____________.
39 / 50
25 * 10 resolution with 16 colors supports
40 / 50
Two matrices are said to be equal, if they have
41 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
42 / 50
In video text memory, ______ are used to display a character.
43 / 50
44 / 50
Cross product of two vectors result in a ___________.
45 / 50
A fractal is generally a property called ___________.
46 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
47 / 50
Twice the radius of circle is called as ___________.
48 / 50
________ is the set of points that are equidistant from its origin.
49 / 50
the horizontal refresh ------------------------------
50 / 50
Perspective projection is specified with the function glFrustum().
Your score is
The average score is 54%
Restart quiz
