CS602-Midterm
1 / 50
Shadow mask methods can display a __________ range of colours.
2 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
3 / 50
We can draw the circle
4 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
5 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
6 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
7 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
8 / 50
Translation moves objects without ____________.
9 / 50
Polygons are basically concave polygons that may have self-intersecting edges
10 / 50
Discard a line with both endpoints outside clipping boundaries is called as
11 / 50
Shadow mask methods can display a __________ range of colors.
12 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
13 / 50
Two matrices are said to be equal, if they have
14 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
15 / 50
Two points are said to be collinear, if they lie on the
16 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
17 / 50
Twice the radius of circle is called as ___________.
18 / 50
25 * 10 resolution with 16 colors supports
19 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
20 / 50
We can take transpose of __________.
21 / 50
We can draw the circle using _________
22 / 50
the horizontal refresh ------------------------------
23 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
24 / 50
A scaling transformation alters the ______ of an object.
25 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
26 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
27 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
28 / 50
Each hyperbola consists of two __________ .
29 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
30 / 50
Computer Graphics are used in _______.
31 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
32 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
33 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
34 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
35 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
36 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
37 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
38 / 50
Parity is a concept used to determine which ________ lie within a polygon.
39 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
40 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
41 / 50
Rotating a point requires
42 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
43 / 50
Set up your tripod and pointing the camera at the scene
44 / 50
In __________ algorithm(s), old color must be read before it is invoked.
45 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
46 / 50
A fractal is generally a property called ___________.
47 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
48 / 50
DDA abbreviated for _________.
49 / 50
50 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
Your score is
The average score is 54%
Restart quiz
