# 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?**

- Bressenham's line algorithm
- DDA line algorithm
- Mid-point algorithm
- 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?**

- Parallel line algorithm
- DDA line algorithm
- Both a. and b. balances the load equally
- 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?**

- Scan-line fill algorithm
- Boundary-fill algorithm
- Entire fill algorithm
- 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?**

- Positive
- Equal
- Negative
- 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:**

- Digital difference analyzer
- Direct differential analyzer
- Digital differential analyzer
- 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?**

- Width
- Color
- Type
- 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.**

- Shearing
- Reflection
- Translation
- 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,**

- A set proportional to a small horizontal deflection voltage
- A set corresponding vertical deflection
- Only B
- 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?**

- Dark line
- Dotted line
- Dashed line
- 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?**

- Midpoint algorithm
- Bresenham's Line algorithm
- DDA algorithm
- 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. **

- Storage, conditioning, and output
- Same speed
- Different speed
- 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.**

- Very short dashes
- Inter dash spacing
- Both A and B
- 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,**

- Short dash spacing
- Long dash spacing
- Inter dash spacing
- 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?**

- SETLINE ()
- SETLINE TYPE (lt)
- Both of the above mentioned
- 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,**

- Two points
- One point
- Four points
- 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...**

- MCQ | Introduction to Computer Graphics
- MCQ | Cathode Ray Tube (CRT) 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 | Bresenham's Algorithm in Computer Graphics
- MCQ | Window to Viewport Transformation in Computer Graphics

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions