Computer Graphics MCQ 2

Subject:-Computer Graphics
Objective type questions combine
A chain of connected line segments is called a ________.
A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A
A closed polyline is called a _________.
A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B
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
__________ 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 theseANSWER:
C
_________ 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
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
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 getpixel function gives the ______ of specified pixel.A. intensity
B. colour
C. Size
D. Shape
ANSWER:
B
The putpixel function draws the pixel specified_______.
A. intensity
B. colour
C. Size
D. Shape
ANSWER:
B
Seed fill algo for filling polygon is ________ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
A
Scan line algorithm for filling polygon is ______ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
B
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
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
When a picture is displayed on the display device it is measeured in ________co-ordinate system.
A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:
B
Mapping the world co-ordinates into physical device co-ordinates is called__________.
A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.
A. Window
B. Segment
C. Clip
D. ViewportANSWER: A
An area on a physical device to which a window is mapped is called a __________.
A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: D
The region of a picture against which an object is to be clipped is called a
A. Clip Window
B. Segment
C. Clip
D. Viewport
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 theseANSWER: 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
The complex graphics operations are_______.
A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C
In computer graphics, a graphical object is known as________.
A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
A many sided figure is termed as_________.A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B
The end point of polygon are called as__________.
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
The line segment of polygon are called as _________.
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A
What are the types of polygon___________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: C
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
In which polygon object appears only partially________________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
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 object space in which the application model is defined____________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate systemD. None of these
ANSWER: C
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
Some common form of clipping include_________.
A. curve clipping
B. point clipping
C. polygon clipping
D. All of these
ANSWER: D
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
The process of coloring the area of a polygon is called___________.
A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A
How many types of polygon filling ____________.
A. Two
B. One
C. Three
D. Four
ANSWER: CThe 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
The function of scan line polygon fill algorithm are_______________.
A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
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
The side effect of scan conversion are__________.
A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A
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
The space in which the image is displayed are called___________.
A. Screen coordinate system
B. Clipping window
C. World coordinate system
D. None of these
ANSWER: A
Some common form of clipping include__________.
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D
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
An object can be viewed as a collection of___________.
A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER: C
The graphics method in which one object is transformed into another object are called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B
Scaling of a polygon is done by computing____________.
A. The product of (x, y) of each vertex
B. (x, y) of end points
C. Center coordinates
D. Only a
ANSWER: D
A chain of connected line segment is called a__________
A. Polyline
B. Polysegment
C. Polygon
.D. Polychain
ANSWER: A
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
Sutherland Hodgeman algorithm is used for_____________.
A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C
Which of the following is not true w.r.t polygon clipping.
A. Line clipping algorithms are not used for polygon clipping
B. The shape of polygon may change after clipping
C. The sequence of clipping w.r.t. window edges is fixed
D. All of these
ANSWER: CFollowing 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
Which of the following is true with respect to Suther Hodge algorithm?
A. It clips only concave polygons
B. It is more time consuming and complex
C. It may insert extra edges in resultant polygon
D. None of these
ANSWER: C
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:
BAdjacent 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
The first viewing parameter in perspective projection we must consider is the?
A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER:
C
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:
AIn 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
The graphics can be
A. Drawing
B. Photograph, movies
C. Simulation
D. All of theseANSWER: 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
There are 2 types of polygons. They are?
A. Convex and concave
B. Square and rectangle
C. Hexagon and square
D. Octagon and convex
ANSWER: A
A many sided figure is termed as_____.
A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B
The end point of polygon are called as___________.
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
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
The function of scan line polygon fill algorithm are________.
A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
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
In which polygon object appears only partially_______.
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
Two types of coordinates are_________.
A. Positive and negative coordinates
B. Absolute and relative coordinates
C. Both a & b
D. None
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
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 methodANSWER: 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


Subject:-Computer Graphics
Objective type questions Unit-I Graphics Primitives and Scan Conversion
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
2). _______is the smallest addressable screen element.
A. dots
B. point
C. pixels
D. spot
ANSWER: C
3.) ______is the smallest piece of the display screen which we can control.
A. dots
B. point
C. spot
D. pixel
ANSWER: D
4) We can control ____of the pixels which compose the screen.
A. intensity
B. size
C. shape
D. None
ANSWER: A
5) We can control ____of the pixels which compose the screen.
A. colour
B. size
C. shape
D. None
ANSWER: A
6) Each pixel on the graphics display represents______.
A. a single mathematical point
B. 2 mathematical point
C. 4 mathematical point
D. a region which theoretically can contain infinite points
ANSWER: D
7). A point (42,38) can be displayed on a screen by a pixel.
A. (4,3)
B. (3,4)
C. (5,4)
D. (4,4)
ANSWER: A8) The process of determining the appropriate pixel for representing, picture or graphics objects is known
as___
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: B
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
10) The computer graphics allows____ on pictures before displaying it.
A. rotation
B. translation
C. scaling and projections
D. All of above
ANSWER: D
11) Graphics devices include_____.
A. input devices
B. output devices
C. a and b
D. None
ANSWER: C
12) Computer graphics allows_____.
A. user interface
B. plotting of graphics and chart
C. office automation and desktop publishing
D. all of above
ANSWER: D
13) Computer graphics allows______.
A. copmuter-aided drafting and design
B. simulaion and animation
C. art and commerce
D. all of above
ANSWER: D
14) Computer graphics allows_____.
A. process control
B. cartography
C. art and commerce
D. all of above
ANSWER: D
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
17) The display devices are_____.
A. input
B. output
C. a and b
D. none of these
ANSWER: B
18) CRT stands for____.
A. Cathode Ray Tube
B. Colour Ray Tube
C. Cathode Radio Tube
D. Colour Radio Tube
ANSWER: A
19) A CRT is an evacuated _________ tube.
A. plastic
B. glass
C. steel
D. iron
ANSWER: B
20) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B
21) The deflection system of the CRT consistsof___________deflection plates.
A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C
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: C23) Vector scan technique is also called _________.
A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B
24) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh buffer
C. buffer display
D. refresh circuit
ANSWER: B
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
27) The deflection system of the CRT consistsof___________deflection plates.
A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C
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
29) Vector scan technique is also called _________.
A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B
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 theseANSWER: C
38) For ____________ display , scan conversion hardware is required.
A. vector scan
B. random scan
C. raster scan
D. none of these
ANSWER: C
39)Aspect ratio is the ratio of ________ to prodce equal length lines in both direction on the screen
A. vertical points to horizontal points
B. horizontal points to vertical points
C. left to riht and right to left diagonal points
D. right to left and left to right diagonal points
ANSWER: A
40)Display file can be implemented using __________ data structure.
A. array
B. linked list
C. paging
D. all of the above
ANSWER: D
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
42)The size of frame buffer(video memory )depends on_____________.
A. resolution only
B. number of different colors only
C. both (B) and(C)
D. computer byte
ANSWER: C
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
44)The resolution of an image is __________.
A. number of pixels per unit area
B. number of pixels per unit length inhorizontal
C. number of pixels per unit length in vertical
D. none of these
ANSWER: A
45)Persistance can be defined as______.
A. intensity of a pixelB. pixels per unit area
C. the duration of phosphorescence exhibited by a phosphor
D. number of pixels in an image
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
48) Frame buffer is used to store_____.
A. number if pixels in image
B. intencities of pixels
C. image definition
D. co-ordinate values of image
ANSWER: B
49) The clearity of a displayed image depends on the______.
A. resolution
B. floating point precision of system
C. associated software
D. aspect ratio
ANSWER: A
50)Random scan monitor can also referred to as______.
A. vector displays
B. stroke writing displays
C. calligraphic displays
D. none of the above
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
which factors affect resolution.
A. The type of phosphor
B. The intensity to be displayed
C. The focusing & deflection systems used in CRT
D. all of theseANSWER: 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
which is not true statement for raster scan generator.
A. It produces deflection signals
B. It consists of raster scan generator,x&y address register&pixel
C. it receive the intencity information of each pixel from frame buffer
D. it controls the x&y address registers
ANSWER: C
The disadvantage of raster graphics display system is ______.
A. It require large number of frame buffer memory cycles needed for video scan out
B. The burden of image generation is on the main CPU
C. Insufficient frame buffer memory band width
D. All of these
ANSWER: D
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
The image can be transmitted to the display point by________.
A. Line
B. Segment
C. Point
D. None of these
ANSWER: C
The center of display screen is computed as
A. X max ,y max
B. Xmax/2,ymax/2
C. Xmax/3,ymax/3
D. None of these
ANSWER: B
What is true about DDA algorithm for scan conversion of a line
A. General purpose method
B. Incremental
C. current calculation is independent of previous step
D. Is slower than the use of line equation
ANSWER: B
In DDA algorithm for scan conversion of line
A. if |m|<=1 then dx=1B. if |m|>=1 then dx=1
C. if |m|<=1 then dy=1
D. none of the above
ANSWER: A
Which of these is true about Bresenham's Line Algorithm?
A. Highly efficient incremental method
B. Uses scan conversion
C. uses integer addition,subtraction and multiplication by 2
D. all of the above
ANSWER: A
Integer addition,subtraction and multiplication by 2 in Bresenham's Line Algorithm can be done by
A. Simple arithmetic shift operation
B. circular shift operation
C. XOR Operation
D. none of the above
ANSWER: B
In Bresenham's algorithm for scan conversion of line
A. d=2dy-dx
B. d=2dx-dy
C. d=4dy-dx
D. d=4dx-dy
ANSWER: A
What is the basis of scan conversion of a circle?
A. Semi-circle symmetry
B. Quarter symmetry
C. Eight-way symmetry
D. none of the above
ANSWER: C
What is true about the Bresenhem's Circle algorithm?
A. if d<0 then d=d+4x+6
B. if d>0 then d=d+4x+6
C. if d<0 then d=d+4(x-y)+10 and y--
D. none of the above
ANSWER: A
which of these is a characteristic of midpoint circle algorithm?
A. Produces pixel points for an semicircle
B. Produces pixel points for an quadrant
C. Produces pixel points for an octant
D. none of the above
ANSWER: C
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: AIn 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 Cartesian slope-intercept equation for a straight line is ________________.
A. y = m(a+b+c)
B. y = m.x + b
C. y = 2∆x-m
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
In Bresenham's algorithm, while generating a circle , it is easy to generate?
A. One octant first and other by successive reflection
B. One octant first and other by successive rotation
C. One octant first and other by successive translation
D. All octants
ANSWER: AWhy a circle drawn on the screen appears to be elliptical ?
A. It is due to the aspect ratio of monitor
B. Screen has rectangular shape
C. Our eyes are not at the same level on screen
D. CRT is completely spherical
ANSWER: A
Which of the following technique is used in Midpoint Subdivision algorithm ?
A. Linear search
B. Binary Search
C. Heap sort
D. Bubble Sort
ANSWER: B
A circle, if scaled only in one direction becomes a ?
A. parabola
B. hyperbola
C. Ellipse
D. remains a circle
ANSWER: C
(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
A line can be represented by_________.
A. One point
B. Two points
C. Three points
D. Four points
ANSWER: B
Bresanham circle algorithm uses the approach of a ______________.
A. Midpoint
B. Point
C. Line
D. None of these
ANSWER: A
The side effect of scan conversion are________.
A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A
The process of reducing aliasing is called __________.
A. Resolution
B. Anti aliasing
C. SamplingD. None of these
ANSWER: B
The problem of aliasing are_____________.
A. Staircase
B. Unequal brightness
C. Picket fence problem
D. All of these
ANSWER: D
The basic principle of Bresenham`s line algorithm is__?
A. A to select the optimum raster locations to represent a straight line
B. to select either Δx or Δy, whichever is larger, is chosen as one raster unit
C. we find on which side of the line the midpoint lies
D. both a and b
ANSWER: A
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
A line segment _____________.
A. extends forward
B. extends backward
C. ends at two points
D. extends forever both forward and backward
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
Floating point arithmetic in DDA algorithm is__________.A. time efficient
B. time consuming
C. fast
D. slow
ANSWER: B
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
Expansion of line DDA algorithm is______.
A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
ANSWER: C
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
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
A dashed line could be displayed by generating_________.
A. Inter dash spacing
B. Very short dashes
C. Both A or B
D. A or B
ANSWER: A
Which of the following technique is used in Midpoint Subdivision algorithm ?
A. Linear search
B. Binary search
C. Heap sort
D. Bubble sort
ANSWER: B
Smallest size object that can be displayed on a monitor is called________.
A. Picture element
B. Point
C. Dot PitchD. Aspect ratio
ANSWER: A
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
Each screen point is referred to as_________________.
A. Resolution
B. Pixel
C. Persistence
D. Dot Pitch
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
Vector display is well suited for___________.
A. Animation
B. Line drawing applications
C. Cartoons
D. All of the above
ANSWER: B
Beam penetration method is usually used in______________.
A. LCD
B. Raster Scan display
C. Random scan display
D. DVST
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
Raster graphics are composed of ____________.
A. Pixels
B. Paths
C. Palette
D. None of these
ANSWER: A
Which of the following allow for 8 mirror images?
A. Parabola
B. Ellipse
C. Hyperbola
D. Circle
ANSWER: D
The simplest output primitive is__________.
A. Straight line
B. Straight line segment
C. Point
D. Circle
ANSWER: C
A bitmap is________ bit(s) per pixels.
A. 0
B. 1
C. 2
D. 4
ANSWER: B
The quality of an image depend on_____________.
A. No. of pixel used by image
B. No. of line used by image
C. No. of resolution used by image
D. None
ANSWER: A
The basic geometric structures that describes a scene on display is called__________-.
A. Attributes
B. Output primitive
C. Lines
D. Curves
ANSWER: B
An accurate and efficient raster line-generating algorithm is_________.
A. DDA algorithm
B. Mid-point algorithm
C. Parallel line algorithm
D. Bresenham’s line algorithmANSWER: D
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

Subject:-Computer Graphics
Objective type questions Unit-II Polygons and Clipping Algorithms
A chain of connected line segments is called a ________.
A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A
A closed polyline is called a _________.
A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B
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
__________ 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_________ 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
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
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 getpixel function gives the ______ of specified pixel.
A. intensity
B. colourC. Size
D. Shape
ANSWER:
B
The putpixel function draws the pixel specified_______.
A. intensity
B. colour
C. Size
D. Shape
ANSWER:
B
Seed fill algo for filling polygon is ________ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
A
Scan line algorithm for filling polygon is ______ algorithm.
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
B
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
The process of selecting and viewing the picture with diffrerent views is called_______.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:
BA 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
When a picture is displayed on the display device it is measeured in ________co-ordinate system.
A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:
B
Mapping the world co-ordinates into physical device co-ordinates is called__________.
A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.
A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: A
An area on a physical device to which a window is mapped is called a __________.
A. Window
B. SegmentC. Clip
D. Viewport
ANSWER: D
The region of a picture against which an object is to be clipped is called a
A. Clip Window
B. Segment
C. Clip
D. Viewport
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: AIf 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 window
C. 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 windowC. 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 these
ANSWER: 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: BIn 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
The complex graphics operations are_______.
A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C
In computer graphics, a graphical object is known as________.
A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
A many sided figure is termed as_________.
A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B
The end point of polygon are called as__________.
A. Edges
B. Vertices
C. LineD. None of these
ANSWER: B
The line segment of polygon are called as _________.
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A
What are the types of polygon___________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: C
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 polygon
C. Both a & b
D. None of these
ANSWER: B
In which polygon object appears only partially________________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
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 object space in which the application model is defined____________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: C
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
Some common form of clipping include_________.
A. curve clipping
B. point clipping
C. polygon clippingD. All of these
ANSWER: D
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
The process of coloring the area of a polygon is called___________.
A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A
How many types of polygon filling ____________.
A. Two
B. One
C. Three
D. Four
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
The function of scan line polygon fill algorithm are_______________.
A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
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
The side effect of scan conversion are__________.
A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A
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
The space in which the image is displayed are called___________.
A. Screen coordinate system
B. Clipping window
C. World coordinate systemD. None of these
ANSWER: A
Some common form of clipping include__________.
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D
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. Translation
B. 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
An object can be viewed as a collection of___________.
A. One segment
B. Two segment
C. Several segments
D. None of theseANSWER: C
The graphics method in which one object is transformed into another object are called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B
Scaling of a polygon is done by computing____________.
A. The product of (x, y) of each vertex
B. (x, y) of end points
C. Center coordinates
D. Only a
ANSWER: D
A chain of connected line segment is called a__________
.
A. Polyline
B. Polysegment
C. Polygon
D. Polychain
ANSWER: A
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 polygonB. 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
Sutherland Hodgeman algorithm is used for_____________.
A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C
Which of the following is not true w.r.t polygon clipping.
A. Line clipping algorithms are not used for polygon clipping
B. The shape of polygon may change after clipping
C. The sequence of clipping w.r.t. window edges is fixed
D. All of these
ANSWER: C
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
Which of the following is true with respect to Suther Hodge algorithm?
A. It clips only concave polygons
B. It is more time consuming and complex
C. It may insert extra edges in resultant polygonD. None of these
ANSWER: C
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 theseANSWER:
A
The first viewing parameter in perspective projection we must consider is the?
A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER:
C
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 0011ANSWER:
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, Bottom
D. 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: AIf 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
The graphics can be
A. Drawing
B. Photograph, movies
C. Simulation
D. All of these
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
There are 2 types of polygons. They are?
A. Convex and concave
B. Square and rectangle
C. Hexagon and square
D. Octagon and convex
ANSWER: A
A many sided figure is termed as_____.
A. Square
B. PolygonC. Rectangle
D. None
ANSWER: B
The end point of polygon are called as___________.
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
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
The function of scan line polygon fill algorithm are________.
A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
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: BIn which polygon object appears only partially_______.
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 oriented
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 clockwise loop are called______.
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
Two types of coordinates are_________.
A. Positive and negative coordinates
B. Absolute and relative coordinates
C. Both a & b
D. None
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 methodC. 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