# 650+ Computer Graphics Solved MCQs

52
32.5k
1.

A. inside
B. outside
C. fill
D. cover
2.

## In an inside test if number of intersections are ---------------- then point is inside of the polygon. Note : intersection point is not a vertex.

A. even
B. odd
C. infinite
D. none of the above
3.

A. inside
B. outside
C. color
D. can\t say
4.

## In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same side of constructed horizontal line then the number of intersections are considered as ----------. Note : intersection point is a vertex

A. even number
B. odd number
C. infinite number
D. can\t say
5.

## In an inside test if intersections point is a vertex and edges meeting at that vertex lies on ------------- side of constructed horizontal line then the number of intersections are considered as even number . Note : intersection point is a vertex

A. same
B. opposite
C. on the
D. none of the above
6.

## Two inside polygon test methods are __________ and ________

A. even odd method , winding number method
B. scan line and flood fill
C. even odd method, flood fill
D. winding number method, scan line
Answer» A. even odd method , winding number method
7.

A. true
B. false
8.

## Following is the method for inside test of the polygon.

A. even-odd method
B. linear method
C. inside method
D. seed method
9.

## Every side in winding number method has given a number called

A. winding number
B. integer no.
C. direct number
D. side number
10.

## The total of the winding no. in winding number method of inside test is called as

A. winding.
B. collective winding.
C. net winding.
D. summation winding.
11.

A. true
B. false
12.

## Inside tests of polygon are useful in --------

A. polygon filling
B. line coloring
D. none of the above
13.

A. edges
B. vertices
C. intersections
D. pixels
14.

## In winding number method an ------------------ edges ------ considered

A. horizontal , not
B. vertical , not
C. slanted , not
D. horizontal , is
15.

A. polygons
B. circles
C. lines
D. all of above
16.

A. zero
B. +1 or -1
C. only +1
D. only -1
17.

## If the pixel is already filled with desired color then does nothing, otherwise fills it. This is called

A. flood fill algorithm
B. boundary fill algorithm
C. scan line polygon filling algorithm
D. none of these
18.

## 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
19.

## ___________ procedure accepts the coordinates of an internal point.

A. area fill
B. boundary fill.
C. line fill.
D. scan fill.
20.

A. 8
B. 4
C. 2
D. 16
21.

## Following statement(s) is/are true about flood fill algorithm

A. it need a seed pixel
B. it works at pixel level
C. requires more memory
D. all of above
22.

## Following statement(s) is/are false about flood fill algorithm

A. it doesn’t need a seed pixel
B. it works at pixel level
C. requires more memory
D. all of above
Answer» A. it doesn’t need a seed pixel
23.

## Seed pixel in flood fill Algorithm is an

A. an interior pixel
B. exterior pixel
C. not a pixel
D. it is color of pixel
24.

A. stack
B. array
C. heap
D. none of above
25.

## The 4-connected Polygon filling technique has disadvantage(s) as

A. requires more memory
B. may fill polygon partially
C. stack overflow
D. all of above
26.

A. flood fill
B. boundary fill
C. dda fill
D. bsa fill
27.

## The process of coloring the area of a polygon is called

A. polygon filling
B. polygon flow
C. aliasing
D. none of these
28.

A. recursive
B. static
C. one
D. none of these
29.

## Boundary fill algorithm needs–

A. boundary color (bc) and (x,y) coordinates of seed point.
B. fill color (fc) and (x,y) coordinates of seed point.
C. boundary color (bc), fill color (fc) and (x,y) coordinates of seed point.
D. (x,y) coordinates of seed point.
Answer» C. boundary color (bc), fill color (fc) and (x,y) coordinates of seed point.
30.

A. boundary fill
B. region fill
C. scan fill
D. dda fill
31.

A. flood fill
B. region fill
C. scan fill
D. dda fill
32.

A. true
B. false
33.

A. true
B. false
34.

## Which statement is true about the 4 connected region.

A. it is faster than 8 connected region
B. sometimes it leaves region unfilled.
C. both a and b
D. neither a or b
Answer» C. both a and b
35.

## 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 and b
D. neither a or b
Answer» A. find intersection point of the boundary of polygon and scan line
36.

## The edge table contains pointers back to the ______________ to identify vertices for each polygon edge.

A. vertex table.
B. polygon table.
C. edge table.
D. expanded vertex table.
37.

## Scan line polygon filling method uses

A. scan-line coherence
B. edge coherence
C. area coherence
D. both a and b
Answer» D. both a and b
38.

## Scan-line coherence property is used in

A. line drawing algorithm
B. scan line polygon filling algorithm
C. flood fill polygon filling algorithm
D. none of above
Answer» B. scan line polygon filling algorithm
39.

## Which of the following is true about scan line algorithm?

A. it need a seed pixel
B. it works at pixel level
C. it uses scan lines to fill the polygon
D. all of above
Answer» C. it uses scan lines to fill the polygon
40.

## In scan line algorithm the intersection points are

A. sorted in ascending order
B. sorted in descending order
C. not sorted
D. deleted
Answer» A. sorted in ascending order
41.

## Which of the following algorithms to fill polygons was the one used by real rasterizers?

A. flood-fill polygons
B. scan-line polygon
C. boundary fill polygons
D. none of above
42.

A. boundary fill
B. region fill
C. scan line
D. edge fill
43.

A. scan lines
B. points
C. layers
D. none of above
44.

A. y order
B. x order
C. pixel order
D. color order
45.

## When the current scan line in Scan line polygon fill algorithm moves above the upper / below the lower endpoint, the edge

A. becomes inactive
B. becomes active
46.

## The edges crossed by current scan line in Scan line polygon fill algorithm are called as

A. active edges
B. inactive edges
C. marked edges
D. none of these
47.

A. color level
B. edge level
C. polygon level
D. pixel level
48.

## Following are the data structures used in Scan line algorithm to increase the efficiency.

A. active edge list
B. active edge table
C. both a and b
D. neither a or b
Answer» C. both a and b
49.

## Scan line polygon filling algorithm starts from

A. either ymax or ymin
B. either xmax or xmin
C. only xmax
D. only xmin
Answer» A. either ymax or ymin
50.

A. true
B. false
C. cant say
D. none of these
51.

A. true
B. false
C. cant say
D. none of these
52.

A. 1101
B. 11
C. 101
D. 10
53.

## Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?

A. need to perform trivial accept / reject test on end points of the line.
B. need to perform trivial accept / reject test for every point on the line.
C. cannot say
D. none of these
Answer» B. need to perform trivial accept / reject test for every point on the line.
54.

## If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle

A. xmin > x < xmax and ymin > y < ymax
B. xmin > x > xmax and ymin > y > ymax
C. xmin < x < xmax and ymin < y < ymax
D. xmin < x > xmax and ymin < y > ymax
Answer» C. xmin < x < xmax and ymin < y < ymax
55.

## determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying the rules

A. p1:clipped away, p2: clipped away, p3:clipped away
B. p1: visible, p2:visible, p3:clipped away
C. p1: visible, p2:visible, p3: visible
D. p1: clipped away, p2:visible, p3:clipped away
Answer» D. p1: clipped away, p2:visible, p3:clipped away
56.

A. 4
B. 3
C. 2
D. 1
57.

A. 6
B. 7
C. 9
D. 10
58.

A. yes
B. no
C. cannot say
D. none of these
59.

A. 1967
B. 1968
C. 1969
D. 1965
60.

## Primitive types of clipping algorithms are

A. point clipping
B. line clipping
C. polygon clipping
D. all of above
61.

## In ________ operation eliminates objects or portions of objects that are not visible through the window to ensure the proper construction of corresponding image

A. clipping
B. windowing
C. viewing
D. transformation
62.

## The region against which an object is clipped is called as ____________

A. clip window
B. clip rectangle
C. window
D. none of these
63.

## Cohen – Sutherland Line Clipping Algorithm is also called as ____________________

A. sutherland - hodgman algorithm
B. cohen - sutherland outcode algorithm
C. cyrus - beck algorithm
D. none of above
Answer» B. cohen - sutherland outcode algorithm
64.

A. 110
B. 1
C. 0
D. 10
65.

A. translation
B. shearing
C. reflection
D. clipping
66.

A. selection
B. clipping
C. shear
D. none of these
67.

A. translation
B. shearing
C. reflection
D. clipping
68.

## 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. clipping window or world window
69.

## ............. identifies the picture portions that are exterior to the clip window

A. interior clipping
B. exterior clipping
C. extraction
D. none of these
70.

A. 1111
B. 0
C. 10
D. 11
71.

## According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

A. the region codes of line endpoints have a \1\ in same bit position.
B. the endpoints region code are nonzero values
C. if l bit and r bit are nonzero.
D. the region codes of line endpoints have a \0\ in same bit position.
Answer» A. the region codes of line endpoints have a \1\ in same bit position.
72.

A. top left
B. top right
C. bottom left
D. bottom right
73.

## The result of logical AND operation with endpoint region codes is a nonzero value. Which of the following statement is true?

A. the line is completely inside the window
B. the line is completely outside the window
C. the line is partially inside the window
D. the line is already clipped
Answer» B. the line is completely outside the window
74.

A. x > xwmin
B. x< xwmin
C. x< xwmax
D. x>xwmax
75.

A. x > xwmin
B. x< xwmin
C. x< xwmax
D. x>xwmax
76.

A. y >ywmin
B. y< ywmin
C. y< ywmax
D. y>ywmax
77.

A. y >ywmin
B. y< ywmin
C. y< ywmax
D. y>ywmax
78.

## The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part (viewport) is visible.

A. cohen-sutherland
B. liang barsky
C. sutherland hodegeman
D. none of these
79.

## Sutherland Hodgeman algorithm works well for...........

A. concave polygons
B. convex polygons
C. smooth curves
D. line segments
80.

## A line with endpoints codes as 0000 and 01 is ?

A. partially invisible
B. completely visible
C. completely invisible
D. trivially invisible
81.

## 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 or of the end points code is 0000
C. logical and of the end point code is 0000
D. only a
82.

## Sutherland – Hodgman algorithm is used for _______________.

A. line clipping
B. polygon clipping
C. point clipping
D. hybrid clipping
83.

## Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?

A. cohen-sutherland
B. sutherland hodgman
C. both a and b
D. neither a or b
84.

## In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should

A. store interaction point of line ps (s’) only
B. store point p and s’
C. store point p only
D. store points s and s’
Answer» B. store point p and s’
85.

## In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should

A. store interaction point of line ps (s’) only
B. store point p and s’
C. store point p only
D. store nothing
86.

## In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should

A. store interaction point of line ps (s’) only
B. store point p and s’
C. store point p only
D. store points s and s’
Answer» A. store interaction point of line ps (s’) only
87.

## In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should

A. store interaction point of line ps (s’) only
B. store point p and s’
C. store point p only
D. store points s and s’
Answer» C. store point p only
88.

## In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is used as

A. left -> right -> top -> bottom
B. left -> bottom -> right -> top
C. right -> top -> left -> bottom
D. left -> bottom -> top -> right
Answer» A. left -> right -> top -> bottom
89.

## Polygon-Clipping algorithms include the:

A. sutherland-hodgeman method
B. liang-barsky method
C. weiler-atherton method
D. all of above
90.

## _______ is a ordered list of vertices where each vertex connected with the next in the list.

A. line
B. polygon
C. parabola
D. none of the above
91.

A. concave
B. convex
C. complex
D. all of above
92.

A. circle
B. rectangle
C. polygon
D. ellipse
93.

## In convex Polygon all interior angles are

A. less than 90
B. less than 180
C. greater than 180
D. greater than 90
94.

## In concave Polygon atleast one interior angle is

A. less than 90
B. less than 180
C. greater than 180
D. greater than 90
95.

## A region S is ____ , iff for any x1 and x2 in S, the straight line segment connecting x1 and x2 is also contained in S.

A. concave
B. convex
C. self-intersecting
D. polygon with hole
96.

A. paralleogram
B. trapizoid
C. polygon
D. triangle
97.

A. circle
B. line
C. polygon
D. point
98.

A. concave
B. convex
C. linear
D. complex
99.

A. concave
B. convex
C. complex
D. linear
100.

A. convex
B. concave
C. complex
D. linear