CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

Discard a line with both endpoints outside clipping boundaries is called as

2 / 50

A two dimensional rotation is applied to an object by repositioning it along a _____ path in the XY plane

3 / 50

A fractal is generally a property called ___________.

4 / 50

A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.

5 / 50

It is safe to assume that all raster-type monitors can accept the same input

6 / 50

( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.

7 / 50

Global coordinate systems can be defined with respect to local coordinate system

8 / 50

Both Boundary Filling and Flood filling algorithms are non-recursive techniques.

9 / 50

Computer graphics is very helpful in producing graphical representations for scientific visualization.

10 / 50

In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.

11 / 50

the horizontal refresh ------------------------------

12 / 50

polygons are basically concave polygons that may have self-intersecting edges.

13 / 50

__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.

14 / 50

Computer graphics is very helpful in producing graphical representations for scientific visualization.

15 / 50

We can draw the circle

16 / 50

In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.

17 / 50

Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon

18 / 50

Which one is not valid out code to perform trivial accept / reject test in line clipping:

19 / 50

__________ is the process of describing an object or scene so that we can construct an image of it

20 / 50

Bezier curve is tangent to the lines connecting ____.

21 / 50

We can take transpose of any matrix.

22 / 50

Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines

23 / 50

A unit vector has zero magnitude.

24 / 50

The process of subdivision an entity or surface into one or more non-overlapping primitives.

25 / 50

Parity is a concept used to determine which ________ lie within a polygon.

26 / 50

We can draw the circle using _________

27 / 50

25 * 10 resolution with 16 colors supports

28 / 50

To show 256 colors , the no of bits required for each pixel are

29 / 50

Save a line with both endpoints inside all clipping boundaries.

30 / 50

Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.

31 / 50

Various curve functions are useful in ______.

32 / 50

Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.

33 / 50

The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:

34 / 50

The process of subdivision an entity or surface into one or more non-overlapping primitives.

35 / 50

Plasma-panel displays use a gas mixture that usually includes ____.

36 / 50

Two points are said to be collinear, if they lie on the

37 / 50

Twice the radius of circle is called as ___________.

38 / 50

Orthographic projections that show more than one side of an object are called __________ projections.

39 / 50

Two matrices are said to be equal, if they have

40 / 50

In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.

41 / 50

Tessellation can be adaptive to the ____________ degree of curvature of a surface.

42 / 50

The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.

43 / 50

Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.

44 / 50

Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:

45 / 50

Concave polygons are a superset of ____________ polygons, having fewer restrictions than  ___________ polygons.

46 / 50

DDA abbreviated for ________.

47 / 50

The curve is always contained within the _______ of the control points

48 / 50

If the polygons are _______, line-clipping techniques are sufficient for clipping.

49 / 50

A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.

50 / 50

The axonometric projection is ___________ where the direction of projection makes same angle with all axes.

Your score is

The average score is 54%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi