Unit 2 CGAR MCQs

1. The Cartesian slope-intercept equation for a straight line is

a) y = m.x + b
b) y = b.x + m
c) y = x.x + m
d) y = b + m.m
Answer: a
2.  For lines with slope magnitude |m|<1, ?x can be_________
a) A set corresponding vertical deflection
b) A set proportional to a small horizontal deflection voltage
c) Only a
d) All of the mentioned
Answer: b
3. On raster system, lines are plotted with
a) Lines
b) Dots
c) Pixels
d) None of the mentioned
Answer: c
4. Expansion of line DDA algorithm is
a) Digital difference analyzer
b) Direct differential analyzer
c) Digital differential analyzer
d) Data differential analyzer
Answer: c
5. Which algorithm is a faster method for calculating pixel positions?
a) Bresenham’s line algorithm
b) Parallel line algorithm
c) Mid-point algorithm
d) DDA line algorithm
Answer: d
6. The disadvantage of lineDDA is
a) Time consuming
b) Faster
c) Neither a nor b
d) None of the mentioned
Answer: a
7. An accurate and efficient raster line-generating algorithm is
a) DDA algorithm
b) Mid-point algorithm
c) Parallel line algorithm
d) Bresenham’s line algorithm
Answer: d

Prepared by Prof.Kumbhar D.H

Page 1
 Unit 2 CGAR MCQs

8.  In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk
is______
a) Positive
b) Equal
c) Negative
d) Option a or c
Answer: c
9. Coordinate references in the polyline function are stated as
a) Relative coordinate values
b) Absolute coordinate values
c) Current position
d) Real coordinate values
Answer: b
10. To apply the midpoint method, we define
a) ?circle(x, y)= x 2+ y 2-? r?2
b) ?circle(x, y)= x+ y 2-? r?2
c) ?circle(x, y)= x 2– y 2-? r?2
d) ?circle(x, y)= x2+ y 2-? z?2
Answer: a
11.  _______ is defined as set of points such that the sum of the distances is same for all
points.
a) Ellipses
b) Lines
c) Circles
d) Only a
Answer: d
12. If the boundary is specified in a single color, and if the algorithm proceeds pixel by pixel
until the boundary color is encountered is called
a) Scan-line fill algorithm
b) Boundary-fill algorithm
c) Flood-fill algorithm
d) Parallel curve algorithm
Answer: b
13. If we want to recolor an area that is not defined within a single color boundary is known
as
a) Boundary-fill algorithm
b) Parallel curve algorithm
c) Flood-fill algorithm
d) Only b
Answer: c
14. Which of the following is true with respect to the Bresenham's line drawing algorithm?

a. It overcomes the drawbacks of DDA line drawing algorithm

Prepared by Prof.Kumbhar D.H

Page 2
 Unit 2 CGAR MCQs

b. The DDA algorithm was proposed to overcome the limitations of Bresenham's line
drawing algorithm
c. Both a. and b.
d. None of the above

Answer: a

15. Why is the complexity of Bresenham's line drawing algorithm less than that of DDA line
drawing algorithm?

a. It uses floating point operations over integer addition and subtraction

b. It considers only selected ranged inputs
c. It uses integer addition and subtraction over floating point operations
d. None of the above

Answer: c.

16. Which of the following properties is followed by the Bresenham's algorithm?

a. It is an incremental method
b. It chooses points randomly
c. It uses floating point operations
d. All of the above

Answer: a.

17. The method which used either delta x or delta y whichever is larger is choosen as one
raster unit to draw the line the algorithm is called?
a) Bresenham’s line drawing algorithm
b) DDA line drawing algorithm
c) Midpoint line drawing algorithm
d) None
Answer : b
18. What is the equation for a circle?

a. y = mx + c
b. y2 = r2 – x2
c. rx2y2 = rx2ry2 - ry2x2
d. None of the above

Answer: b.

19. Which of the following are the methods to define a circle?

a. Using polynomial method.

Prepared by Prof.Kumbhar D.H
Page 3
 Unit 2 CGAR MCQs

b. Using polar coordinates methods.

c. Both a. and b.
d. None of the above

Answer: c.

20. A polygon in which the line segment joining two points within the polygon lies completely
inside the polygon is called ….?
a) Convex polygon
b) Concave polygon
c) Both a and b
d) None
Answer: a
21. A polygon in which the line segment joining two points within the polygon may not lie
completely inside the polygon is called ….?
e) Convex polygon
f) Concave polygon
g) Both a and b
h) None
Answer: b
22. Rectangular patterns are sometimes reffered as……
a) Tilting pattern
b) Filling pattern
c) Coloring pattern
d) Both a and b
Answer : a
23.  How many Methods of character generations are there?
a) 2
b) 3
c) 4
d) 5
Answer: b
24. Which method of character generation is also called Dot-matrix method?
a) Stroke method
b) Bitmap method
c) Starbust method
d) There isn’t that type of method
Answer: b
25. In which method, graph is used in form of line to line?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method
Answer: a
26. In which method, fixed pattern of a line is used to generate characters?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method

Prepared by Prof.Kumbhar D.H

Page 4
 Unit 2 CGAR MCQs

Answer: c
27. Which method has the poorest character quality?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method
Answer: c
28. Character generators can produce _________________
a) Different type size but same fonts
b) Same type size but different fonts
c) Same type size and fonts
d) Different type size and fonts
Answer: d
29. Font colours can be changed using character generators.
a) True
b) False
Answer: a
30.  What is the main reason behind developing algorithms for scan conversion?

a. The algorithms can generate graphics objects at a faster rate here.

b. Here, the memory can be efficiently used
c. Both a. and b.
d. None of the above

Answer: c. Both a. and b.

31. Which of the following best defines Scan Conversion in computer graphics?

a. It is a process of representing graphics objects as a collection of pixels

b. It is a process of converting colored images to grayscale images.
c. It is a process of converting handmade drawing to computer pictures through a scanner
d. None of the above

Answer: a.

32. Which among the following objects can be scan converted?

a. Point, Line, Sector, Arc

b. Characters
c. Ellipse, Rectangle, Polygons
d. All of the above

Answer: d.

33. "Each pixel has some intensity value which is represented in memory of the computer. This
memory part is known as the ____________."

Prepared by Prof.Kumbhar D.H

Page 5
 Unit 2 CGAR MCQs

a. Frame Buffer
b. Random Access Memory (RAM)
c. Picture Memory
d. None of the above

Answer: a. Frame Buffer

34. A technique by which the vertical and /or horizontal scan frequency of video signal can
be changed for different purpose and applications  is called
a. Scan conversion
b. Polygon filling
c. Two dimensional graphics
d. Anti aliasing
Answer a

35. The method which perform the scan conversion by using large number of delay cells are
called
a. Analogue method
b. Digital method
c. Complex method
d. None of these
Answer a
36. Digital method is also known as
a. Normal method
b. Buffered method
c. Real time method
d. None of these
Answer :b
37. Analogue method is also known as
a. Normal method
b. Buffered method
c. Real time or memory less method
d. None of these
Answer: c
38. Digital method allows a picture to be stored in line or frame buffer with
a. Same speed
b. Different speed
c. Both a & b
d. None of these
Answer :b

Prepared by Prof.Kumbhar D.H

Page 6
 Unit 2 CGAR MCQs

39. A chain of connected line segments is called a ________.

A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A
40. A closed polyline is called a _________.
A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B
41. __________ is a method for testing a pixel inside of a polygon.
A. even-odd method
B. winding number method
C. A and B
D. None of these
ANSWER:C
42. _________ is a basic approach used to fill the polygon.
A. seed fill
B. scan fill
C. A and B
D. None of these
ANSWER: C
43. The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill
algorithm.
A. flood, boundry
B. even, odd
C. edge, flood
D. boundry, scan
ANSWER:A
44. Polygoan filling algorithms those fill interior-defined regions are called _______ algorithms.
A. flood fill
B. boundry fill
C. scan line
D. edge fill
ANSWER: A
45. Polygoan filling algorithms those fill boundary defined regions are called _________ algorithms.
A. flood fill
B. boundry fill
C. edge line
D. A and B
ANSWER:D
46. In a boundary fill algorithm for filling polygon, boundary defined regions may be either
_________ connected or
__________ connected.
A. 2,4

Prepared by Prof.Kumbhar D.H

Page 7
 Unit 2 CGAR MCQs

B. 4,8
C. 8,16
D. 8,6
ANSWER:B
47. The getpixel function gives the ______ of specified pixel.A. intensity
B. colour
C. Size
D. Shape
ANSWER:B
48. The putpixel function draws the pixel specified_______.
A. intensity
B. colour
C. Size
D. Shape
ANSWER:B
49. Seed fill algo for filling polygon is ________ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:A
50. Scan line algorithm for filling polygon is ______ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:B
51. The basic approach to represent polygon is __________.
A. Polygon drawing primitive approach
B. trapezoid primitive approach
C. line and point approach
D. all of above
ANSWER:D
52. The process of selecting and viewing the picture with diffrerent views is called_______.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:B
53. A Process which divides each segment of the picture into its visible and invisible portion,
allowing the invisible
portion to be discarded is called__________.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:A

Prepared by Prof.Kumbhar D.H

Page 8