CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

We can take transpose of any matrix.

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

_________ direct view storage tube maintains the picture display.

9 / 50

When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.

10 / 50

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

11 / 50

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

12 / 50

Boundary Filling Algorithm can work for complex polygons.

13 / 50

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

14 / 50

We can draw the circle using _________

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.

19 / 50

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

20 / 50

Translation moves objects without ____________.

21 / 50

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

22 / 50

Cross product of two vectors result in a ___________.

23 / 50

A scaling transformation alters the ______ of an object.

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

Various curve functions are useful in ______.

28 / 50

Polygons consisting of ________ can cause problems when rendering.

29 / 50

We can draw the circle using _________

30 / 50

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

31 / 50

Process of moving points in space is called

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

_________ OpenGL function is used for aiming and positioning the camera towards the object

38 / 50

Various curve functions are useful in ______.

39 / 50

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

40 / 50

We can draw the circle

41 / 50

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

42 / 50

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

43 / 50

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

44 / 50

There are _________ basic types of polygon.

45 / 50

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

46 / 50

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

47 / 50

Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.

48 / 50

Boundary Filling Algorithm can work for complex polygons.

49 / 50

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

50 / 50

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

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