CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

We can take transpose of __________.

3 / 50

Which of the following is NOT a modern application for Computer Graphics -------------------

4 / 50

________ is the set of points that are equidistant from its origin.

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

Save a line with both endpoints inside all clipping boundaries.

10 / 50

Perspective projection is specified with the function glFrustum().

11 / 50

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

12 / 50

We can draw the circle using ___________.

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

Process of moving points in space is called

19 / 50

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

20 / 50

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

21 / 50

Computer Graphics are used in _______.

22 / 50

A fractal is generally a property called ___________.

23 / 50

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

24 / 50

Various curve functions are useful in ______.

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

We can take transpose of any matrix.

29 / 50

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

30 / 50

__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.

31 / 50

We can draw the circle using _________

32 / 50

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

33 / 50

Various curve functions are useful in ______.

34 / 50

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

35 / 50

____is the tendency of the text to flash as it moves up or down.

36 / 50

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

37 / 50

UV light is used in Plasma Panel displays to excite phosphor.

38 / 50

DDA abbreviated for ________.

39 / 50

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

40 / 50

The father of Computer Graphics is:

41 / 50

Various curve functions are useful in ______.

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

A scaling transformation alters the ______ of an object.

46 / 50

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

47 / 50

Bernstein polynomial functions are the basic functions of _____ curves.

48 / 50

actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.

49 / 50

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

50 / 50

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

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