Computer Graphics MCQs with answers Page - 13

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 • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. Polygon-Clipping algorithms include the:

  • (A) sutherland-hodgeman method
  • (B) liang-barsky method
  • (C) weiler-atherton method
  • (D) all of above

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. Types of polygon :

  • (A) concave
  • (B) convex
  • (C) complex
  • (D) all of above

A

Admin • 833.24K Points
Coach

Q. Concave and Convex are types of _______

  • (A) circle
  • (B) rectangle
  • (C) polygon
  • (D) ellipse

A

Admin • 833.24K Points
Coach

Q. In convex Polygon all interior angles are

  • (A) less than 90
  • (B) less than 180
  • (C) greater than 180
  • (D) greater than 90

A

Admin • 833.24K Points
Coach

Q. In concave Polygon atleast one interior angle is

  • (A) less than 90
  • (B) less than 180
  • (C) greater than 180
  • (D) greater than 90

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.