Computer Graphics MCQs with answers Page - 10

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. Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111

  • (A) true
  • (B) false
  • (C) cant say
  • (D) none of these

A

Admin • 833.24K Points
Coach

Q. Which one is not valid out code to perform trivial accept / reject test in line clipping

  • (A) 1101
  • (B) 11
  • (C) 101
  • (D) 10

A

Admin • 833.24K Points
Coach

Q. Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?

  • (A) need to perform trivial accept / reject test on end points of the line.
  • (B) need to perform trivial accept / reject test for every point on the line.
  • (C) cannot say
  • (D) none of these

A

Admin • 833.24K Points
Coach

Q. If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle

  • (A) xmin > x < xmax and ymin > y < ymax
  • (B) xmin > x > xmax and ymin > y > ymax
  • (C) xmin < x < xmax and ymin < y < ymax
  • (D) xmin < x > xmax and ymin < y > ymax

A

Admin • 833.24K Points
Coach

Q. determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying the rules

  • (A) p1:clipped away, p2: clipped away, p3:clipped away
  • (B) p1: visible, p2:visible, p3:clipped away
  • (C) p1: visible, p2:visible, p3: visible
  • (D) p1: clipped away, p2:visible, p3:clipped away

A

Admin • 833.24K Points
Coach

Q. Outcode / Region Code used in Line Clipping is of size ____ bits.

  • (A) 4
  • (B) 3
  • (C) 2
  • (D) 1

A

Admin • 833.24K Points
Coach

Q. In Line Clipping algorithm, the two dimensional space is divided into ___ regions.

  • (A) 6
  • (B) 7
  • (C) 9
  • (D) 10

A

Admin • 833.24K Points
Coach

Q. Is 0011 valid region code / outcode used in Line Clipping algorithm?

  • (A) yes
  • (B) no
  • (C) cannot say
  • (D) none of these

A

Admin • 833.24K Points
Coach

Q. Cohen – Sutherland line clipping algorithm was developed in ____

  • (A) 1967
  • (B) 1968
  • (C) 1969
  • (D) 1965

A

Admin • 833.24K Points
Coach

Q. Primitive types of clipping algorithms are

  • (A) point clipping
  • (B) line clipping
  • (C) polygon clipping
  • (D) all of above

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.