Computer Graphics Questions & Answers – Line Filling Algorithms

This section of our 1000+ Computer Graphics multiple choice questions focuses on Line Filling Algorithms.

1. The Cartesian slope-intercept equation for a straight line is
a) y = m.x + b
b) y = b.x + m
c) y = x.x + m
d) y = b + m.m

Explanation: Equation for a straight line is y = m.x + b.

2. 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

Explanation:?x can be a set proportional to a small horizontal deflection voltage only if slope magnitude |m| < 1.

3. On raster system, lines are plotted with
a) Lines
b) Dots
c) Pixels
d) None of the mentioned

Explanation: Using pixels lines can be plotted.

4. Expansion of line DDA algorithm is
a) Digital difference analyzer
b) Direct differential analyzer
c) Digital differential analyzer
d) Data differential analyzer

Explanation: DDA stands for digital differential analyzer.

5. 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

Explanation: The DDA is a faster method for calculating pixel positions.

6. The disadvantage of lineDDA is
a) Time consuming
b) Faster
c) Neither a nor b
d) None of the mentioned

Explanation: The DDA algorithm takes more time than other algorithm.

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

Explanation: Bresenham’s line algorithm is a very efficient and accurate algorithm.

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

Explanation: If d1 < d2 then the decision variable is always negative.

9. 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

Explanation: If there are ‘n’ processes then this algorithm divides it into number of partitions and generates line segments.

10. 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

Explanation: In Parallel line algorithm each processors calculates pixel positions.

11. Coordinate references in the polyline function are stated as
a) Relative coordinate values
b) Absolute coordinate values
c) Current position
d) Real coordinate values

Explanation: Coordinate references in the polyline function are stated as absolute coordinate values.

12. To apply the midpoint method, we define
a) ?circle(x, y)= x 2+ y 2-? r?2
b) ?circle(x, y)= x+ y 2-? r?2
c) ?circle(x, y)= x 2– y 2-? r?2
d) ?circle(x, y)= x2+ y 2-? z?2

Explanation: None.

13. _______ 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

Explanation: Ellipses is defined as set of points.

14. 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

Explanation: This algorithm proceeds outward pixel by pixel until the boundary color is encountered.

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

Explanation: We can paint such areas by replacing a specified interior color.

Sanfoundry Global Education & Learning Series – Computer Graphics.

To practice all areas of Computer Graphics, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]