Ch03

Q128). In the Bresenhan's algorithm, error term is initialized to

(a) 0
(b) 1
(c) -1/2
(d) None of the above

Q129). A circle drawn on the screen appears to be elliptical

(a) Screen has rectangular shape
(b) CRT is not completely spherical
(c) It is due to the aspect ratio of the monitor
(d) Our eyes are not at the same level as the screen

Q130). In the generation of circle by Bresenhan's algorithm, it is simple to generate

(a) All octants
(b) One octant first and others by successive reflection
(c) One octant first and others by successive rotation
(d) One octant first and others by successive translation

Q131). Which of the following algorithms can be used for circle generation?
(a) Bresenham's algorithm
(b) Midpoint algorithm
(c) Both (a) and (b)
(d) None of the above

Q132). Which of the following pixels will not be "ON" for drawing an origin-
centered circle with radius 8?
(a) 0,8
(b) 1,8
(c) 4,6
(d) 5,6
Q19 Frame buffer is used to store
a) only pixels
b) only intensities of pixels
c) image definition
d) coordinate values of image

*Q20 The best line drawing algorithm among all possible line drawing algorithm
is
a) DDA
 b) Algorithm which uses direct equation of line
c) *Bresenham’s algorithm
d) None of them

Q21 The value of initial decision parameter in bresenham’s line drawing

algorithm for │m│<1 is:
a) 2∆y - ∆x
b) 2∆y + ∆x
c) -2∆y + ∆x
d) -2∆y - ∆x

Q22 The best circle drawing algorithm among all possible circle drawing
algorithm is:
a) algorithm uses direct equation of circle
b) algorithm uses polar coordinate form
c) bresenham’s circle drawing algorithm
d) mid point circle drawing algorithm

Q23 The value of initial decision parameter in mid point circle drawing algorithm
is:
a) 3-2r
b) 5/4-r
c) 1-2r
d) 3-r

Q24 Points P1(3.2 ,7.8) and P2(3.7,7.1) are both represented by pixel
a) (3,8)
b) (4,7)
c) (3,7)
d) (4,8)

Q25 Pixel phasing is an anti-aliasing technique based on

a) hardware
b) software
c) both hardware and software
d) none of these

Q234) Slope of the line joining the points(1,2) and (3,4)is……………

a) 0
b) 1
 c) 2
d) 3

Q235) The slope of the line joining the points(0,0) and (5,5)is……………
a) 0
b) 1
c) 2
d) 3

Q236) The slope of the line joining the points(3,0) and (5,0)is……………
a) 0
b) 1
c) 2
d) 3

Q237) Bresenham’s circle generating algorithm will take reflections of

……………….
a) Two octets
b) One octet
c) Three octets
d) None

Q238) In Bresenham’s circle generating algoritms, if (x,y) is the current pixel

position then the x-value of the next pixel position is…………………………..
a) x
b) x-1
c) x+1
d) x+2

Q239) In Bresenham’s circle generating algoritms, if (x,y) is the current pixel

position then the y-value of the next pixel position is…………………………..
a) y or y+1
b) y alone
c) y+1 or y-1
d) y or y-1

Q240) Run length coding is used for…………………

a) Image smoothening
b) Image compression
c) Image coloring
 d) Image dithering

Q241) The property that adjacent pixels are likely to have the same characterstics
is called………………….
a) Spatial coherence
b) Area coherence
c) Scan line coherence
d) Pixel coherence

Q242) The property that adjacent pixels on a scan line are likely to have the same
characterstics is called………………….
a) Spatial coherence
b) Area coherence
c) Scan line coherence
d) Pixel coherence

Q243) The technique of using a minimum number of intensity levels to obtain

increased visual resolution is called……………………
a) Dithering
b) Halftoning
c) Depth cueing
d) Rendering

Q219) Painter’s algorithm is also called

a) Scan line Algorithm
b) Subdivision Algorithm
c) Depth sort Algorithm
d) Rendering Algorithm

Q220) Gourard shading is

a) An interpolative shading method
b) A subdivision shading method
c) An averaging shading method
d) Not a shading method

Q221) World coordinate system is

a) The coordinate system in which the image is defined
b) The coordinate system in which the object is defined
c) The coordinate system in which the surfaces is defined
d) The coordinate system in which the transformation are performed
Q222) Frame buffer is
a) The memory area in which the image, being displayed, is stored
b) The device which controls the refresh rate
c) The device used for displaying the colors of an image
d) The memory area in which the graphics package is stored

Q223) Aliasing means

a) Rendering effect
b) Shading effect
c) Staircase effect
d) Cueing effect

Q224) A 512 × 512 raster requires ……………….bits in a bit plane.

a)
212
b)
218
c)
210
d)
28

Q225) The look up table technique………………… the number of intensity levels.

a) Decreases
b) Increases
c) Removes
d) Gives no effect on

Q226) A simple 3-bit plane frame buffer can have…………………. Number of

color combinations
a) 8
b) 16
c) 24
d) 3

Q227) RGB stands for…………..

a) Resolution-Global-Bright
b) Resolution of green and blue
c) Red-Green-Blue
d) None of these

Q228) In a 3-bit plane buffer 011 represents………………color

a) Red
 b) Cyan
c) Black
d) Green

Q229) In a 3-bit plane buffer the color Magenta is represented by………………

a) 101
b) 100
c) 111
d) 011

Q230) If Blue is represented as 001 the yellow is represented as ……………..

a) 001
b) 010
c) 101
d) 110

Q231) A 24-bit plane color frame buffer with three 10-bit wide color look up
tables can have………… number of colors
a)
224
b)
28
c)
248
d)
230

Q232) DAC means

a) Direct access coding
b) Digitally activated compression
c) Direct area clipping
d) Digital to Analog Converter

Q233) …………………..acts as anode in CRT

a) The phosphorous coating
b) The glass panel
c) The deflectors
d) None of these
Q36) Which of the following transformations are non-commutative
A) linear followed by scaling
B) linear followed by rotation
C) scaling followed by rotation
 D) none of the above

*Q37) Reflection of a pointy about x-axis followed by a counter-clockwise rotation

of 90°, is equivalent to reflection about the line
A) x=-y
B) y=-x
C) *x=y
D) x + y=1

Q38) Which one of the following is not a linear transformation?

A) F:R³–›R² defined by f(x, y, z)=(x, z)
B) F:R³–›R³ defined by f(x, y, z)=(x,y-1,z)
C) F:R²–›R³ defined by f(x, y)=(2x,y-x)
D) F:R²–›R² defined by f(x, y)=(y, x)

Q39) Raster system display a picture from a definition in a

A) display file program
B) frame buffer
C) display controller
D) none of the above

Q40) Back face removal is an example of

A) object space method
B) image space method
C) combination of both
D) none of the above

Q92) In the clipping algorithm of Cohen & Sutherland using region codes, a line is
already clipped is the,
a) codes of the end points are the same
b) logical AND of the end points code is not 0000
c) logical OR of the end points code is 0000
d) logical AND of the end points code is 0000

Q93) Choose the function that are periodic

a) f(x)=x-|x|; where [x] stands for the greatest integer<=x
b) f(x)=| cos(x) |
c) f(x)=(x) cos(x)
d) f(x)=sin(1/x), if x!=0; 0 otherwise
Q94) In Sutherland-Hodgman algorithm for polygon clipping, assume P (present
point) lies inside the window and S (previous point) lies outside the window. Then,
while processing through that window boundary, we should
a) store the intersection point of the line PS (S’) only
b) store the points P and S’
c) store the point P only
d) store the points S and S’