Home »
Computer Graphics
MCQ | Bresenham's Algorithm in Computer Graphics
Multiple choice questions and answers (MCQ) based on the Bresenham's Algorithm in computer graphics with 4 choices, correct answer and explanation.
Submitted by Monika Sharma, on October 13, 2020
Question 1: Which of the following is true with respect to the Bresenham's line drawing algorithm?
- It overcomes the drawbacks of DDA line drawing algorithm
- The DDA algorithm was proposed to overcome the limitations of Bresenham's line drawing algorithm
- Both a. and b.
- None of the above
Answer: a. It overcomes the drawbacks of DDA line drawing algorithm
Explanation:
The Bresenham's algorithm was proposed in order to overcome the drawbacks of the DDA algorithm.
Question 2: Why is the complexity of Bresenham's line drawing algorithm less than that of DDA line drawing algorithm?
- It uses floating point operations over integer addition and subtraction
- It considers only selected ranged inputs
- It uses integer addition and subtraction over floating point operations
- None of the above
Answer: c. It uses integer addition and subtraction over floating point operations
Explanation:
The only drawback of DDA algorithm was that it produces floating point results which increases the overall complexity. This algorithm is used for calculating intermediate coordinate points between the given source and ending points by only using integer addition and subtraction.
Question 3: Which of the following properties is followed by the Bresenham's algorithm?
- It is an incremental method
- It chooses points randomly
- It uses floating point operations
- All of the above
Answer: a. It is an incremental method
Explanation:
Bresenham's algorithm is an incremental method, i.e. we increment one of the coordinates of the point and calculate the other coordinate according to it. In this manner we find all the points of that particular polygon.
Question 4: Which of the following are true with respect to the Bresenham's algorithm?
- It produces smooth polygons
- The results of this algorithm are 100 percent accurate.
- Due to integer operations, it's complexity gets reduced
- All of the above
Answer: c. Due to integer operations, it's complexity gets reduced.
Explanation:
The Bresenham's algorithm has quite low complexity due to its integer-based operations.
Question 5: "This algorithm is more accurate than any other circle drawing algorithms as it avoids the use of round off function."
Based upon the above statement, determine whether it is true or false.
- True
- False
Answer: a. True
Explanation:
The given statement is true.
More...
- MCQ | Introduction to Computer Graphics
- MCQ | Cathode Ray Tube (CRT) in Computer Graphics
- MCQ | Line Filling Algorithms in Computer Graphics
- MCQ | Graphics Hardware and Display Devices in Computer Graphics
- MCQ | Random Scan and Raster Scan in Computer Graphics
- MCQ | Scan Conversion in Computer Graphics
- MCQ | Line Drawing Algorithms in Computer Graphics
- MCQ | Circle Drawing and Ellipse Drawing Algorithms in Computer Graphics
- MCQ | Types of Transformations (Translation, Rotation and Scaling) in Computer Graphics
- MCQ | Window to Viewport Transformation in Computer Graphics