McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Electronics and Communication Engineering .
| 1. |
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» A. inside | |
| 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 |
| Answer» B. odd | |
| 3. |
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» A. inside | |
| 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 |
| Answer» A. even number | |
| 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 |
| Answer» A. same | |
| 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. |
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» 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 |
| Answer» A. even-odd 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 |
| Answer» A. winding 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. |
| Answer» C. net winding. | |
| 11. |
Winding number method always gives correct answer for overlapping polygons |
| A. | true |
| B. | false |
| Answer» B. false | |
| 12. |
Inside tests of polygon are useful in -------- |
| A. | polygon filling |
| B. | line coloring |
| C. | shadowing |
| D. | none of the above |
| Answer» A. polygon filling | |
| 13. |
Even-odd method of inside test counts ----- to decide the position of a point. |
| A. | edges |
| B. | vertices |
| C. | intersections |
| D. | pixels |
| Answer» C. intersections | |
| 14. |
In winding number method an ------------------ edges ------ considered |
| A. | horizontal , not |
| B. | vertical , not |
| C. | slanted , not |
| D. | horizontal , is |
| Answer» A. horizontal , not | |
| 15. |
Even-odd method of inside test is suitable for------ |
| A. | polygons |
| B. | circles |
| C. | lines |
| D. | all of above |
| Answer» A. polygons | |
| 16. |
In winding number method an edge can have winding number as ----- |
| A. | zero |
| B. | +1 or -1 |
| C. | only +1 |
| D. | only -1 |
| Answer» B. +1 or -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 |
| Answer» B. boundary fill algorithm | |
| 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 |
| Answer» A. flood fill algorithm | |
| 19. |
___________ procedure accepts the coordinates of an internal point. |
| A. | area fill |
| B. | boundary fill. |
| C. | line fill. |
| D. | scan fill. |
| Answer» B. boundary fill. | |
| 20. |
In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels. |
| A. | 8 |
| B. | 4 |
| C. | 2 |
| D. | 16 |
| Answer» A. 8 | |
| 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 |
| Answer» 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 |
| Answer» A. an interior pixel | |
| 24. |
In Boundary Fill method ____________ Data Structure is used. |
| A. | stack |
| B. | array |
| C. | heap |
| D. | none of above |
| Answer» A. stack | |
| 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 |
| Answer» D. all of above | |
| 26. |
In --------------algorithm edges can be specified in different color. |
| A. | flood fill |
| B. | boundary fill |
| C. | dda fill |
| D. | bsa fill |
| Answer» A. flood 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 |
| Answer» A. polygon filling | |
| 28. |
Boundary fill algorithm uses -------- call to the fill function. |
| A. | recursive |
| B. | static |
| C. | one |
| D. | none of these |
| Answer» A. recursive | |
| 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. |
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» A. boundary fill | |
| 31. |
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» A. flood fill | |
| 32. |
Horizontal lines are not considered in scan line fill algorithm. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 33. |
Scan line fill algorithm is more efficient than flood fill algorithm. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 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. |
| Answer» A. 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 |
| Answer» B. scan-line polygon | |
| 42. |
Active edge table is used in following algorithm |
| A. | boundary fill |
| B. | region fill |
| C. | scan line |
| D. | edge fill |
| Answer» C. scan line | |
| 43. |
Scan line polygon filling algorithm uses series of ……………. To fill the polygon. |
| A. | scan lines |
| B. | points |
| C. | layers |
| D. | none of above |
| Answer» A. scan lines | |
| 44. |
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» A. y 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 |
| C. | is discarded |
| D. | is added. |
| Answer» A. becomes inactive | |
| 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 |
| Answer» A. active edges | |
| 47. |
Scan line Fill Approach works at the |
| A. | color level |
| B. | edge level |
| C. | polygon level |
| D. | pixel level |
| Answer» C. polygon 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. |
Scan line polygon filling algorithm can be used for filling Convex polygon. |
| A. | true |
| B. | false |
| C. | cant say |
| D. | none of these |
| Answer» A. true | |
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.