CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

Set up your tripod and pointing the camera at the scene

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

A scaling transformation alters the ______ of an object.

6 / 50

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

7 / 50

A scaling transformation alters the ______ of an object.

8 / 50

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

9 / 50

A fractal is generally a property called ___________.

10 / 50

25 * 10 resolution with 16 colors supports

11 / 50

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

12 / 50

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

13 / 50

We can take transpose of any matrix.

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

Process of moving points in space is called

20 / 50

Computer Graphics are used in ____________.

21 / 50

The father of Computer Graphics is:

22 / 50

Boundary Filling Algorithm can work for complex polygons.

23 / 50

Bezier curve can represent the more complex piecewise ___________ curve.

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

Boundary Filling Algorithm can work for complex polygons.

28 / 50

Shadow mask methods can display a __________ range of colours.

29 / 50

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

30 / 50

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

31 / 50

Each hyperbola consists of two ___________.

32 / 50

Shadow mask methods can display a __________ range of colors.

33 / 50

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

34 / 50

Twice the radius of circle is called as ___________.

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

Boundary Filling Algorithm can work for complex polygons.

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

Computer Graphics are used in _______.

47 / 50

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

48 / 50

Rotating a point requires

49 / 50

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

50 / 50

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

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