Computer Graphics All MCQ
Computer Graphics All MCQ
1) In computer graphics, pictures or graphics objects are presented as a collection of discrete picture
element called______.
A. dots
B. pixels
C. co-ordinates
D. points
ANSWER: B
3.) ______is the smallest piece of the display screen which we can control.
A. dots
B. point
C. spot
D. pixel
ANSWER: D
9) The process representing continuous picture or graphics objects as a collection of descrete pixels is
called____.
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: A
15) The software components of conceptual framework for interactive graphics is/are_____.
A. application modelB. application program
C. graphics system
D. all of above
ANSWER: D
16) The Hardware components of conceptual framework for interactive graphics is/are________.
A. input devices
B. output devices
C. a and b
D. none of these
ANSWER: C
20) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B
22) The techique(s) used for producing image on the CRT is/are__________ .
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C
25) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C
26) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B
28) The techique(s) used for producing image on the CRT is/are__________.
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C
30) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh bufferC. buffer display
D. refresh circuit
ANSWER: B
31) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C
32) In raster scan display,the display image is stored in the form of _________ in the refresh buffer.
A. 1s
B. 0s
C. 1s and 0s
D. none of these
ANSWER: C
33) In raster scan CRT, the beam is swept back and forth from _______ across the screen.
A. left to right
B. right to left
C. up to down
D. down to up
ANSWER: A
34) In raster Scan CRT, when a beam is moved from the left to the right,it s ____ and it is _____ when it is
moved from the right to the left.
A. ON,OFF
B. OFF,ON
C. ON,ON
D. OFF,OFF
ANSWER: A
35) In raster scan display, the screen image repeatedly scanned, this process is called _______.
A. buffering of screen
B. refreshig of screen
C. rendering of screen
D. heghlighting screen
ANSWER: B
36) On a black and white system with one bit per pixel , the frame buffer is called a__________.
A. bitmap
B. pixmap
C. bitpixmap
D. pixbitmap
ANSWER: A
37) The cost of vector scan display is___________ cost of raster scan dispay.
A. equal to
B. less than
C. more than
D. none of these
ANSWER: C
41)The process of digitizing a picture definition given in an application program into a set of pixel-intensity
Values is called ____________.
A. animation
B. sampling
C. rasterization
D. scan-conversion
ANSWER: D
43)A pixel of black_white image or graphics object takes _________ space in memory.
A. 1 bit
B. 2 bits
C. 1 nibble
D. 1 byte
ANSWER: C
46) 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: B
47) The path the electron beam takes when returning to the left side of the CRTscreen is called_____.
A. horizontal retrace
B. vertical retrace
C. diagonal retrace
D. top to bottom retrace
ANSWER: A
51) Which facility is provided by computer graphics to change the shape colour or other properties of
objects begin viewed.
A. Motion dynamics
B. Update dynamics
C. A & B
D. None of these
ANSWER: B
ANSWER: D
special area of the memory is dedicated to graphics only in raster scan display called_________ .
A. Frame buffer
B. video controller
C. display controler
D. Monitor
ANSWER: A
To store black and white images ,black pixels are represented by________ in the frame buffer and white
pixels by_______.
A. Zero and one
B. One and Zero
C. Both a & b
D. None of these
ANSWER: B
What is the initial value for the decision parameter in midpoint circle algorithm.
A. 5/4-r
B. 4/5-r
C. r-5/4
D. r-4/5
ANSWER: A
In Bresenham's line generation algorithm, the initial value of the decision parameter as p0 = __________,
where slope MOD (m) < 1
A. 2Δy – Δx
B. 2Δy – 2Δx
C. Δx – Δy
D. none of the above
ANSWER: A
If a line whose end point is (10, 12) and start point is (20, 20), then slope m =?
A. 1.2
B. 0.8
C. -0.4
D. none of the above
ANSWER: B
The DDA algorithm is a faster method for calculating pixel positions than the direct use of Eq. y = m.x + b.
A. TRUE
B. FALSE
ANSWER: A
In Bresenham's Mid-point Circle Algorithm, the initial value of the decision parameter is p0 = 5/4 – r.
A. TRUE
B. FALSE
ANSWER: A
The method which used either delta x or delta y, whichever is larger, is chosen as one raster unit to draw
the line .the algorithm is called?
A. Bresenham`s Line Algorithm
B. Generalized Bresenham`s Algorithm
C. DDA Line Algorithm
D. Midpoint Line Algorithm
ANSWER: C
There are two standard methods of mathematically representing a circle centered at the origin. They are?
A. Polynomial Method, and Bresenham`s
B. Trigonometric Method and Bresenham`s
C. DDA, and Bresenham`s
D. Polynomial Method, and Trigonometric Method
ANSWER: D
(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),(-2,4)
B. (4,-2)
C. (-4,2)
D. All of above
ANSWER: D
D. None of these
ANSWER: B
A line connecting the points (1,1) and (5,3) is to be drawn, using DDA algorithm. Find the value of x and y
increments?
A. x-increments = 1; y-increments =1
B. x-increments = 0.5; y-increments =1
C. x-increments = 1; y-increments =0.5
D. None of above
ANSWER: C
Line produced by moving pen is __ at the end points than the line produced by the pixel replication?
A. Thin
B. Straight
C. Thicker
D. both A and B
ANSWER: C
In DDA line drawing algorithm, dx or dy, whichever is________, is chosen as one raster unit.
A. 1
B. 0
C. smaller
D. larger
ANSWER: D
Sign function makes the DDA line drawing algorithm work in _____ quadrants.
A. I and II
B. B I and III
C. II and III
D. all
ANSWER:D
DDA line drawing algorithm for calculating pixel positions is __________ the direct use of equation y =
mx + b.
A. slower than
B. faster than
C. of equal speed to that of
D. none of these
ANSWER: B
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
The maximum number of points that can be displayed without overlap on a CRT
A. Aspect Ratio
B. Resolution
C. Brightness
D. Pixel
ANSWER: B
_____________is the number of points per centimeter that can be plotted horizontally and vertically.
A. Aspect Ratio
B. Pixel Depth
C. Resolution
D. Dot Pitch
ANSWER: C
__________is the ratio of horizontal points to vertical points necessary to produce equal length
lines in both direction.
A. Dot Pitch
B. Resolution
C. Aspect Ratio
D. Height-Width Ratio
ANSWER: C
An RGB color system with 24 bits os storage per pixel is known as________________.
A. Color CRT
B. True-color system
C. RGB monitor
D. Color- Depth
ANSWER: B
Digitizing a picture definition into a set of intensity values is known as .............A. Digitization
B. Scan conversion
C. Refreshing
D. Scanning
ANSWER: B
MCQ on UNIT 2
A ploygon in which the line segment joining any two points within the polygon lies completely inside the polygon,
is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A
A Polygoan in which the line segment joining any two points within the polygon may not lie completely inside the
polygon, is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
ANSWER: C
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
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
In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________ connected or
__________ connected.
A. 2,4
B. 4,8
C. 8,16
D. 8,6
ANSWER:B
The process of selecting and viewing the picture with diffrerent views is called_______.
A. Clipping
B. WindowingC. Segmenting
D. all of above
ANSWER:B
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
A convenient cartesian co-ordinate system used for storing a picture in the computer memory is called__________.
A. X-Y co-ordinate system
B. World co-ordinate system
C. normalized co-ordinate system
D. viewing co-ordinate system
ANSWER:B
ANSWER: A
The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.
A. any line
B. one end
C. both end
D. any two
ANSWER: C
Cohen-sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.
A. 8
B. 6
C. 4
D. 9
ANSWER: D
The transformation which maps the viewing co-ordinates to normalized device co-ordinte is called _______.
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C
The transformation of object description from normalized co-ordinates to device co-ordinates is called ________.A.
Workstation transformation
B. viewing transformation
C. normalization transformation
D. homogeneous transformation
ANSWER: A
If both end points of a line are exterior to the clipping window,__________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: B
If both end points of a line are completely to the right of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C
If both end points of a line are completely to the left of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C
If both end points of a line are completely to the above of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C
If both end points of a line are completely to the below of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping windowC. the line is completely exterior to the clipping
window
D. none of these
ANSWER: C
In Cohen-sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: A
In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: B
In Cohen-sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: C
In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: D
In cohen- sutherland subdivision line clipping algorithm, all bits in region code are zero if__________.
A. end point of a line lies within a clipping window
B. end point of a line lies to the left of the clipping window
C. end point of a line lies to the right of the clipping window
D. None of theseANSWER: A
In cohen- sutherland subdivision line clipping algorithm,any line that has one in the same bit position in the region
codes for each end point are _________.
A. Completely inside the clipping rectangle
B. Completely outside the clipping rectangle
C. Completely left to the clipping rectangle
D. Completely right to the clipping rectangle
ANSWER: B
In cohen- sutherland subdivision line clipping algorithm, if the result of the logical AND operation with two end
point region codes is not 0000 __________.
A. the line is Completely inside the clipping region
B. the line is Completely outside the clipping region
C. the line is Completely left to the clipping region
D. the line is Completely right to the clipping region
ANSWER: B
In sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is outside the window boundry
and the second vertex of the edge is inside then _____ and ____ are added to the output vertex list.
A. first vertex, second vertex
B. first vertex, the intersection point of the polygon edge with the window boundry
C. Second vertex,the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: C
In sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the window boundry,
then _______ is addes to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: B
In sutherland-Hodgeman polygon clipping algorithm, if the first vertex of the edge is inside the window boundry
and the second vertex of the edge is outside then _____ and ____ are added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: C
In sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the window boundry,
______is added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: D
Which of the following clipping algorithm follows the Divide and Conquer strategy?
A. 4-bit algorithm
B. Midpoint algorithm
C. Cyrus break algorithm
D. Cohen- Sutherland algorithm
ANSWER:B
The selection and separation of a part of text or image for further operation are called__________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER:D
If a line joining any of its two interior points lies completely within it are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: A
If a line joining any two of its interior points lies not completely inside are called______________.
A. Convex polygon
B. Concave polygonC. Both a & b
D. None of these
ANSWER: B
The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D
The rectangle portion of the interface window that defines where the image will actually appear are
called_____________.
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B
The rectangle space in which the world definition of region is displayed are called_______________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B
The process of cutting off the line which are outside the window are called__________.
A. Shear
B. Reflection
C. Clipping
D. Clipping window
ANSWER: C
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
If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B
If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are
called____________.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: B
Which approaches are used for determine whether a particular point is inside or outside of a
polygon____________.A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C
The process of mapping a world window in world coordinate system to viewport are called___________.
A. Transformation viewing
B. View Port
C. Clipping window
D. Screen coordinate system
ANSWER: A
In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the?
A. Codes of the end point are same
B. Logical AND of the end point code is not 0000
C. Logical OR of the end points code is 0000
D. Logical AND of the end point code is 0000
E. A and B
ANSWER: E
The transformation in which an object is moved in a minimum distance path from one position to another is
called________.
A. TranslationB. Scaling
C. Rotation
D. Reflection
ANSWER: A
The transformation in which the dimension of an object are changed relative to a specified fixed point is
called____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B
The graphics method in which one object is transformed into another object are called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B
A ploygon in which the line segment joining any two points within the polygon may not lies completely inside the
polygon, is called___________polygon .
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.
A. 4-connected
B. 5-connected
C. 6-connected
D. 8-connected
ANSWER: D
In scan fill algorithm the scan lines which needs to be considered are from___________.
A. Ymax to ymin of the whole polygon
B. Ymax to ymin of the longest edge of the polygon
C. Ymax to ymin of the shortest edge of the polygon
D. None of these
ANSWER: A
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (80,80).
Whether a point at (10,50) is visible or not?
A. Visible
B. Partially Visible
C. Completely Exterior
D. None of the above
ANSWER:C
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner
(100,100).What is the outcode of point (150,50)?
A. 0010
B. 1000
C. 0100
D. 0110
ANSWER: A
In sutherland-hodgeman polygon clipping algorithm,if both vertices of the edge are outside the window boundary
then_______is added to the output vertex.
A. First vertex
B. The intersection point of the polygon edge with the window boundary
C. Second vertex
D. None of these
ANSWER: B
A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
A. (23.67,50) and (69.06,40)
B. (50,23.67) and (69.06, 40)
C. (50,23.67) and (40,69.06)
D. None of Above
ANSWER:B
Adjacent pixels are likely to have same characteristics. This property is referred as_______.
A. Property of coherence
B. Spacial coherence
C. Spatial coherence
D. None of these
ANSWER: A
Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and
upper right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode
Algorithm.
A. (-8,6) and (2,8)
B. (-8,6) and (8,2)
C. (6,-8) and (2,8)
D. (8,-6) and (8,2)
ANSWER:A
Scale a square ABCD with co-ordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units for x-direction and 3-units for y –
direction.
A. A(0,0) , B(10,0) , C(10,15) , D(0,15)
B. A(0,0) , B(0,0) , C(10,15) , D(0,15)
C. A(0,0) , B(10,0) , C(10,10) , D(15,0)
D. None of these
ANSWER:A
In normalization transformation for window to viewport, window is lower left corner (1,1) and upper right corner at
(3,5) to a view point with lower left corner at (0,0) and upper right corner at(1/2,1/2) .Scaling factors Sx =___ &
Sy =___.
A. 0.25 & 0.125
B. 0.125 & 0.25
C. 4 & 8
D. 0.5 & 1
ANSWER:A
In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line AB with end-points A(30, 55) and B(70, 40) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:C
In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:A
In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50), the outcodes of P and Q will
be___________ and _________repectively.
A. 1000 and 0001
B. 0000 and 0000
C. 0100 and 0010
D. 1100 and 0011
ANSWER:B
In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will have __________ number of
intersection points with the clipping window.
A. 0
B. 1
C. 2
D. 3
ANSWER:B
In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are set on the basis of positions of the line
end points to the ________ of clipping window regions in the order.
A. Top, Bottom, Right, Left
B. Right, Top, Bottom, Left
C. Top, Right, Left, BottomD. Bottom, Right, Left, Top
ANSWER:A
In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line has outcode 1000, then the line lies
in the _________________region of the clipping window.
A. Left
B. Right
C. Top
D. Bottom
ANSWER:C
In the Cohen Sutherland Outcode Algorithm, if the point outcode is 1001, then the point lies in the
_________________regions of the clipping window.
A. Top and Right
B. Bottom and Right
C. Top and Left
D. Bottom and Left
ANSWER:C
The algorithm used for filling the interior of a polygon is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A
If the pixel is already filled with desired color then leaves it otherwise fills it. this is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B
ANSWER: D
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
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
The algorithm used for filling the interior of a polygon is called____________.A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A
If the pixel is already filled with desired color then leaves it otherwise fills it. this is called_______.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B
If a line joining any two of its interior points lies not completely inside are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B
If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called______.
A. Negatively oriented
B. Positively orientedC. Both a & b
D. None of these
ANSWER: B
If the visit to the vertices of the polygon in the given order produces an clockwise loop are cComputer Graphics MCQ
1alled______.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: A
Which things are mainly needed to make a polygon and to enter the polygon into display file_____.
A. No of sides of polygon
B. Vertices points
C. Both a & b
D. None of these
ANSWER: C
Which approaches are used for determine whether a particular point is inside or outside of a polygon_____.
A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C
For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the same iteration, we use which
of the following?
A. 4-connected method
B. 5-connected method
C. 7-connected method
D. 8-connected method
ANSWER: D
In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20) is______.
A. Inside the triangle
B. Outside the triangle
C. On the vertex
D. On the edge
ANSWER: B
MCQ on UNIT 3
1. A three dimensional graphics has
a. Two axes
b. Three axes
c. Both a & b
d. None of these
2. _________as the most commonly used boundary presentation for a 3-D graphics object
a. Data polygon
b. Surface polygon
c. System polygon
d. None of these
7. The most basic transformation that are applied in three-dimensional planes are
a. Translation
b. Scaling
c. Rotation
d. All of these
8. The transformation in which an object can be shifted to any coordinate position in three dimensional
plane are called
a. Translation
b. Scaling
c. Rotation
d. All of these
9. The transformation in which an object can be rotated about origin as well as any arbitrary pivot point are
called
a. Translation
b. Scaling
c. Rotation
d. All of these
10. The transformation in which the size of an object can be modified in x-direction ,y-direction and z-
direction
a. Translation
b. Scaling
c. Rotation
d. All of these
11. Apart from the basic transformation ,________are also used
a. Shearing
b. Reflection
c. Both a & b
d. None of these
12. In which transformation ,the shape of an object can be modified in any of direction depending upon the
value assigned to them
a. Reflection
b. Shearing
c. Scaling
d. None of these
13. In which transformation ,the mirror image of an object can be seen with respect to x-axis, y-axis ,z-axis as
well as with respect to an arbitrary line
a. Reflection
b. Shearing
c. Translation
d. None of these
20. _______refers to the common elements of graphics scenes ,often used in graphics package as primitive
components
a. Quadric surfaces
b. Wire frame model
c. Composite transformation
d. None of these
21. _________refer to the shapes created by union, intersection and difference of given shapes
a. Wire frame model
b. Composite transformation
c. Constructive solid geometry methods
d. None of these
22. ________refer to a model that represent all the dimension of an object external as well as internal
a. Wire frame model
b. Constructive solid geometry methods
c. Composite transformation
d. None of these
23. ________refers to the result obtained by multiplying the matrix of the individual transformation
representation sequences
a. Wire frame model
b. Constructive solid geometry methods
c. Composite transformation
d. None of these
24. The projection in which the projection plane is allowed to intersect the x, y and z-axes at equal distances
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal
25. In which projection ,the plane normal to the projection has equal angles with these three axes
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal
26. ___________is a simple object space algorithm that removes about half of the total polygon in an image
as about half of the faces of objects are back faces
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal
27. By which ,we can take a view of an object from different directions and different distances
a. Projection
b. Rotation
c. Translation
d. Scaling
32. The orthographic projection that show more than one side of an object are called
a. Axonometric projection
b. Isometric projection
c. Both a & b
d. None of these
33. The projection that can be viewed as the projection that has a centre of projection at a finite distance from
the plane of projection are called
a. Parallel projection
b. Perspective projection
c. Isometric projection
d. None of these
34. The perspective projection is more practical because the distant objects appear
a. Smaller
b. Larger
c. Neither smaller nor larger
d. None of these
40. The object refers to the 3D representation through linear, circular or some other representation are
called
a. Quadric surface
b. Sweep representation
c. Torus
d. None of these
41. The distance of a line from the projection plane determines
a. Its size on projection plane
b. Its length on projection plane
c. Its width on projection plane
d. Its height on projection plane
42. The further the line from the projection plane, _______its image on the projection plane
a. Smaller
b. Larger
c. Neither smaller nor larger
d. None of these
43. The Bezier curve obtained from the four control points is called a
a. Square Bezier curve
b. Cubic Bezier curve
c. Hectare Bezier curve
d. Rectangle Bezier curve
46. More the control points of a Bezier curve,________ quality of the curve
a. Higher
b. Lower
c. Bad
d. None of these
47. ______is one of the function that is used to specify a single plane surface
a. Meta-ball model
b. Fill area
c. Reflection
d. None of these
50. When two molecules move apart, which effect on molecular shapes
a. Stretching
b. Snapping
c. Contracting
d. All of these
1. The color options are numerically coded with the following values.
A. Ranging from 0 through the positive integer
B. Ranging from 0 to 1
C. Ranging from 0 to -0
D. Only c
ANSWER: A
2. In color raster system, the number of color choices available depends on_____________.
A. colors in frame buffer
B. Amount of storage provided per pixel in frame buffer
C. RGB color
D. Neither a nor b
ANSWER: B
8. If any intensity input value near 0.33 would be stored as the binary value 1 in the frame buffer,
then it displays__________.
A. Dark green color
B. Light gray color
C. Dark gray color
D. White or black
ANSWER: C
B. Edges
C. White region
D. Black region
ANSWER: D
12. White color in a Cartesian coordinate system can be represented as____________.
A. (0,1,1)
B. (0,1,0)
C. (0,0,1)
D. (1,1,1)
ANSWER: D
ANSWER: B
B. Black color
C. Cyan color
D. Magenta color
ANSWER: B
23. The RGB model display a much _______ percentage of the visible band as compared to
CMYK.
A. Lesser
B. Larger
C. Medium
D. None of these
ANSWER: B
24. Color depth can be defined by ________ which can be displayed on a display unit.
A. Bits per pixel
B. Bytes per pixel
C. Megabyte per pixel
D. None of these
ANSWER: A
ANSWER: B
B. Boundaries
C. Complements
D. Saturation
ANSWER: C
ANSWER: B
40. Many online animation tools are used to create animation in the form of___________.
A. JPEG image
B. PDF image
C. GIF image
D. None of these
ANSWER: C
B. Segment
C. Parameter
D. None of these
ANSWER:B
47. A two-dimensional array contain the details of all the segment are called________.
A. Segmentation table
B. Segment name
C. Operation
D. None of these
ANSWER: A
48. We assign all the attributes of segment under the________.
A. Segment Name
B. Segment size
C. Array
D. None of these
ANSWER: A
51. Deletion of any segment is much________ than creation of any new segment.
A. Easier
B. Difficult
C. Higher
D. None of these
ANSWER:B
52. When a display file is divided into number of subparts then each part is called as____.
A. Segment
B. Page
C. Image
D. Structure
ANSWER: A
55. Which of the following attribute of the segment is used to make changes in image?
A. Visibility
B. Segment name
C. Image Transformation
D. Segment Size
ANSWER:D
59. We can not have more than one segment open at a time. Statement true or false
A. TRUE
B. FALSE
C. Sometimes
D. None of these
ANSWER: A
60. The segment name is must be unique. State true or false.
A. TRUE
B. FALSE
C. Sometimes
D. None of these
ANSWER: A
67. After deleting a particular segment, the segment start attribute of all next segment
become_________.
A. Segment start of a particular segment - size of segment to be deleted
B. Segment Start of particular segment - Size of segment start of segment to be deleted.
C. Segment start of particular segment - size of next segment
D. None of these
ANSWER: A
D. None of these
ANSWER: B
71. It is necessary to organize the dispiay file in such away that it will be divided into several
______, which posses the portion of overall picture.
A. Line
B. Pixel
C. Segment
D. Curves
ANSWER:C