computer-graphics-mcqs - Set (5)

Correct Answer: Orange && Worng Answer: Red

1. DDA stands for :

  • (A). Digital differential analyzer
  • (B). Digital data analyzer
  • (C). Discrete data analyzer
  • (D). Discrete differential analyzer
  • View Answer

    Explanation: Not Avilable

    2. Disadvantage of DDA is :

  • (A). Round of error
  • (B). Subtraction error
  • (C). Addition error
  • (D). Both (a) and (b)
  • View Answer

    Explanation: Not Avilable

    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
  • (C). Y+1 or Y-1
  • (D). Y or Y-1
  • View Answer

    Explanation: Not Avilable

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

  • (A). Straight line
  • (B). Curve line
  • (C). Polygon
  • (D). None of these
  • View Answer

    Explanation: Not Avilable

    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
  • (C). It eliminates rounding operation
  • (D). None of these
  • View Answer

    Explanation: Not Avilable

    6. In circle drawing algorithm we use –

  • (A). 4 Symmetry
  • (B). 2 Symmetry
  • (C). 8 Symmetry
  • (D). No Symmetry
  • View Answer

    Explanation: Not Avilable

    7. Clipping algorithm are

  • (A). Two or three dimensional
  • (B). Two dimensional
  • (C). Three dimensional
  • (D). None of these
  • View Answer

    Explanation: Not Avilable

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

  • (A). It does not require floating point arithmentic
  • (B). No round-up is required
  • (C). Both (a) and (b)
  • (D). It is eassily computable
  • View Answer

    Explanation: Not Avilable

    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
  • (C). T2S2=T1S1
  • (D). S1T1=T2S1
  • View Answer

    Explanation: Not Avilable

    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
  • (C). P(t) = P0-(P1-P0)t
  • (D). P(t) = P0-(P1+P0)t
  • View Answer

    Explanation: Not Avilable

    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
  • (C). First three control points
  • (D). All four control points
  • View Answer

    Explanation: Not Avilable

    12. Z-buffer algorithm is used for :

  • (A). Frame buffer removal
  • (B). Hidden line removal
  • (C). Rendering
  • (D). Animation
  • View Answer

    Explanation: Not Avilable

    13. Sutherland Hodgemon algorithm is used for :

  • (A). Line clipping
  • (B). Point clipping
  • (C). Polygon clipping
  • (D). Hybrid clipping
  • View Answer

    Explanation: Not Avilable

    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
  • (C). X+1
  • (D). X+2
  • View Answer

    Explanation: Not Avilable

    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
  • (C). We find on which sides of the line the midpoint lies
  • (D). Both (a) and (b)
  • View Answer

    Explanation: Not Avilable