CS602-Midterm
1 / 50
Twice the radius of circle is called as ___________.
2 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
3 / 50
DDA abbreviated for ________.
4 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
5 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
6 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
7 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
8 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
9 / 50
A unit vector has zero magnitude.
10 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
11 / 50
Bezier curve is tangent to the lines connecting ____.
12 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
13 / 50
We can draw the circle using ___________.
14 / 50
Various curve functions are useful in ______.
15 / 50
In video text memory, ________ are used to display a character.
16 / 50
Parity is a concept used to determine which ________ lie within a polygon.
17 / 50
________is used to move a point, or a set of points, linearly in space
18 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
19 / 50
We can take transpose of any matrix.
20 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
21 / 50
“Computer Graphics” and “Computer Vision” are ____________.
22 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
23 / 50
We can draw the circle using _________
24 / 50
________ is the set of points that are equidistant from its origin.
25 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
26 / 50
Rotating a point requires
27 / 50
DDA abbreviated for _________.
28 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
29 / 50
30 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
31 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
32 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
33 / 50
Vectors can be multiplied in a way
34 / 50
Save a line with both endpoints inside all clipping boundaries.
35 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
36 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
37 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
38 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit3 represents condition _____.
39 / 50
A scaling transformation alters the ______ of an object.
40 / 50
Shadow mask methods can display a __________ range of colors.
41 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
42 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
43 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
44 / 50
45 / 50
46 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
47 / 50
Set up your tripod and pointing the camera at the scene
48 / 50
Each hyperbola consists of two ___________.
49 / 50
50 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
Your score is
The average score is 54%
Restart quiz
