CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

There are _________ basic types of polygon.

6 / 50

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

7 / 50

Bezier curve is tangent to the lines connecting ____.

8 / 50

We can take transpose of any matrix.

9 / 50

Cross product of two vectors result in a ___________.

10 / 50

Twice the radius of circle is called as ___________.

11 / 50

Silhouette edges occur when dot product of surface normal vector and the view vector is __________.

12 / 50

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

13 / 50

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

14 / 50

Set up your tripod and pointing the camera at the scene

15 / 50

Rotation performed around a fixed point called ____________.

16 / 50

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

17 / 50

Polygons consisting of ________ can cause problems when rendering.

18 / 50

In __________ algorithm(s), old color must be read before it is invoked.

19 / 50

In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.

20 / 50

By preserving the original shape of an object with a scaling is called _______ scaling.

21 / 50

Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

_________ OpenGL function is used for aiming and positioning the camera towards the object

27 / 50

A scaling transformation alters the ______ of an object.

28 / 50

Vectors can be multiplied in a way

29 / 50

The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.

30 / 50

Each hyperbola consists of two ___________.

31 / 50

The circle and ellipse are symmetric across 1 octants.

32 / 50

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

33 / 50

Three or more points that lie on the same line are called _____.

34 / 50

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

35 / 50

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

36 / 50

In Trimetric the direction of projection makes unequal angle with the three principal axes

37 / 50

Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.

38 / 50

According to Odd Parity Rule, a point is inside the polygon, if:

39 / 50

The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.

40 / 50

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

41 / 50

Various curve functions are useful in ______.

42 / 50

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

43 / 50

In video text memory, ______ are used to display a character.

44 / 50

25 * 10 resolution with 16 colors supports

45 / 50

The father of Computer Graphics is:

46 / 50

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

47 / 50

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

48 / 50

Shadow mask methods can display a __________ range of colors.

49 / 50

Process of moving points in space is called

50 / 50

We can take transpose of any matrix.

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