Computer Graphics (3150712) MCQs

MCQs of Graphics Primitives

Showing 21 to 20 out of 30 Questions
1 2 3
21.
For complicated shape in the flood fill algorithm we use :
(a) 2 connected region
(b) 4 connected region
(c) 6 connected region
(d) 8 connected region
Answer:

Option (d)

22.
What is true about the DDA algorithm for the scan conversion of a line?
(a) General-purpose method
(b) Incremental method
(c) Current calculation is independent of previous step
(d) Is slower than the use of line equation
Answer:

Option (b)

23.
In DDA algorithm for scan conversion of a line :
(a) if |m|<=1 then ∆x=1
(b) if |m|>=1 then ∆x=1
(c) if |m|<=1 then ∆y=1
(d) All of these
Answer:

Option (a)

24.
Which of these is false for Boundary-fill algorithm?
(a) Recursive algorithm
(b) Begins with a starting point called seed
(c) It checks for any pixel to be boundary color
(d) Works only for rectangles and circles
Answer:

Option (d)

25.
Which type of lines are ignored in the scan-line algorithm to fill regions?
(a) Vertical
(b) Horizontal
(c) Left inclined
(d) Right inclined
Answer:

Option (b)

26.
Scan-line algorithm to fill regions efficient for :
(a) Irregular regions
(b) Circle
(c) Polygon
(d) None of these
Answer:

Option (c)

27.
A line can be represented by :
(a) One point
(b) Two points
(c) Three points
(d) Four points
Answer:

Option (b)

28.
A vector can be defined as :
(a) Intersection b/w two points position
(b) Difference b/w two points position
(c) Comparison b/w two points position
(d) None of these
Answer:

Option (b)

29.
The functions of the scan line polygon fill algorithm are :
(a) Find the intersection point of the boundary of the polygon and scan line
(b) Find the intersection point of the boundary of polygon and point
(c) A and B both
(d) None of these
Answer:

Option (a)

30.
Which is none recursive fill algorithm?
(a) Boundary fill algorithm
(b) Flood fill algorithm
(c) Scanline polygon fill algorithm
(d) All of these
Answer:

Option (c)

Showing 21 to 20 out of 30 Questions
1 2 3