1) The process of conversion of the rasterized picture stored in the frame buffer to
the rigid display pattern of video is called as
a) Scan conversion
b) Raster
c) Pixel
d) None of these.
2) The process of burning ON of the pixels for a line segment is called as ---------a) Rasterrisation
b) Vector generation
c) Minimization
d) None of these.
3) Most of our drawing algorithms use-------------a) Incremental methods
b) Decremental methods
c) Multiplier methods
d) None of these.
4) The distance between the actual line location and the nearest pixel is called
as--------------a) Raster
b) Error term
c) Line
d) None of these.
5) The process of distortion of information due to low frequency sampling or
understanding is called as -------------------a) Sampling
b) Aliasing
c) Antialiasing
d) None of these.
6) Find the refresh rate of a 512*512 frame buffer the access time for each pixel
is 200 nanoseconds?
a) 19 frames per second.
b) 5242.88 frames/nanosecond
c) 18 frames per second
d) 20 frames per second
7) In bresenham’s circle generation algorithms. 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
8) In circle drawing algorithm we use
a) 4-Symmetry
b) 2-Symmetry
c) 8-Symmetry
d) No Symmetry
9) Bresenham’s line drawing is superior then DDA because
a) It does not require floating point arithmetic
b) No round -up is required
c) Both (a) & (b)
d) it is easily computable
10)
What will be the value of initial decision parameter if we intend to draw
a line between A (3, 6) and B (4, 9) using Bresenham’s algorithm?
a) 6
b)5
c)3
d)none of these
11)
The total number of pixel put ‘ON’ for the line starting at (1, 1) and
ending at (12, 7) would be
a) 7
b) 11
c) 12
d) more than 12
12)
The DDA algorithm is a faster method for calculating pixel positions
than direct use of line equation using y = mx + c, because
a) it eliminates floating point addition
b) it eliminates floating point multiplication
c) it eliminates rounding operation that drift away from true line path
d) none of these
13)
In Bresenham’s circle algorithm, if points are generated from 90 0 to 45
0 and (x,y) are theCoordinate of last scan converted pixel then the next pixel
coordinate is
a) (x+1,y+1)or(x-1,y-1)
b) (x,y+1)or(x+1,y-1)
c) (x+1,y)or(x,y+1)
d) (x+1,y)or(x+1,y-1)
14)
The maximum number of dots that can be displayed without overlap on
CRT is referred to as
a) Refresh rate
b) Interlacing
c) Screen resolution
d) None of these
15)
Disadvantage of DDA is
a)
b)
c)
d)
Round of error
Subtraction error
Addition error
(a),(b)
16)
In the generation of circle by Bresenham’s algorithm, it is simple to
generate
a) All octants
b) one octants first and other by successive reflection
c) one octants first and other by successive rotation
d) one octants first and other by successive translation
17)
(2,4) is a point on a circle that has center at the origin. Which of the
following points are also on circle ?
a) (2,-4)
b) (-2,4)
c) (-4,-2)
d) All of above
18)
a)
b)
c)
d)
In raster scan display, the frame buffer holds ......................
Line drawing commands
Scanning instructions
Image Resolution
Intensity information
19)
a)
b)
c)
d)
In random scan display, the frame buffer holds ......................
Line drawing commands
Scanning instructions
Image Resolution
Intensity information
20)
Aliasing means
a) Rendering effect
c) Staircase effect
b)Shading effect
d) Cueing effect