CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

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

3 / 50

DDA abbreviated for _________.

4 / 50

Orthographic projections that show more than one side of an object are called __________ projections.

5 / 50

A fractal is generally a property called ___________.

6 / 50

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

7 / 50

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

8 / 50

A scaling transformation alters the ______ of an object.

9 / 50

Bezier curve is tangent to the lines connecting ____.

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

Bernstein polynomial functions are the basic functions of _____ curves.

15 / 50

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

16 / 50

Various curve functions are useful in ______.

17 / 50

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

18 / 50

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

19 / 50

Computer Graphics are used in _______.

20 / 50

There are _________ basic types of polygon.

21 / 50

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

22 / 50

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

23 / 50

Monochrome Adapter (MA) is a single color adapter

24 / 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.

25 / 50

We can take transpose of any matrix.

26 / 50

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

27 / 50

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

28 / 50

The father of Computer Graphics is:

29 / 50

Vectors can be multiplied in a way

30 / 50

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

31 / 50

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

32 / 50

DDA abbreviated for ________.

33 / 50

Translation moves objects without ____________.

34 / 50

A scaling transformation alters the ______ of an object.

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

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

40 / 50

Various curve functions are useful in ______.

41 / 50

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

42 / 50

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

43 / 50

Vectors can be multiplied in a way

44 / 50

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

45 / 50

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

46 / 50

There are _______ basic types of polygon.

47 / 50

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

48 / 50

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

49 / 50

Twice the radius of circle is called as ___________.

50 / 50

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

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