Professional Documents
Culture Documents
MCQ (Type 1)
A pixel of black-white image or graphic object take space in memory
A. 1 bit
B. 2 bits
C. 1 byte
D. 1 nibble
ANSWER:
The process of representing continuous graphic objects as a collection of discrete pixels is called
A. Animation
B. Rasterization
C. Scan Conversion
D. Sampling
ANSWER:
The process of determining the suitable pixels for representing image or graphic object is called
A. Animation
B. Rasterization
C. Scan-Conversion
D. Quantization
ANSWER:
A graphical technique in which an object is transformed into another in such a way that the change appears to
be smooth and not rapid is called
A. Mapping
B. Scan-Conversion
C. Sampling
D. Quantization
ANSWER:
If an image has a height of 2 inches and aspect ratio of 1.5 then its width is
A. 3 inches
B. 0.75 inches
C. 0.75*0.75 inches
D. 1.5*1.5 inches
ANSWER:
If we want to resize a 1024*746 image to one that is 640 pixels wide with the same aspect ratio, the height of
resized image would be
A. 768
B. 512
C. 480
D. 1024
ANSWER:
If we use direct coding of RGB values with 2 bits per primary color, how many possible colors do we have for
each pixel?
A. 32
B. 64
C. 128
D. 16
ANSWER:
If we use 12 bit pixel values in a lookup table representation, how many entries does the lookup table have?
A. 4096
B. 12
C. 2048
D. 96
ANSWER:
Persistence can be defined as
A. Intensity of a pixel
B. Pixels per unit area
C. The duration of phosphorescence exhibited by a phosphor
D. Number of pixels in an image
ANSWER:
The path the electron beam takes at the end of each refresh cycle is called:
A. Horizontal retrace
B. Vertical retrace
C. Diagonal retrace
D. Left to right retrace
ANSWER:
The path the electron beam takes when returning to the left side of the CRT screen is called
A. Horizontal retrace
B. Vertical retrace
C. Diagonal retrace
D. Top to bottom retrace
ANSWER:
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
ANSWER:
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
ANSWER:
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
ANSWER:
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
ANSWER:
The transformation that changes the coordinate positions of an object along a circular path is called
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER:
The transformation that changes the coordinate position of an object along a straight line path is called
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER:
If we take mirror reflection of a point(x, y) along x-axis and the position of point after mirror reflection is
denoted by (x’, y’), then
A. x’=x ,y’=-y
B. x’=-x ,y’=y
C. x’=x ,y’=y
D. x’=-x, y’=-y
ANSWER:
When projection lines perpendicular to the view plane, then such type of projection is called
A. Parallel
B. Perspective
C. Orthographic
D. Oblique
ANSWER:
A polygon is called ------- if the line joining any two interior points of the polygon lies completely inside the
polygon
A. Concave
B. Convex
C. Positively oriented polygon
D. Negatively oriented polygon
ANSWER:
In Cohen-Sutherland line clipping algorithm, if the bitwise logical AND of the region codes is 0000, then line is
A. Visible
B. Not visible
C. A candidate for clipping
D. None of these
ANSWER:
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
ANSWER:
Surfaces that are rough, or grainy, tend to scatter the reflected light in all directions. This scattering light is
called
A. Specular Reflection
B. Diffuse Reflection
C. Point Reflection
D. Object Reflection
ANSWER:
Spline representations in which the degree of a spline polynomial can be set independently of the number of
control points
A. B-Spline
B. Beizer Spline
C. Hermite Spline
D. Cardinal Spline
ANSWER:
In B-Spline curve, if control points are n+1, then the curve is described with the number of blending functions
A. n
B. n+1
C. n-1
D. n+2
ANSWER:
In orthographic projection, when the direction of projection makes equal angles with exactly two of principal
axes, then such projection is called
A. Isometric
B. Dimetric
C. Trimetric
D. Cavalier
ANSWER:
In hidden surface removal algorithms, when visibility is decided point by point at each pixel position on the
projection plane, then such type of technique is called
A. Object-space
B. Image-space
C. Pixel-space
D. None of them
ANSWER:
(2, 4) is a point on a circle that has centre at the origin .Which of the following point(s) is/are also on the circle?
A. (2,-4)
B. (-2,4)
C. (4,-2)
D. (-4,2)
ANSWER:
The line joining (-1,0) and (4,5) ,if clipped against this window will connect the points
A. (0,1) and (3,3)
B. (0,1) and (2,3)
C. (0,1) and (4,5)
D. none of above
ANSWER:
The line segment joining (1,1) and (4,2) if clipped against this window will connect the points
A. (0,1) and (3,3)
B. (0,1) and (2,3)
C. (1,1) and (4,2)
D. none of the above
ANSWER:
The point at which a set is projected parallel lines appear to converge is called as a
A. Convergence point
B. Vanishing point
C. Point of illusion
D. Point of delusion
ANSWER:
Consider the three points ,A(3,6,4);B(2,5,5);C(0,3,7) and the view point V(1,4,6).
A. C hides A and E, if viewed from V
B. C hides A but not B, if viewed from V
C. A hidesn B but not C, if viewed from V
D. B hides A but not C, if viewed from V
ANSWER:
The best suited hidden surface algorithm to deal with the non polygonal, non planar surface patches is
A. Painter’s algorithm
B. Z-buffer algorithm
C. Ray tracing
D. Scan line algorithm
ANSWER:
Assuming that one allows 256 depth value level to be used, how much memory would a 512*512 pixel display
required to store down z-buffer
A. 512K
B. 256K
C. 1024K
D. 128K
ANSWER:
A transformation that distorts the shape of an object such that the transformed shape appears as if the object
were composed of internal layers that had been caused to slide over each other, such transformation is called
A. Shear
B. Translation
C. Reflection
D. Rotation
ANSWER:
All the following hidden surface algorithms employ image space approach except
A. back face removal
B. depth buffer method
C. scan line method
D. depth sort method
ANSWER:
The best hidden surface removal method(s) used for complex scenes with more than a few thousand surfaces
is/are
A. depth sorting method
B. scan line algorithm
C. depth buffer algorithm
D. octree method
ANSWER:
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
ANSWER:
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’
ANSWER:
Which of the following curves are symmetric around the line x=y?
A. 1+x+y=0
B. y=|x|
C. y=x³
D. | x | + | y | =9
ANSWER:
The perspective anomaly in which the object behind the centre of the projection is projected upside down and
forward onto the view [plane is called as
A. Perspective foreshortening
B. Vanishing view
C. View confusion
D. Topological distortion
ANSWER:
A line connecting the points (1,1) and (5,3) is to be drawn , using the DDA algorithm. Find the values of x and y
increments.
A. x-increment=1; y-increment=1
B. x-increment=0.5; y=increment=1
C. x-increment=1; y=increment=0.5
D. None of the above
ANSWER:
The entire graph of the function f(x) = x² + Kx – x + 9 is strictly above the x-axis if and only if
A. -3 < k < 5
B. -3 < k < 2
C. -3 < k < 7
D. -5 < k < 7
ANSWER:
Perform window to viewport transformation for the point (20,15) Assume that (Xvmin, Yvmin) is (0,0) )
(Xwmax.Ywmax) is (100,100) ; (Xvmin, Yvmin) is (5,5); (Xvmax,Yvmax) is (20,20). The value of x and y the
Viewport is
A. x=4, y =4
B. x =3, y =3
C. x =8, y =7.25
D. x =3, y =4
ANSWER:
Graphics and Image processing techniques used to produce a transformation of one person into another is called
A. Animation
B. Morphine
C. Half toning
D. None of the above
ANSWER:
The maximum number of points that can be displayed without overlap on a CRT is referred to as
A. Resolution
B. Persistence
C. Attenuation
D. None of the above
ANSWER:
A common device for drawing, positioning or interactively selecting co-ordinate positions on an object is
A. Digitizer
B. Data glove
C. Joystick
D. None of the above
ANSWER:
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
ANSWER:
How many matrices are required to rotate an object about a point (x, y)
A. 2
B. 3
C. 4
D. 5
ANSWER:
1. A Bezier curve is to be drawn given the control points P 1(40,40), P2(10,40), P3(60,60), P4(60,0). Calculates the
coordinates of the points on the curve corresponding to the parameters t=0.2, 0.4, 0.6.Draw a rough sketch of
the curve and show coordinates of various points on it. (5)
2. A parametric cubic spline passes through the points (0, 0), (2, 4), (4, 3), (5, -2) which are parameterized at t= 0,
1/4, 3/4, and 1, respectively. Determine the geometric coefficient matrix and the slope of the curve when t=0.5.
(5)
3. Derive the general perspective transformation onto a plane with reference point R0(X0,Y0,Z0), normal vector
N=n1i+n2j+n3k and using C(a, b, c) as the center of projection. (5)
4. Use Liang-Barsky line clipping algorithm to clip the line P 1(-15,-30) to P2(30,60) against the window having
diagonally opposite corners as(0,0) and(15,15). (5)
5. A mirror is vertically placed such that it passes through (20, 0) and (0, 20). Find the reflected view of a triangle
with vertices (30, 40), (50, 50) and (40, 70) in this mirror. (5)
6. Write the Scan-line polygon filling algorithm. What are the differences between raster scan devices
and random scan devices? (3.5 + 1.5)
7. Reflect the triangle ABC about the line 3x-4y+8=0.The position vector of the co-ordinate ABC is given
by as A(4,1), B(5,2), and C(4,3). (5)
8.Using midpoint circle drawing algorithm plot a circle whose radius=10 units. (5)
Consider the square A(1,0),B(0,0),C(0,1) and D(1,1). Rotate the square ABCD by 45 0 clockwise about
A (1, 0). (5)
9.Short notes : any two (2.5 x 2)
a. Cohen –Sutherland Line Clipping Algorithm
b. Liang-Barsky Line Clipping Algorithm
c. Cyrus-Beck Line Clipping Algorithm