CS602-Midterm
1 / 50
25 * 10 resolution with 16 colors supports
2 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
3 / 50
Rotating a point requires
4 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
5 / 50
Save a line with both endpoints inside all clipping boundaries.
6 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
7 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
8 / 50
Boundary Filling Algorithm can work for complex polygons.
9 / 50
Discard a line with both endpoints outside clipping boundaries is called as
10 / 50
Which of the following is not true about matrices?
11 / 50
Vectors can be multiplied in a way
12 / 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.
13 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
14 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
15 / 50
Finding unit vector is done by simply dividing each component by the width.
16 / 50
Translation moves objects without ____________.
17 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
18 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
19 / 50
20 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
21 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
22 / 50
In video text memory, ________ are used to display a character.
23 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
24 / 50
Shadow mask methods can display a __________ range of colours.
25 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
26 / 50
“Computer Graphics” and “Computer Vision” are ____________.
27 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
28 / 50
There are _________ basic types of polygon.
29 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
30 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
31 / 50
Parity is a concept used to determine which ________ lie within a polygon.
32 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
33 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
34 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
35 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
36 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
37 / 50
Twice the radius of circle is called as ___________.
38 / 50
39 / 50
The circle and ellipse are symmetric across 1 octants.
40 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
41 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
42 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
43 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
44 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
45 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
46 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
47 / 50
To show 256 colors , the no of bits required for each pixel are
48 / 50
polygons are basically concave polygons that may have self-intersecting edges.
49 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
50 / 50
Normalized cross product of two vectors on that surface provides normal vector
Your score is
The average score is 54%
Restart quiz
