MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 873 Mcqs, each offering curated multiple-choice questions to sharpen your Bachelor Multimedia Communication (B.M.M.C.) knowledge and support exam preparation. Choose a topic below to get started.
| 401. |
_____ may not always be Convex . |
| A. | paralleogram |
| B. | trapizoid |
| C. | polygon |
| D. | triangle |
| Answer» D. triangle | |
| 402. |
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» C. self-intersecting | |
| 403. |
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» D. greater than 90 | |
| 404. |
In convex Polygon all interior angles are |
| A. | less than 90 |
| B. | less than 180 |
| C. | greater than 180 |
| D. | greater than 90 |
| Answer» C. greater than 180 | |
| 405. |
Concave and Convex are types of _______ |
| A. | circle |
| B. | rectangle |
| C. | polygon |
| D. | ellipse |
| Answer» D. ellipse | |
| 406. |
Types of polygon : |
| A. | concave |
| B. | convex |
| C. | complex |
| D. | all of above |
| Answer» E. | |
| 407. |
_______ 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» C. parabola | |
| 408. |
Polygon-Clipping algorithms include the: |
| A. | sutherland-hodgeman method |
| B. | liang-barsky method |
| C. | weiler-atherton method |
| D. | all of above |
| Answer» E. | |
| 409. |
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» B. left -> bottom -> right -> top | |
| 410. |
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» D. store points s and s’ | |
| 411. |
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» B. store point p and s’ | |
| 412. |
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» E. | |
| 413. |
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» C. store point p only | |
| 414. |
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» C. both a and b | |
| 415. |
Sutherland – Hodgman algorithm is used for _______________. |
| A. | line clipping |
| B. | polygon clipping |
| C. | point clipping |
| D. | hybrid clipping |
| Answer» C. point clipping | |
| 416. |
A line with endpoints codes as 0000 and 01 is ? |
| A. | partially invisible |
| B. | completely visible |
| C. | completely invisible |
| D. | trivially invisible |
| Answer» B. completely visible | |
| 417. |
Sutherland Hodgeman algorithm works well for........... |
| A. | concave polygons |
| B. | convex polygons |
| C. | smooth curves |
| D. | line segments |
| Answer» C. smooth curves | |
| 418. |
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» E. | |
| 419. |
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» E. | |
| 420. |
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» E. | |
| 421. |
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» C. x< xwmax | |
| 422. |
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» B. top right | |
| 423. |
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» C. world coordinate system | |
| 424. |
The complex graphics operations are |
| A. | selection |
| B. | clipping |
| C. | shear |
| D. | none of these |
| Answer» C. shear | |
| 425. |
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» E. | |
| 426. |
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. | 10 |
| Answer» D. | |
| 427. |
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» C. cyrus - beck algorithm | |
| 428. |
The region against which an object is clipped is called as ____________ |
| A. | clip window |
| B. | clip rectangle |
| C. | window |
| D. | none of these |
| Answer» B. clip rectangle | |
| 429. |
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» B. windowing | |
| 430. |
Primitive types of clipping algorithms are |
| A. | point clipping |
| B. | line clipping |
| C. | polygon clipping |
| D. | all of above |
| Answer» E. | |
| 431. |
Cohen – Sutherland line clipping algorithm was developed in ____ |
| A. | 1967 |
| B. | 1968 |
| C. | 1969 |
| D. | 1965 |
| Answer» B. 1968 | |
| 432. |
Is 0011 valid region code / outcode used in Line Clipping algorithm? |
| A. | yes |
| B. | no |
| C. | cannot say |
| D. | none of these |
| Answer» C. cannot say | |
| 433. |
In Line Clipping algorithm, the two dimensional space is divided into ___ regions. |
| A. | 6 |
| B. | 7 |
| C. | 9 |
| D. | 10 |
| Answer» D. 10 | |
| 434. |
Outcode / Region Code used in Line Clipping is of size ____ bits. |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 1 |
| Answer» B. 3 | |
| 435. |
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» E. | |
| 436. |
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» C. cannot say | |
| 437. |
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» D. xmin < x > xmax and ymin < y > ymax | |
| 438. |
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» B. 11 | |
| 439. |
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» B. false | |
| 440. |
Scan line polygon filling algorithm can be used for filling Convex polygon. |
| A. | true |
| B. | false |
| C. | cant say |
| D. | none of these |
| Answer» B. false | |
| 441. |
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» D. neither a or b | |
| 442. |
Scan line polygon filling algorithm starts from |
| A. | either ymax or ymin |
| B. | either xmax or xmin |
| C. | only xmax |
| D. | only xmin |
| Answer» B. either xmax or xmin | |
| 443. |
Scan line Fill Approach works at the |
| A. | color level |
| B. | edge level |
| C. | polygon level |
| D. | pixel level |
| Answer» D. pixel level | |
| 444. |
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 |
| Answer» B. inactive edges | |
| 445. |
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 |
| C. | is discarded |
| D. | is added. |
| Answer» B. becomes active | |
| 446. |
In scan line algorithm, Scan lines are processed in increasing (upward) / decreasing (downward) --------------------------. |
| A. | y order |
| B. | x order |
| C. | pixel order |
| D. | color order |
| Answer» B. x order | |
| 447. |
Scan line polygon filling algorithm uses series of ……………. To fill the polygon. |
| A. | scan lines |
| B. | points |
| C. | layers |
| D. | none of above |
| Answer» B. points | |
| 448. |
Active edge table is used in following algorithm |
| A. | boundary fill |
| B. | region fill |
| C. | scan line |
| D. | edge fill |
| Answer» D. edge fill | |
| 449. |
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 |
| Answer» C. boundary fill polygons | |
| 450. |
In scan line algorithm the intersection points are |
| A. | sorted in ascending order |
| B. | sorted in descending order |
| C. | not sorted |
| D. | deleted |
| Answer» B. sorted in descending order | |