CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

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

3 / 50

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

4 / 50

Computer Graphics are used in ____________.

5 / 50

Computer Graphics are used in _______.

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

A scaling transformation alters the ______ of an object.

12 / 50

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

13 / 50

the horizontal refresh ------------------------------

14 / 50

Parity is a concept used to determine which ________ lie within a polygon.

15 / 50

Normalized cross product of two vectors on that surface provides normal vector

16 / 50

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

17 / 50

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

18 / 50

Monochrome Adapter (MA) is a single color adapter

19 / 50

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

20 / 50

Rotating a point requires

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

Various curve functions are useful in ______.

31 / 50

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

32 / 50

Boundary Filling Algorithm can work for complex polygons.

33 / 50

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

34 / 50

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

35 / 50

A unit vector has zero magnitude.

36 / 50

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

37 / 50

Cross product of two vectors result in a ___________.

38 / 50

Set up your tripod and pointing the camera at the scene

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

25 * 10 resolution with 16 colors supports

43 / 50

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

44 / 50

DDA abbreviated for ________.

45 / 50

Bezier curve can represent the more complex piecewise ___________ curve.

46 / 50

Each hyperbola consists of two ___________.

47 / 50

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

48 / 50

We can draw the circle using ___________.

49 / 50

Polygons consisting of ________ can cause problems when rendering.

50 / 50

Each hyperbola consists of two __________ .

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