Computer Graphics MCQ Questions and Answers

1. DDA stands for :

(A) Digital differential analyzer

(B) Digital data analyzer

(D) Discrete differential analyzer

Answer : A

2. Disadvantage of DDA is :

(A) Round of error

(B) Subtraction error

(D) Both (a) and (b)

Answer : A

3. In Brasenham’s circle generation algorithm if(x,y) is the current pixel position then y-value of the next pixel position is :

(A) Y or Y+1

(B) Y alone

(D) Y or Y-1

Answer : C

4. Brasenham’s algorithm seeks to select the optimum raster locations that represent a :

(A) Straight line

(B) Curve line

(D) None of these

Answer : A

5. The DDA algorithm is a faster method for calculating pixel positions than direct use of line equation using y=mx+c because

(A) It eliminates floating point addition

(B) It eliminates floating point multiplication

(D) None of these

Answer : B

Computer Graphics MCQ

6. In circle drawing algorithm we use –

(A) 4 Symmetry

(B) 2 Symmetry

(D) No Symmetry

Answer : C

7. Clipping algorithm are

(A) Two or three dimensional

(B) Two dimensional

(D) None of these

Answer : A

8. Bresenham’s line drawing is superior then DDA because

(A) It does not require floating point arithmentic

(B) No round-up is required

(D) It is eassily computable

Answer : C

9. In 2D graphics, if S1 & S2 are two scaling matrix and T1 and T2 are two transition matrices then

(A) S1S2=S2S1

(B) S1T1=S2T2

(D) S1T1=T2S1

Answer : A

10. Parametric equation of straight line (where 0≤ t ≤1)is :

(A) P(t) = P0+(P1+P0)t

(B) P(t) = P0+(P1-P0)t

(D) P(t) = P0-(P1+P0)t

Answer : A

Computer Graphics MCQ

11. The slope of the Bezier curve at the starting of the curve is controlled by :

(A) First control point

(B) First two control points

(D) All four control points

Answer : C

12. Z-buffer algorithm is used for :

(A) Frame buffer removal

(B) Hidden line removal

(D) Animation

Answer : B

13. Sutherland Hodgemon algorithm is used for :

(A) Line clipping

(B) Point clipping

(D) Hybrid clipping

Answer : C

14. In Bresenham’s circle generation algorithms if (x,y) is the current pixel position then the x-value of the next pixel position is :

(A) X

(B) X-1

(D) X+2

Answer : C

15. The basic principle of Bresenham’s line algorithm is _____

(A) To select optimum raster location

(B) To select either ^x or ^y whichever is larger

(D) Both (a) and (b)

Answer : A

« 1 2 3 4 5 6 7 8 9 10 »

Computer Graphics MCQ-4

1. DDA stands for :

2. Disadvantage of DDA is :

3. In Brasenham’s circle generation algorithm if(x,y) is the current pixel position then y-value of the next pixel position is :

4. Brasenham’s algorithm seeks to select the optimum raster locations that represent a :

5. The DDA algorithm is a faster method for calculating pixel positions than direct use of line equation using y=mx+c because

Computer Graphics MCQ

6. In circle drawing algorithm we use –

7. Clipping algorithm are

8. Bresenham’s line drawing is superior then DDA because

9. In 2D graphics, if S1 & S2 are two scaling matrix and T1 and T2 are two transition matrices then

10. Parametric equation of straight line (where 0≤ t ≤1)is :

Computer Graphics MCQ

11. The slope of the Bezier curve at the starting of the curve is controlled by :

12. Z-buffer algorithm is used for :

13. Sutherland Hodgemon algorithm is used for :

14. In Bresenham’s circle generation algorithms if (x,y) is the current pixel position then the x-value of the next pixel position is :

15. The basic principle of Bresenham’s line algorithm is _____

Related Links

Leave a Comment Cancel Reply