CS602 Midterm Online Quiz

0%

CS602-Midterm

1 / 50

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

2 / 50

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

3 / 50

Bernstein polynomial functions are the basic functions of _____ curves.

4 / 50

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

5 / 50

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

6 / 50

Save a line with both endpoints inside all clipping boundaries.

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

Rotation performed around a fixed point called ____________.

12 / 50

A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors

13 / 50

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

14 / 50

Each number that makes up a matrix is called an __________ of the matrix.

15 / 50

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

16 / 50

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

17 / 50

The father of Computer Graphics is:

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

DDA abbreviated for _________.

22 / 50

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

23 / 50

We can take transpose of __________.

24 / 50

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

25 / 50

A scaling transformation alters the ______ of an object.

26 / 50

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

27 / 50

Bezier curve is tangent to the lines connecting ____.

28 / 50

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

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

30 / 50

A fractal is generally a property called ___________.

31 / 50

Boundary Filling Algorithm can work for complex polygons.

32 / 50

Rotating a point requires

33 / 50

Various curve functions are useful in ______.

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

In Trimetric the direction of projection makes unequal angle with the three principal axes

38 / 50

UV light is used in Plasma Panel displays to excite phosphor.

39 / 50

Computer Graphics are used in ____________.

40 / 50

Vectors can be multiplied in a way

41 / 50

Vectors can be multiplied in a way

42 / 50

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

43 / 50

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

44 / 50

Each hyperbola consists of two __________ .

45 / 50

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

46 / 50

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

47 / 50

There are _______ basic types of polygon.

48 / 50

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

49 / 50

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

50 / 50

In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.

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