Computer Graphics MCQs with answers Page - 6

Here, you will find a collection of MCQ questions on Computer Graphics. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 831.35K Points
Coach

Q. Winding number method always gives correct answer for overlapping polygons

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. Inside tests of polygon are useful in --------

  • (A) polygon filling
  • (B) line coloring
  • (C) shadowing
  • (D) none of the above

A

Admin • 831.35K Points
Coach

Q. Even-odd method of inside test counts ----- to decide the position of a point.

  • (A) edges
  • (B) vertices
  • (C) intersections
  • (D) pixels

A

Admin • 831.35K Points
Coach

Q. In winding number method an ------------------ edges ------ considered

  • (A) horizontal , not
  • (B) vertical , not
  • (C) slanted , not
  • (D) horizontal , is

A

Admin • 831.35K Points
Coach

Q. Even-odd method of inside test is suitable for------

  • (A) polygons
  • (B) circles
  • (C) lines
  • (D) all of above

A

Admin • 831.35K Points
Coach

Q. In winding number method an edge can have winding number as -----

  • (A) zero
  • (B) +1 or -1
  • (C) only +1
  • (D) only -1

A

Admin • 831.35K Points
Coach

Q. 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

A

Admin • 831.35K Points
Coach

Q. 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

A

Admin • 831.35K Points
Coach

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

  • (A) area fill
  • (B) boundary fill.
  • (C) line fill.
  • (D) scan fill.

A

Admin • 831.35K Points
Coach

Q. In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels.

  • (A) 8
  • (B) 4
  • (C) 2
  • (D) 16

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.