CS602-Midterm
1 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
2 / 50
Shadow mask methods can display a __________ range of colors.
3 / 50
Rotating a point requires
4 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
5 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
6 / 50
Polygons are basically concave polygons that may have self-intersecting edges
7 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
8 / 50
We can take transpose of __________.
9 / 50
There are _______ basic types of polygon.
10 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
11 / 50
________ is the set of points that are equidistant from its origin.
12 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
13 / 50
Parity is a concept used to determine which ________ lie within a polygon.
14 / 50
Various curve functions are useful in ______.
15 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
16 / 50
25 * 10 resolution with 16 colors supports
17 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
18 / 50
Each number that makes up a matrix is called an __________ of the matrix.
19 / 50
We can draw the circle
20 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
21 / 50
Perspective projection is specified with the function glFrustum().
22 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
23 / 50
Two points are said to be collinear, if they lie on the
24 / 50
Polygons consisting of ________ can cause problems when rendering.
25 / 50
26 / 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.
27 / 50
Computer Graphics are used in _______.
28 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
29 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
30 / 50
____is the tendency of the text to flash as it moves up or down.
31 / 50
Finding unit vector is done by simply dividing each component by the width.
32 / 50
Discard a line with both endpoints outside clipping boundaries is called as
33 / 50
The father of Computer Graphics is:
34 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
35 / 50
Cross product of two vectors result in a ___________.
36 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
37 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
38 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
39 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
40 / 50
To show 256 colors , the no of bits required for each pixel are
41 / 50
Twice the radius of circle is called as ___________.
42 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
43 / 50
_________ direct view storage tube maintains the picture display.
44 / 50
45 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
46 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
47 / 50
48 / 50
Global coordinate systems can be defined with respect to local coordinate system
49 / 50
Save a line with both endpoints inside all clipping boundaries.
50 / 50
Your score is
The average score is 54%
Restart quiz
