MCQ | Line Filling Algorithms in Computer Graphics

Multiple choice questions and answers (MCQ) based on the Line Filling Algorithms in Computer Graphics with 4 choices, correct answer and explanation.
Submitted by Monika Sharma, on June 12, 2020

Question 1: Which of the following methods is the fastest pixel position calculating method?

  1. Bressenham's line algorithm
  2. DDA line algorithm
  3. Mid-point algorithm
  4. None of the above

Answer: d. DDA line algorithm

Explanation:

The DDA is the fastest algorithm among the given algorithms for calculating the position of the pixels because it has a very easy formula or way to calculate which can be readily implemented and executed in programs.


Question 2: Which of the following line algorithms best balances the processing load among all the processers?

  1. Parallel line algorithm
  2. DDA line algorithm
  3. Both a. and b. balances the load equally
  4. None of the above

Answer: a. Parallel line algorithm

Explanation:

If a parallel line algorithm has 'n' processes then this algorithm divides it into a number of partitions and generates line segments. Thus the load on the processors gets divided.


 Question 3: Consider the following statement:

"The boundary is specified in a single color, and the algorithm proceeds pixel by pixel until the boundary color is encountered."

The above statement defines which of the following algorithms?

  1. Scan-line fill algorithm
  2. Boundary-fill algorithm
  3. Entire fill algorithm
  4. Slide curve algorithm

Answer: b) Boundary-fill algorithm

Explanation:

Mainly, this algorithm proceeds outward pixel by pixel until the boundary color is encountered. Hence, the given statement definition correctly defines the Boundary fill algorithm.


Question 4: In Bressenham’s line algorithm, there are certain conditions for deciding the successive parameters. Of the distances d1 < d2 then decision parameter Pk is which of the following?

  1. Positive
  2. Equal
  3. Negative
  4. Can be any of the above

Answer: c. Negative

Explanation:

If d1 < d2 then the decision variable is always negative.ie. Pk is always negative.


Question 5: The term "DDA" in the DDA algorithm stands for:

  1. Digital difference analyzer
  2. Direct differential analyzer
  3. Digital differential analyzer
  4. Data differential analyzer

Answer: c. Digital differential analyzer

Explanation:

DDA stands for Digital differential analyzer which is use to draw a line.







Comments and Discussions

Ad: Are you a blogger? Join our Blogging forum.





Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates


© https://www.includehelp.com some rights reserved.