CS602-Midterm
1 / 50
Each hyperbola consists of two __________ .
2 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
3 / 50
Monochrome Adapter (MA) is a single color adapter
4 / 50
In video text memory, ________ are used to display a character.
5 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
6 / 50
Process of moving points in space is called
7 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
8 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
9 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
10 / 50
Global coordinate systems can be defined with respect to local coordinate system
11 / 50
Discard a line with both endpoints outside clipping boundaries is called as
12 / 50
Set up your tripod and pointing the camera at the scene
13 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
14 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
15 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
16 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
17 / 50
Shadow mask methods can display a __________ range of colors.
18 / 50
We can draw the circle
19 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
20 / 50
21 / 50
The curve is always contained within the _______ of the control points
22 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
23 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
24 / 50
25 / 50
DDA abbreviated for ________.
26 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
27 / 50
________is used to move a point, or a set of points, linearly in space
28 / 50
Save a line with both endpoints inside all clipping boundaries.
29 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
30 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
31 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
32 / 50
Boundary Filling Algorithm can work for complex polygons.
33 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
34 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
35 / 50
The circle and ellipse are symmetric across 1 octants.
36 / 50
Translation moves objects without ____________.
37 / 50
Various curve functions are useful in ______.
38 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
39 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
40 / 50
41 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
42 / 50
43 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
44 / 50
45 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
46 / 50
Shadow mask methods can display a __________ range of colours.
47 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
48 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
49 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
50 / 50
Vectors can be multiplied in a way
Your score is
The average score is 54%
Restart quiz
