McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Electronics and Communication Engineering .
| 51. |
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111 |
| A. | true |
| B. | false |
| C. | cant say |
| D. | none of these |
| Answer» A. true | |
| 52. |
Which one is not valid out code to perform trivial accept / reject test in line clipping |
| A. | 1101 |
| B. | 11 |
| C. | 101 |
| D. | 10 |
| Answer» A. 1101 | |
| 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. |
Outcode / Region Code used in Line Clipping is of size ____ bits. |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 1 |
| Answer» A. 4 | |
| 57. |
In Line Clipping algorithm, the two dimensional space is divided into ___ regions. |
| A. | 6 |
| B. | 7 |
| C. | 9 |
| D. | 10 |
| Answer» C. 9 | |
| 58. |
Is 0011 valid region code / outcode used in Line Clipping algorithm? |
| A. | yes |
| B. | no |
| C. | cannot say |
| D. | none of these |
| Answer» B. no | |
| 59. |
Cohen – Sutherland line clipping algorithm was developed in ____ |
| A. | 1967 |
| B. | 1968 |
| C. | 1969 |
| D. | 1965 |
| Answer» A. 1967 | |
| 60. |
Primitive types of clipping algorithms are |
| A. | point clipping |
| B. | line clipping |
| C. | polygon clipping |
| D. | all of above |
| Answer» 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 |
| Answer» A. clipping | |
| 62. |
The region against which an object is clipped is called as ____________ |
| A. | clip window |
| B. | clip rectangle |
| C. | window |
| D. | none of these |
| Answer» A. clip window | |
| 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. |
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). What is the outcode of point (150,50)? |
| A. | 110 |
| B. | 1 |
| C. | 0 |
| D. | 10 |
| Answer» C. 0 | |
| 65. |
The selection and separation of a part of text or image for further operation are called |
| A. | translation |
| B. | shearing |
| C. | reflection |
| D. | clipping |
| Answer» D. clipping | |
| 66. |
The complex graphics operations are |
| A. | selection |
| B. | clipping |
| C. | shear |
| D. | none of these |
| Answer» B. clipping | |
| 67. |
The process of extracting a portion of a database or a picture inside or outside a specified region are called |
| A. | translation |
| B. | shearing |
| C. | reflection |
| D. | clipping |
| Answer» 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 |
| Answer» B. exterior clipping | |
| 70. |
The region code of a point within the window is ............ |
| A. | 1111 |
| B. | 0 |
| C. | 10 |
| D. | 11 |
| Answer» B. 0 | |
| 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. |
The region code of a point is 11. The point is in the ................. region of window. |
| A. | top left |
| B. | top right |
| C. | bottom left |
| D. | bottom right |
| Answer» A. top left | |
| 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. |
The left (L bit ) bit of the region code of a point (X,Y) is '1' if ...................... |
| A. | x > xwmin |
| B. | x< xwmin |
| C. | x< xwmax |
| D. | x>xwmax |
| Answer» B. x< xwmin | |
| 75. |
The right bit (R bit)of the region code of a point (X,Y) is '1' if ...................... |
| A. | x > xwmin |
| B. | x< xwmin |
| C. | x< xwmax |
| D. | x>xwmax |
| Answer» D. x>xwmax | |
| 76. |
The Most Significant Bit of the region code of a point (X,Y) is '1' if ...................... |
| A. | y >ywmin |
| B. | y< ywmin |
| C. | y< ywmax |
| D. | y>ywmax |
| Answer» D. y>ywmax | |
| 77. |
The bottom bit of the region code of a point is '0' if ....................... |
| A. | y >ywmin |
| B. | y< ywmin |
| C. | y< ywmax |
| D. | y>ywmax |
| Answer» 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 |
| Answer» A. cohen-sutherland | |
| 79. |
Sutherland Hodgeman algorithm works well for........... |
| A. | concave polygons |
| B. | convex polygons |
| C. | smooth curves |
| D. | line segments |
| Answer» B. convex polygons | |
| 80. |
A line with endpoints codes as 0000 and 01 is ? |
| A. | partially invisible |
| B. | completely visible |
| C. | completely invisible |
| D. | trivially invisible |
| Answer» A. partially 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 |
| Answer» D. only a | |
| 82. |
Sutherland – Hodgman algorithm is used for _______________. |
| A. | line clipping |
| B. | polygon clipping |
| C. | point clipping |
| D. | hybrid clipping |
| Answer» B. polygon 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 |
| Answer» B. sutherland hodgman | |
| 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 |
| Answer» 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 |
| Answer» 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 |
| Answer» B. polygon | |
| 91. |
Types of polygon : |
| A. | concave |
| B. | convex |
| C. | complex |
| D. | all of above |
| Answer» D. all of above | |
| 92. |
Concave and Convex are types of _______ |
| A. | circle |
| B. | rectangle |
| C. | polygon |
| D. | ellipse |
| Answer» C. polygon | |
| 93. |
In convex Polygon all interior angles are |
| A. | less than 90 |
| B. | less than 180 |
| C. | greater than 180 |
| D. | greater than 90 |
| Answer» B. less than 180 | |
| 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 |
| Answer» C. greater than 180 | |
| 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 |
| Answer» B. convex | |
| 96. |
_____ may not always be Convex . |
| A. | paralleogram |
| B. | trapizoid |
| C. | polygon |
| D. | triangle |
| Answer» C. polygon | |
| 97. |
__________ is represented as a number of line segments connected end to end to form a closed figure. |
| A. | circle |
| B. | line |
| C. | polygon |
| D. | point |
| Answer» C. polygon | |
| 98. |
___________ is not a Type of polygon |
| A. | concave |
| B. | convex |
| C. | linear |
| D. | complex |
| Answer» C. linear | |
| 99. |
Right angled Triangle is an example of ____ Polygon |
| A. | concave |
| B. | convex |
| C. | complex |
| D. | linear |
| Answer» B. convex | |
| 100. |
Square is an example of ____ Polygon |
| A. | convex |
| B. | concave |
| C. | complex |
| D. | linear |
| Answer» A. convex | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.