CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

Translation moves objects without ____________.

3 / 50

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

4 / 50

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

5 / 50

Computer Graphics are used in _______.

6 / 50

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

7 / 50

The circle and ellipse are symmetric across 1 octants.

8 / 50

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

9 / 50

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

10 / 50

Computer Graphics are used in ____________.

11 / 50

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

12 / 50

Monochrome Adapter (MA) is a single color adapter

13 / 50

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

14 / 50

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

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

16 / 50

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

17 / 50

Boundary Filling Algorithm can work for complex polygons.

18 / 50

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

19 / 50

Two matrices are said to be equal, if they have

20 / 50

Each hyperbola consists of two ___________.

21 / 50

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

22 / 50

Rotating a point requires

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

There are _________ basic types of polygon.

27 / 50

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

28 / 50

Various curve functions are useful in ______.

29 / 50

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

30 / 50

The father of Computer Graphics is:

31 / 50

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

32 / 50

Tessellation can be adaptive to the ____________ degree of curvature of a surface.

33 / 50

Set up your tripod and pointing the camera at the scene

34 / 50

Each hyperbola consists of two __________ .

35 / 50

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

36 / 50

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

37 / 50

A scaling transformation alters the ______ of an object.

38 / 50

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

39 / 50

The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.

40 / 50

Which of the following is not true about matrices?

41 / 50

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

42 / 50

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

43 / 50

Shadow mask methods can display a __________ range of colours.

44 / 50

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

45 / 50

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

46 / 50

Polygons consisting of ________ can cause problems when rendering.

47 / 50

Boundary Filling Algorithm can work for complex polygons.

48 / 50

Vectors can be multiplied in a way

49 / 50

Cross product of two vectors result in a ___________.

50 / 50

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

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