CS602-Midterm
1 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
2 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
3 / 50
____is the tendency of the text to flash as it moves up or down.
4 / 50
________is used to move a point, or a set of points, linearly in space
5 / 50
In video text memory, ______ are used to display a character.
6 / 50
Two points are said to be collinear, if they lie on the
7 / 50
A scaling transformation alters the ______ of an object.
8 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
9 / 50
We can take transpose of __________.
10 / 50
Various curve functions are useful in ______.
11 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
12 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
13 / 50
Boundary Filling Algorithm can work for complex polygons.
14 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
15 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
16 / 50
Monochrome Adapter (MA) is a single color adapter
17 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
18 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
19 / 50
Three or more points that lie on the same line are called _____.
20 / 50
21 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
22 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
23 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
24 / 50
25 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
26 / 50
Computer Graphics are used in ____________.
27 / 50
Bezier curve is tangent to the lines connecting ____.
28 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
29 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
30 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
31 / 50
32 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
33 / 50
Vectors can be multiplied in a way
34 / 50
Normalized cross product of two vectors on that surface provides normal vector
35 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
36 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
37 / 50
We can draw the circle using _________
38 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
39 / 50
A fractal is generally a property called ___________.
40 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
41 / 50
the horizontal refresh ------------------------------
42 / 50
43 / 50
Shadow mask methods can display a __________ range of colours.
44 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
45 / 50
Save a line with both endpoints inside all clipping boundaries.
46 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
47 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
48 / 50
49 / 50
Polygons consisting of ________ can cause problems when rendering.
50 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
Your score is
The average score is 54%
Restart quiz
