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