Computer Graphics MCQs with answers Page - 12

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. According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

  • (A) the region codes of line endpoints have a 1 in same bit position.
  • (B) the endpoints region code are nonzero values
  • (C) if l bit and r bit are nonzero.
  • (D) the region codes of line endpoints have a in same bit position.

A

Admin • 833.24K Points
Coach

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

A

Admin • 833.24K Points
Coach

Q. The result of logical AND operation with endpoint region codes is a nonzero value. Which of the following statement is true?

  • (A) the line is completely inside the window
  • (B) the line is completely outside the window
  • (C) the line is partially inside the window
  • (D) the line is already clipped

A

Admin • 833.24K Points
Coach

Q. The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part (viewport) is visible.

  • (A) cohen-sutherland
  • (B) liang barsky
  • (C) sutherland hodegeman
  • (D) none of these

A

Admin • 833.24K Points
Coach

Q. Sutherland Hodgeman algorithm works well for...........

  • (A) concave polygons
  • (B) convex polygons
  • (C) smooth curves
  • (D) line segments

A

Admin • 833.24K Points
Coach

Q. A line with endpoints codes as 0000 and 01 is ?

  • (A) partially invisible
  • (B) completely visible
  • (C) completely invisible
  • (D) trivially invisible

A

Admin • 833.24K Points
Coach

Q. In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the ?

  • (A) codes of the end point are same
  • (B) logical or of the end points code is 0000
  • (C) logical and of the end point code is 0000
  • (D) only a

A

Admin • 833.24K Points
Coach

Q. Sutherland – Hodgman algorithm is used for _______________.

  • (A) line clipping
  • (B) polygon clipping
  • (C) point clipping
  • (D) hybrid clipping

A

Admin • 833.24K Points
Coach

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

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

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.