CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

We can draw the circle using ___________.

2 / 50

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

3 / 50

________is used to move a point, or a set of points, linearly in space

4 / 50

Each hyperbola consists of two __________ .

5 / 50

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

6 / 50

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

7 / 50

Finding unit vector is done by simply dividing each component by the width.

8 / 50

DDA abbreviated for _________.

9 / 50

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

10 / 50

The circle and ellipse are symmetric across 1 octants.

11 / 50

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

12 / 50

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

13 / 50

A scaling transformation alters the ______ of an object.

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

If the polygons are _________ line clipping techniques are sufficient for clipping.

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

Which of the following is not true about matrices?

22 / 50

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

23 / 50

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

24 / 50

If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

Which one of the following step is not involved to write pixel using video BIOS services.

29 / 50

There are _________ basic types of polygon.

30 / 50

DDA abbreviated for ________.

31 / 50

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

32 / 50

We can take transpose of any matrix.

33 / 50

Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?

34 / 50

Boundary Filling Algorithm can work for complex polygons.

35 / 50

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

36 / 50

_________ direct view storage tube maintains the picture display.

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

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

41 / 50

Translation moves objects without ____________.

42 / 50

Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.

43 / 50

Save a line with both endpoints inside all clipping boundaries is called as ____.

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

Polygons consisting of ________ can cause problems when rendering.

49 / 50

In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.

50 / 50

Which one of the following step is not involved to write pixel using video BIOS services.

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