CS602-Midterm
1 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
2 / 50
Finding unit vector is done by simply dividing each component by the width.
3 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
4 / 50
Discard a line with both endpoints outside clipping boundaries is called as
5 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
6 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
7 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
8 / 50
We can draw the circle using _________
9 / 50
There are _________ basic types of polygon.
10 / 50
In video text memory, ______ are used to display a character.
11 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
12 / 50
To show 256 colors , the no of bits required for each pixel are
13 / 50
“Computer Graphics” and “Computer Vision” are ____________.
14 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
15 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
16 / 50
________is used to move a point, or a set of points, linearly in space
17 / 50
Twice the radius of circle is called as ___________.
18 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
19 / 50
The dot product of two vectors A and B is __________. Iff the angle between them is less than 20 or greater than 270 degrees.
20 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
21 / 50
Vectors can be multiplied in a way
22 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
23 / 50
We can take transpose of any matrix.
24 / 50
25 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
26 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
27 / 50
28 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
29 / 50
Global coordinate systems can be defined with respect to local coordinate system
30 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
31 / 50
Various curve functions are useful in ______.
32 / 50
Boundary Filling Algorithm can work for complex polygons.
33 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
34 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
35 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
36 / 50
37 / 50
Shadow mask methods can display a __________ range of colors.
38 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
39 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
40 / 50
41 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
42 / 50
43 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
44 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
45 / 50
46 / 50
Rotation performed around a fixed point called ____________.
47 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____ path in the XY plane
48 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
49 / 50
50 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
Your score is
The average score is 54%
Restart quiz
