CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

A unit vector has zero magnitude.

7 / 50

“Computer Graphics” and “Computer Vision” are ____________.

8 / 50

Two matrices are said to be equal, if they have

9 / 50

The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.

10 / 50

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

11 / 50

DDA abbreviated for ________.

12 / 50

Each number that makes up a matrix is called an __________ of the matrix.

13 / 50

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

14 / 50

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

15 / 50

Translation moves objects without ____________.

16 / 50

Save a line with both endpoints inside all clipping boundaries.

17 / 50

This projection technique has the direction of projection perpendicular to the viewing plane, and the viewing direction is perpendicular to one of the principle faces.

18 / 50

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

19 / 50

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

20 / 50

Perspective projection is specified with the function glFrustum().

21 / 50

Cross product of two vectors result in a ___________.

22 / 50

_________ direct view storage tube maintains the picture display.

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

We can draw the circle using ___________.

27 / 50

Each hyperbola consists of two ___________.

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Each hyperbola consists of two __________ .

33 / 50

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

34 / 50

A fractal is generally a property called ___________.

35 / 50

25 * 10 resolution with 16 colors supports

36 / 50

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

37 / 50

There are _________ basic types of polygon.

38 / 50

DDA abbreviated for _________.

39 / 50

Various curve functions are useful in ______.

40 / 50

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

41 / 50

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

42 / 50

Twice the radius of circle is called as ___________.

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

The father of Computer Graphics is:

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

Vectors can be multiplied in a way

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