Engineering

Computer Graphics MCQs: 287 Questions & Answers in Engineering

287 Computer Graphics MCQs in Engineering with answers & explanations. Page 6. Practice objective questions for competitive exams, interviews & self-assessme… Use the answer toggle below to show or hide all solutions, tap an option to check one question, or open a question for its own page.

Page 6 of 15

Show answers

Answers hidden — tap an option or use “View Answer” on each question.

101

Computer Graphics MCQs: 287 Questions & Answers in Engineering

In ________ operation eliminates objects or portions of objects that are not visible through the window to ensure the proper construction of corresponding image

The region against which an object is clipped is called as ____________

Cohen – Sutherland Line Clipping Algorithm is also called as ____________________

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (200,200). What is the outcode of point (150,50)?

The selection and separation of a part of text or image for further operation are called

The complex graphics operations are

The process of extracting a portion of a database or a picture inside or outside a specified region are called

The rectangle space in which the world definition of region is displayed are called

............. identifies the picture portions that are exterior to the clip window

The region code of a point within the window is ............

According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

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

The region code of a point is 11. The point is in the ................. region of window.

The right bit (R bit)of the region code of a point (X,Y) is '1' if ......................

The left (L bit ) bit of the region code of a point (X,Y) is '1' if ......................

The Most Significant Bit of the region code of a point (X,Y) is '1' if ......................

The bottom bit of the region code of a point is '0' if .......................

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

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

A line with endpoints codes as 0000 and 01 is ?

Study tips for Computer Graphics