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 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. 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. Windowing
C. 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. Viewport
ANSWER: 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 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 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 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: 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

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 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 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: 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 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. 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 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: 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 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: 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

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 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, 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: 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 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. 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 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 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