CS602-Midterm
1 / 50
Shadow mask methods can display a __________ range of colours.
2 / 50
Rotating a point requires
3 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
4 / 50
Perspective projection is specified with the function glFrustum().
5 / 50
Save a line with both endpoints inside all clipping boundaries.
6 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
7 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
8 / 50
Discard a line with both endpoints outside clipping boundaries is called as
9 / 50
Boundary Filling Algorithm can work for complex polygons.
10 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
11 / 50
________is used to move a point, or a set of points, linearly in space
12 / 50
Parity is a concept used to determine which ________ lie within a polygon.
13 / 50
In video text memory, ______ are used to display a character.
14 / 50
____is the tendency of the text to flash as it moves up or down.
15 / 50
________ is the set of points that are equidistant from its origin.
16 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
17 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
18 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
19 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
20 / 50
We can take transpose of any matrix.
21 / 50
Monochrome Adapter (MA) is a single color adapter
22 / 50
23 / 50
Each hyperbola consists of two ___________.
24 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
25 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
26 / 50
We can take transpose of __________.
27 / 50
In video text memory, ________ are used to display a character.
28 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
29 / 50
DDA abbreviated for _________.
30 / 50
Various curve functions are useful in ______.
31 / 50
Three or more points that lie on the same line are called _____.
32 / 50
Finding unit vector is done by simply dividing each component by the width.
33 / 50
Shadow mask methods can display a __________ range of colors.
34 / 50
Twice the radius of circle is called as ___________.
35 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
36 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
37 / 50
In __________ algorithm(s), old color must be read before it is invoked.
38 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
39 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
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
We can draw the circle using _________
42 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
43 / 50
Rotation performed around a fixed point called ____________.
44 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
45 / 50
46 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
47 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
48 / 50
49 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
50 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
Your score is
The average score is 54%
Restart quiz
