CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

Save a line with both endpoints inside all clipping boundaries is called as ____.

2 / 50

A scaling transformation alters the ______ of an object.

3 / 50

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

4 / 50

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

5 / 50

Global coordinate systems can be defined with respect to local coordinate system

6 / 50

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

7 / 50

Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

Cross product of two vectors result in a ___________.

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

Perspective projection is specified with the function glFrustum().

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

Various curve functions are useful in ______.

27 / 50

Bezier curve is tangent to the lines connecting ____.

28 / 50

We can draw the circle using ___________.

29 / 50

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

30 / 50

Process of moving points in space is called

31 / 50

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

32 / 50

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

33 / 50

To move a _________ from one location to another, we translate the center point and redraw the same using new center point.

34 / 50

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

35 / 50

Monochrome Adapter (MA) is a single color adapter

36 / 50

Vectors can be multiplied in a way

37 / 50

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

38 / 50

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

39 / 50

We can take transpose of __________.

40 / 50

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

41 / 50

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

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

43 / 50

Shadow mask methods can display a __________ range of colours.

44 / 50

Polygons consisting of ________ can cause problems when rendering.

45 / 50

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

46 / 50

Bezier curve can represent the more complex piecewise ___________ curve.

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

The circle and ellipse are symmetric across 1 octants.

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