Explore topic-wise MCQs in Computer Graphics.

This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Graphics knowledge and support exam preparation. Choose a topic below to get started.

1.

THE_ALGORITHM_WHICH_USES_MULTIPLE_PROCESSORS_TO_CALCULATE_PIXEL_POSITIONS_IS?$

A. Midpoint algorithm
B. Parallel line algorithm
C. Bresenham’s line algorithm
D. All of the mentioned
Answer» B. Parallel line algorithm
Discussion
2.

To apply the midpoint method, we define$

A. ?circle(x, y)= x <sup>2</sup>+ y <sup>2</sup>-? r?<sup>2</sup>
B. ?circle(x, y)= x+ y <sup>2</sup>-? r?<sup>2</sup>
C. ?circle(x, y)= x <sup>2</sup>– y <sup>2</sup>-? r?<sup>2</sup>
D. ?circle(x, y)= x<sup>2</sup>+ y <sup>2</sup>-? z?<sup>2</sup>
Answer» C. ?circle(x, y)= x <sup>2</sup>‚Äö√Ñ√∂‚àö√ë‚àö¬® y <sup>2</sup>-? r?<sup>2</sup>
Discussion
3.

Coordinate references in the polyline function are stated as$

A. Relative coordinate values
B. Absolute coordinate values
C. Current position
D. Real coordinate values
Answer» C. Current position
Discussion
4.

If we want to recolor an area that is not defined within a single color boundary is known as

A. Boundary-fill algorithm
B. Parallel curve algorithm
C. Flood-fill algorithm
D. Only b
Answer» C. Flood-fill algorithm
Discussion
5.

If the boundary is specified in a single color, and if the algorithm proceeds pixel by pixel until the boundary color is encountered is called

A. Scan-line fill algorithm
B. Boundary-fill algorithm
C. Flood-fill algorithm
D. Parallel curve algorithm
Answer» E.
Discussion
6.

_______ is defined as set of points such that the sum of the distances is same for all points.

A. Ellipses
B. Lines
C. Circles
D. Only a
Answer» B. Lines
Discussion
7.

Which is the best line algorithm to balance the processing load among the processers?

A. Parallel line algorithm
B. DDA line algorithm
C. Bresenham’s line algorithm
D. Position Bresenham’s line algorithm
Answer» D. Position Bresenham‚Äö√Ñ√∂‚àö√ë‚àö¬•s line algorithm
Discussion
8.

In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______$

A. Positive
B. Equal
C. Negative
D. Option a or c
Answer» E.
Discussion
9.

An accurate and efficient raster line-generating algorithm is

A. DDA algorithm
B. Mid-point algorithm
C. Parallel line algorithm
D. Bresenham’s line algorithm
Answer» B. Mid-point algorithm
Discussion
10.

The disadvantage of lineDDA is

A. Time consuming
B. Faster
C. Neither a nor b
D. None of the mentioned
Answer» E.
Discussion
11.

Which algorithm is a faster method for calculating pixel positions?

A. Bresenham’s line algorithm
B. Parallel line algorithm
C. Mid-point algorithm
D. DDA line algorithm
Answer» D. DDA line algorithm
Discussion
12.

Expansion of line DDA algorithm is

A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
Answer» D. Data differential analyzer
Discussion
13.

On raster system, lines are plotted with

A. Lines
B. Dots
C. Pixels
D. None of the mentioned
Answer» C. Pixels
Discussion
14.

For lines with slope magnitude |m|<1, ?x can be_________

A. A set corresponding vertical deflection
B. A set proportional to a small horizontal deflection voltage
C. Only a
D. All of the mentioned
Answer» B. A set proportional to a small horizontal deflection voltage
Discussion