CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

Twice the radius of circle is called as ___________.

3 / 50

Rotation performed around a fixed point called ____________.

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.

16 / 50

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

17 / 50

The father of Computer Graphics is:

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.

22 / 50

We can draw the circle using _________

23 / 50

In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.

24 / 50

Rotating a point requires

25 / 50

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

26 / 50

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

27 / 50

A fractal is generally a property called ___________.

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Various curve functions are useful in ______.

33 / 50

We can take transpose of any matrix.

34 / 50

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

35 / 50

The circle and ellipse are symmetric across 1 octants.

36 / 50

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

37 / 50

Two matrices are said to be equal, if they have

38 / 50

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

39 / 50

Boundary Filling Algorithm can work for complex polygons.

40 / 50

DDA abbreviated for ________.

41 / 50

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

42 / 50

Save a line with both endpoints inside all clipping boundaries.

43 / 50

Process of moving points in space is called

44 / 50

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

45 / 50

Set up your tripod and pointing the camera at the scene

46 / 50

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

47 / 50

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

48 / 50

A scaling transformation alters the ______ of an object.

49 / 50

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

50 / 50

Boundary Filling Algorithm can work for complex polygons.

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