CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

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

3 / 50

We can take transpose of any matrix.

4 / 50

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

5 / 50

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

6 / 50

Vectors can be multiplied in a way

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

Various curve functions are useful in ______.

11 / 50

Various curve functions are useful in ______.

12 / 50

We can draw the circle using _________

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

We can take transpose of any matrix.

18 / 50

Silhouette edges occur when dot product of surface normal vector and the view vector is __________.

19 / 50

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

20 / 50

The father of Computer Graphics is:

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

DDA abbreviated for ________.

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

The axonometric projection is ___________ where the direction of projection makes same angle with all axes.

30 / 50

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

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

Bezier curve can represent the more complex piecewise ___________ curve.

35 / 50

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

36 / 50

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

37 / 50

Save a line with both endpoints inside all clipping boundaries.

38 / 50

The dot product of two vectors A and B is __________. Iff the angle between them is less than 20 or greater than 270 degrees.

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

Boundary Filling Algorithm can work for complex polygons.

43 / 50

A fractal is generally a property called ___________.

44 / 50

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

45 / 50

Bernstein polynomial functions are the basic functions of _____ curves.

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

Boundary Filling Algorithm can work for complex polygons.

50 / 50

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

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