CS602-Midterm
1 / 50
DDA abbreviated for _________.
2 / 50
In video text memory, ______ are used to display a character.
3 / 50
Discard a line with both endpoints outside clipping boundaries is called as
4 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
5 / 50
________ is the set of points that are equidistant from its origin.
6 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
7 / 50
8 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
9 / 50
10 / 50
the horizontal refresh ------------------------------
11 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
12 / 50
Boundary Filling Algorithm can work for complex polygons.
13 / 50
We can draw the circle using _________
14 / 50
Normalized cross product of two vectors on that surface provides normal vector
15 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
16 / 50
Translation moves objects without ____________.
17 / 50
It is safe to assume that all raster-type monitors can accept the same input
18 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
19 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
20 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
21 / 50
Process of moving points in space is called
22 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
23 / 50
Various curve functions are useful in ______.
24 / 50
The circle and ellipse are symmetric across 1 octants.
25 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
26 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
27 / 50
Twice the radius of circle is called as ___________.
28 / 50
DDA abbreviated for ________.
29 / 50
Bezier curve is tangent to the lines connecting ____.
30 / 50
Two matrices are said to be equal, if they have
31 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
32 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
33 / 50
Save a line with both endpoints inside all clipping boundaries is called as ____.
34 / 50
We can take transpose of __________.
35 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
36 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
37 / 50
Computer Graphics are used in _______.
38 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
39 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
40 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____ path in the XY plane
41 / 50
42 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
43 / 50
44 / 50
45 / 50
46 / 50
Finding unit vector is done by simply dividing each component by the width.
47 / 50
48 / 50
Which of the following is not true about matrices?
49 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
50 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
Your score is
The average score is 54%
Restart quiz
