CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

A scaling transformation alters the ______ of an object.

3 / 50

Which one of the following is not the graphics library is use:

4 / 50

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

5 / 50

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

6 / 50

Vectors can be multiplied in a way

7 / 50

Process of moving points in space is called

8 / 50

The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors

14 / 50

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

15 / 50

We can take transpose of any matrix.

16 / 50

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

17 / 50

Boundary Filling Algorithm can work for complex polygons.

18 / 50

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

19 / 50

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

20 / 50

In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.

21 / 50

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

22 / 50

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

23 / 50

Shadow mask methods can display a __________ range of colours.

24 / 50

Discard a line with both endpoints outside clipping boundary is called as ____________

25 / 50

Boundary Filling Algorithm can work for complex polygons.

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

A fractal is generally a property called ___________.

32 / 50

Various curve functions are useful in ______.

33 / 50

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

34 / 50

We can draw the circle using _________

35 / 50

We can draw the circle using ___________.

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

Bezier curve can represent the more complex piecewise ___________ curve.

41 / 50

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

42 / 50

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

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

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

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