CS602-Midterm
1 / 50
Process of moving points in space is called
2 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
3 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
4 / 50
It is safe to assume that all raster-type monitors can accept the same input
5 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
6 / 50
Each number that makes up a matrix is called an __________ of the matrix.
7 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
8 / 50
________is used to move a point, or a set of points, linearly in space
9 / 50
DDA abbreviated for ________.
10 / 50
Perspective projection is specified with the function glFrustum().
11 / 50
the horizontal refresh ------------------------------
12 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
13 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
14 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
15 / 50
Each hyperbola consists of two __________ .
16 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
17 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
18 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
19 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
20 / 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.
21 / 50
A unit vector has zero magnitude.
22 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
23 / 50
polygons are basically concave polygons that may have self-intersecting edges.
24 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
25 / 50
UV light is used in Plasma Panel displays to excite phosphor.
26 / 50
27 / 50
Three or more points that lie on the same line are called _____.
28 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
29 / 50
Boundary Filling Algorithm can work for complex polygons.
30 / 50
Vectors can be multiplied in a way
31 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
32 / 50
The circle and ellipse are symmetric across 1 octants.
33 / 50
Twice the radius of circle is called as ___________.
34 / 50
Polygons consisting of ________ can cause problems when rendering.
35 / 50
In video text memory, ______ are used to display a character.
36 / 50
Various curve functions are useful in ______.
37 / 50
Shadow mask methods can display a __________ range of colours.
38 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
39 / 50
Each hyperbola consists of two ___________.
40 / 50
________ is the set of points that are equidistant from its origin.
41 / 50
Rotating a point requires
42 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
43 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
44 / 50
Which one of the following is not the graphics library is use:
45 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
46 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
47 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
48 / 50
49 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
50 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
Your score is
The average score is 54%
Restart quiz
