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.
| 451. |
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» D. all of above | |
| 452. |
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» C. flood fill polygon filling algorithm | |
| 453. |
Scan line polygon filling method uses |
| A. | scan-line coherence |
| B. | edge coherence |
| C. | area coherence |
| D. | both a and b |
| Answer» E. | |
| 454. |
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. |
| Answer» B. polygon table. | |
| 455. |
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» B. find intersection point of the boundary of polygon and point | |
| 456. |
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» D. neither a or b | |
| 457. |
Scan line fill algorithm is more efficient than flood fill algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 458. |
Horizontal lines are not considered in scan line fill algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 459. |
Which polygon fill algorithm needs following information - 1. Region Color (RC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed point. |
| A. | flood fill |
| B. | region fill |
| C. | scan fill |
| D. | dda fill |
| Answer» B. region fill | |
| 460. |
Which polygon fill algorithm needs following information - 1.Boundary Color (BC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed point. |
| A. | boundary fill |
| B. | region fill |
| C. | scan fill |
| D. | dda fill |
| Answer» B. region fill | |
| 461. |
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» D. (x,y) coordinates of seed point. | |
| 462. |
Boundary fill algorithm uses -------- call to the fill function. |
| A. | recursive |
| B. | static |
| C. | one |
| D. | none of these |
| Answer» B. static | |
| 463. |
The process of coloring the area of a polygon is called |
| A. | polygon filling |
| B. | polygon flow |
| C. | aliasing |
| D. | none of these |
| Answer» B. polygon flow | |
| 464. |
In --------------algorithm edges can be specified in different color. |
| A. | flood fill |
| B. | boundary fill |
| C. | dda fill |
| D. | bsa fill |
| Answer» B. boundary fill | |
| 465. |
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 |
| Answer» E. | |
| 466. |
In Boundary Fill method ____________ Data Structure is used. |
| A. | stack |
| B. | array |
| C. | heap |
| D. | none of above |
| Answer» B. array | |
| 467. |
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 |
| Answer» B. exterior pixel | |
| 468. |
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» B. it works at pixel level | |
| 469. |
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 |
| Answer» E. | |
| 470. |
In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels. |
| A. | 8 |
| B. | 4 |
| C. | 2 |
| D. | 16 |
| Answer» B. 4 | |
| 471. |
___________ procedure accepts the coordinates of an internal point. |
| A. | area fill |
| B. | boundary fill. |
| C. | line fill. |
| D. | scan fill. |
| Answer» C. line fill. | |
| 472. |
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 |
| Answer» C. scan line polygon filling algorithm | |
| 473. |
In winding number method an edge can have winding number as ----- |
| A. | zero |
| B. | +1 or -1 |
| C. | only +1 |
| D. | only -1 |
| Answer» C. only +1 | |
| 474. |
Even-odd method of inside test is suitable for------ |
| A. | polygons |
| B. | circles |
| C. | lines |
| D. | all of above |
| Answer» B. circles | |
| 475. |
In winding number method an ------------------ edges ------ considered |
| A. | horizontal , not |
| B. | vertical , not |
| C. | slanted , not |
| D. | horizontal , is |
| Answer» B. vertical , not | |
| 476. |
Even-odd method of inside test counts ----- to decide the position of a point. |
| A. | edges |
| B. | vertices |
| C. | intersections |
| D. | pixels |
| Answer» D. pixels | |
| 477. |
Inside tests of polygon are useful in -------- |
| A. | polygon filling |
| B. | line coloring |
| C. | shadowing |
| D. | none of the above |
| Answer» B. line coloring | |
| 478. |
Winding number method always gives correct answer for overlapping polygons |
| A. | true |
| B. | false |
| Answer» C. | |
| 479. |
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. |
| Answer» D. summation winding. | |
| 480. |
Every side in winding number method has given a number called |
| A. | winding number |
| B. | integer no. |
| C. | direct number |
| D. | side number |
| Answer» B. integer no. | |
| 481. |
Following is the method for inside test of the polygon. |
| A. | even-odd method |
| B. | linear method |
| C. | inside method |
| D. | seed method |
| Answer» B. linear method | |
| 482. |
The 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the position shown with an X. |
| A. | true |
| B. | false |
| Answer» C. | |
| 483. |
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» B. scan line and flood fill | |
| 484. |
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 |
| Answer» B. opposite | |
| 485. |
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 |
| Answer» B. odd number | |
| 486. |
In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note : intersection point is not a vertex |
| A. | inside |
| B. | outside |
| C. | color |
| D. | can\t say |
| Answer» B. outside | |
| 487. |
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 |
| Answer» C. infinite | |
| 488. |
An -------------test is used to check whether a point is inside or outside of the polygon. |
| A. | inside |
| B. | outside |
| C. | fill |
| D. | cover |
| Answer» B. outside | |
| 489. |
and start point is (20, 20), then slope m =? |
| A. | 1.2 |
| B. | 0.8 |
| C. | -0.4 |
| D. | none of the above |
| Answer» C. -0.4 | |
| 490. |
Which of the following attribute of the segment is used to make changes in image? |
| A. | visibility |
| B. | segment name |
| C. | image transformation |
| D. | segment size |
| Answer» E. | |
| 491. |
0 degree of red color in hue image will correspond to______________. |
| A. | boundary |
| B. | edges |
| C. | white region |
| D. | black region |
| Answer» E. | |
| 492. |
The transformation matrix is used for__________. |
| A. | reflection at x axis |
| B. | reflection at y axis |
| C. | reflection at origin |
| D. | reflection at line y=x |
| Answer» D. reflection at line y=x | |
| 493. |
Two consecutive transformation t1 and t2 are _________. |
| A. | additive |
| B. | substractive |
| C. | multiplicative |
| D. | none of these |
| Answer» B. substractive | |
| 494. |
Color spectrum consists of__________. |
| A. | 4 colors |
| B. | 6 colors |
| C. | 7 colors |
| D. | 8 colors |
| Answer» D. 8 colors | |
| 495. |
The process of determining the appropriate pixel for representing, picture or graphics objects is knownas___ |
| A. | scan conversion |
| B. | rasterization |
| C. | scanning |
| D. | graphical representation |
| Answer» C. scanning | |
| 496. |
This attribute/field additionaliy used in segment linked list___. |
| A. | colour |
| B. | visibility |
| C. | scalex |
| D. | link |
| Answer» B. visibility | |
| 497. |
______, which posses the portion of overall picture. |
| A. | line |
| B. | pixel |
| C. | segment |
| D. | curves |
| Answer» D. curves | |
| 498. |
become_________. |
| A. | segment start of a particular segment - size of segment to be deleted |
| B. | segment start of particular segment - size of segment start of segment to be deleted. |
| C. | segment start of particular segment - size of next segment |
| D. | none of these |
| Answer» B. segment start of particular segment - size of segment start of segment to be deleted. | |
| 499. |
The intersection of primary CMYK color produces__________. |
| A. | white color |
| B. | black color |
| C. | cyan color |
| D. | magenta color |
| Answer» C. cyan color | |
| 500. |
What are the types of polygon___________. |
| A. | convex polygon |
| B. | concave polygon |
| C. | both a & b |
| D. | none of these |
| Answer» D. none of these | |