CS602-Midterm
1 / 50
We can draw the circle using _________
2 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
3 / 50
Computer Graphics are used in _______.
4 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
5 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
6 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
7 / 50
Boundary Filling Algorithm can work for complex polygons.
8 / 50
We can take transpose of __________.
9 / 50
________ is the set of points that are equidistant from its origin.
10 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
11 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
12 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
13 / 50
Monochrome Adapter (MA) is a single color adapter
14 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
15 / 50
16 / 50
Two points are said to be collinear, if they lie on the
17 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
18 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
19 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
20 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
21 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
22 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
23 / 50
A unit vector has zero magnitude.
24 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
25 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
26 / 50
The curve is always contained within the _______ of the control points
27 / 50
DDA abbreviated for ________.
28 / 50
There are _______ basic types of polygon.
29 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
30 / 50
It is safe to assume that all raster-type monitors can accept the same input
31 / 50
Each hyperbola consists of two ___________.
32 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
33 / 50
Each number that makes up a matrix is called an __________ of the matrix.
34 / 50
Various curve functions are useful in ______.
35 / 50
Rotating a point requires
36 / 50
Bezier curve is tangent to the lines connecting ____.
37 / 50
Rotation performed around a fixed point called ____________.
38 / 50
39 / 50
40 / 50
Parity is a concept used to determine which ________ lie within a polygon.
41 / 50
Vectors can be multiplied in a way
42 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
43 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
44 / 50
We can draw the circle
45 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
46 / 50
47 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
48 / 50
Cross product of two vectors result in a ___________.
49 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
50 / 50
Global coordinate systems can be defined with respect to local coordinate system
Your score is
The average score is 54%
Restart quiz
