CS602-Midterm
1 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
2 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
3 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
4 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
5 / 50
Each number that makes up a matrix is called an __________ of the matrix.
6 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
7 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
8 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
9 / 50
10 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
11 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
12 / 50
DDA abbreviated for ________.
13 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
14 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
15 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
16 / 50
Vectors can be multiplied in a way
17 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
18 / 50
Monochrome Adapter (MA) is a single color adapter
19 / 50
Computer Graphics are used in ____________.
20 / 50
Boundary Filling Algorithm can work for complex polygons.
21 / 50
22 / 50
We can take transpose of __________.
23 / 50
Discard a line with both endpoints outside clipping boundaries is called as
24 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
25 / 50
Parity is a concept used to determine which ________ lie within a polygon.
26 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
27 / 50
28 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
29 / 50
25 * 10 resolution with 16 colors supports
30 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
31 / 50
Which of the following is not true about matrices?
32 / 50
Three or more points that lie on the same line are called _____.
33 / 50
Shadow mask methods can display a __________ range of colours.
34 / 50
Rotating a point requires
35 / 50
Various curve functions are useful in ______.
36 / 50
Rotation performed around a fixed point called ____________.
37 / 50
the horizontal refresh ------------------------------
38 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
39 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
40 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
41 / 50
There are _________ basic types of polygon.
42 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
43 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
44 / 50
Which one of the following is not the graphics library is use:
45 / 50
Finding unit vector is done by simply dividing each component by the width.
46 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
47 / 50
Because clipping against one edge is independent to all others, so it is ________ arrange the clipping stages in a pipeline.
48 / 50
49 / 50
50 / 50
Twice the radius of circle is called as ___________.
Your score is
The average score is 54%
Restart quiz
