CG (MCQs): Nov 02, 2020

    

SRI LAKSHMI COLLEGE OF ARTS AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE

III B. Sc., (CS)

COMPUTER GRAPHICS (BECS54B) – MCQs – Nov 02, 2020

CG-MCQ5

(01) A rectangle is bound by the lines x = 0; y = 0; x = 5 and y = 3.

The line segment joining (-1, 0) and (4, 5), if clipped against this window will connect the points

(A) (0, 1) and (3,3)                                                     (B) (0,1) and (2,3)

(C) (0, 1) and (4, 5)                                                    (D) none of the above

(02) A line connecting the points (1, 1) and (5,3) is to be drawn, using the DDA algorithm. Find the value of x and y increments.

(A) x-increment = 1 ; y-increment = 1 (B) x-increment = 0.5; y-increment = 1

(C) x-increment = 1 ; y-increment = 0.5 (D) none of the above

(03) Computer Graphics was first used by

(A) William Fetter in 1960                                        (B) James Gosling in 1991

(C) James Taylor in 1980                                                     (D) Williamson in 1970

(04) Which of the following is a Polygon Clipping?

(A) Point Clipping                                                                 (B) Line Clipping

(C) Area Clipping                                                                 (D) Curve Clipping

(05) Which of the following is correct?

(A) Cohen - Sutherland Line Clipping Algorithm uses the parametric equation of a line

(B) Liang - Barsky Line Clipping Algorithm is significantly more efficient than Cohen - Sutherland Line Clipping

(C) Cohen - Sutherland Line Clipping Algorithm takes larger time to calculate the end-points

(D) Liang - Barsky Line Clipping Algorithm do less testing before computing line intersections

<<<<<ANSWERS WILL BE GIVEN TOMORROW>>>>>

Answers for Oct 31, 2020 (CG – MCQ4)

(01) A                   (02) D                   (03) B         (04) B         (05) B