Cohen-Sutherland Line Clipping MCQ

Test your knowledge with important Cohen-Sutherland Line Clipping MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Cohen-Sutherland Line Clipping MCQs on Bissoy. Bissoy App

• The logical ______ of the endpoint codes determines if the line is completely inside the window.
  ক

  AND

  খ

  OR

  গ

  NOT

  ঘ

  NOR
• If the logical AND of the endpoint codes is NOT zero, the line can be trivially accepted.
  ক

  True

  খ

  False
• The 4-bit code of bottom-right region of the window is ____________
  ক

  1001

  খ

  0101

  গ

  1010

  ঘ

  0110
• The 4-bit code of top-left region of the window is ____________
  ক

  1001

  খ

  1100

  গ

  0101

  ঘ

  1010
• If both codes are 0000, (bitwise OR of the codes yields 0000) line lies __________________ the window.
  ক

  completely outside

  খ

  half inside half outside

  গ

  completely inside

  ঘ

  can’t say anything
• The Cohen–Sutherland algorithm can be only be used on a rectangular clip window.
  ক

  True

  খ

  False
• The centre region of the screen and the window can be represented as________
  ক

  0000

  খ

  1111

  গ

  0110

  ঘ

  1001
• An outcode can have ____ bits for two-dimensional clipping and ____ bits for three-dimensional clipping.
  ক

  4,6

  খ

  6,8

  গ

  2,4

  ঘ

  1,3
• What is the name of the small integer which holds a bit for the result of every plane test?
  ক

  setcode

  খ

  outcode

  গ

  incode

  ঘ

  bitcode
• The Cohen-Sutherland algorithm divides the region into _____ number of spaces.
  ক

  8

  খ

  6

  গ

  7

  ঘ

  9
• Cohen-Sutherland clipping is an example of _________________
  ক

  polygon clipping

  খ

  text clipping

  গ

  line clipping

  ঘ

  curve clipping