ADVERTISEMENT
ADVERTISEMENT

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 IncludeHelp, on April 09, 2021

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.


Question 6: What are the fundamental characteristics of a straight line?

  1. Width
  2. Color
  3. Type
  4. All of the mentioned above

Answer: d. All of the mentioned above

Explanation:

Type, width and colors are the fundamental characteristics of a line.


Question 7: ___ is a method of moving an entity from one coordinate point to another into a straight-line path is known as positioning.

  1. Shearing
  2. Reflection
  3. Translation
  4. Transformation

Answer: c. Translation

Explanation:

An object is translated as it is repositioned in a straight-line path from one co-ordinate point to another.


Question 8: |m|<1,? X for lines with a slope magnitude of,

  1. A set proportional to a small horizontal deflection voltage
  2. A set corresponding vertical deflection
  3. Only B
  4. All of the mentioned above

Answer: a. A set proportional to a small horizontal deflection voltage

Explanation:

? Only if the slope magnitude is small enough, x may be a range equal to a small horizontal deflection voltage |m| < 1.


Question 9: Which of the following does not represent a line pattern?

  1. Dark line
  2. Dotted line
  3. Dashed line
  4. None of the mentioned above

Answer: a. Dark line

Explanation:

A dark line does not represent a line pattern.


Question 10: Which of the following line-generating algorithms is the most effective and efficient?

  1. Midpoint algorithm
  2. Bresenham's Line algorithm
  3. DDA algorithm
  4. None of the mentioned above

Answer: b. Bresenham's Line algorithm

Explanation:

Since it only requires integer addition, subtractions, and multiplication operations, Bresenham's line algorithm is a quick process. These operations can be completed easily, allowing lines to be produced quickly.


Question 11: The main role of a frame buffer is the ___ of the video signals that drive the display device.

  1. Storage, conditioning, and output
  2. Same speed
  3. Different speed
  4. None of the mentioned above

Answer: a. Storage, conditioning, and output

Explanation:

The main role of a frame buffer is the Storage, conditioning, and output of the video signals that drive the display device.


Question 12: The ___ between the strong regions equal to the duration of the dashed lines.

  1. Very short dashes
  2. Inter dash spacing
  3. Both A and B
  4. None of these

Answer: b. Inter dash spacing

Explanation:

The inter dash spacing between the strong regions equal to the duration of the dashed lines.


Question 13: Can a dotted line be seen by generation using,

  1. Short dash spacing
  2. Long dash spacing
  3. Inter dash spacing
  4. Dots

Answer: c. Inter dash spacing

Explanation:

The inter dash spacing is equal to the length of the solid sections displays dashed line.


Question 14: Which of the following sentence used in application software to specify line-type attributes?

  1. SETLINE ()
  2. SETLINE TYPE (lt)
  3. Both of the above mentioned
  4. None of the above mentioned

Answer: d. None of the above mentioned

Explanation:

Quite long dashboards with equivalent or greater spacing than the dash will display dotted lines.


Question 15: A line can be seen by,

  1. Two points
  2. One point
  3. Four points
  4. Three points

Answer: a. Two points

Explanation:

Two points may be found on a line to mark it. It is represented symbolically by an overhead bar of two letters referring to a dot on the line at either end.


More...

  1. MCQ | Introduction to Computer Graphics
  2. MCQ | Cathode Ray Tube (CRT) in Computer Graphics
  3. MCQ | Graphics Hardware and Display Devices in Computer Graphics
  4. MCQ | Random Scan and Raster Scan in Computer Graphics
  5. MCQ | Scan Conversion in Computer Graphics
  6. MCQ | Line Drawing Algorithms in Computer Graphics
  7. MCQ | Circle Drawing and Ellipse Drawing Algorithms in Computer Graphics
  8. MCQ | Types of Transformations (Translation, Rotation and Scaling) in Computer Graphics
  9. MCQ | Bresenham's Algorithm in Computer Graphics
  10. MCQ | Window to Viewport Transformation in Computer Graphics
ADVERTISEMENT



ADVERTISEMENT



Comments and Discussions


ADVERTISEMENT

ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT

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.