CS602-Midterm
1 / 50
In __________ algorithm(s), old color must be read before it is invoked.
2 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
3 / 50
Two points are said to be collinear, if they lie on the
4 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
5 / 50
Various curve functions are useful in ______.
6 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
7 / 50
Monochrome Adapter (MA) is a single color adapter
8 / 50
____is the tendency of the text to flash as it moves up or down.
9 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
10 / 50
Polygons consisting of ________ can cause problems when rendering.
11 / 50
________ is the set of points that are equidistant from its origin.
12 / 50
There are _______ basic types of polygon.
13 / 50
Perspective projection is specified with the function glFrustum().
14 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
15 / 50
Boundary Filling Algorithm can work for complex polygons.
16 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
17 / 50
A fractal is generally a property called ___________.
18 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
19 / 50
20 / 50
We can draw the circle using ___________.
21 / 50
Parity is a concept used to determine which ________ lie within a polygon.
22 / 50
Each hyperbola consists of two __________ .
23 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
24 / 50
25 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
26 / 50
Rotating a point requires
27 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
28 / 50
Cross product of two vectors result in a ___________.
29 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
30 / 50
polygons are basically concave polygons that may have self-intersecting edges.
31 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
32 / 50
_________ direct view storage tube maintains the picture display.
33 / 50
Computer Graphics are used in _______.
34 / 50
Global coordinate systems can be defined with respect to local coordinate system
35 / 50
The father of Computer Graphics is:
36 / 50
Vectors can be multiplied in a way
37 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
38 / 50
39 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
40 / 50
41 / 50
42 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
43 / 50
We can draw the circle using _________
44 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
45 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
46 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
47 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
48 / 50
Shadow mask methods can display a __________ range of colours.
49 / 50
The curve is always contained within the _______ of the control points
50 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
Your score is
The average score is 54%
Restart quiz
