The document contains a multiple choice quiz about computer graphics algorithms with 8 questions. The questions cover topics like the Cartesian slope-intercept equation, how lines are plotted on raster systems, the expansion of the Digital Difference Analyzer (DDA) line algorithm, faster methods for calculating pixel positions, the disadvantages of DDA, accurate line-generating algorithms, applying the midpoint method, and the definition of a circle. The document provides the question, possible answers, and slide number references for each question.
The document contains a multiple choice quiz about computer graphics algorithms with 8 questions. The questions cover topics like the Cartesian slope-intercept equation, how lines are plotted on raster systems, the expansion of the Digital Difference Analyzer (DDA) line algorithm, faster methods for calculating pixel positions, the disadvantages of DDA, accurate line-generating algorithms, applying the midpoint method, and the definition of a circle. The document provides the question, possible answers, and slide number references for each question.
The document contains a multiple choice quiz about computer graphics algorithms with 8 questions. The questions cover topics like the Cartesian slope-intercept equation, how lines are plotted on raster systems, the expansion of the Digital Difference Analyzer (DDA) line algorithm, faster methods for calculating pixel positions, the disadvantages of DDA, accurate line-generating algorithms, applying the midpoint method, and the definition of a circle. The document provides the question, possible answers, and slide number references for each question.
1- The Cartesian slope-intercept equation for a straight line is
a. y = m.x + b b. y = b.x + m c. y = x.x + m d. y = b + m.m 11 المحاضرة الثانية ساليد رقم 2- On raster system, lines are plotted with a. Lines b. Dots c. Pixels d. None of the mentioned
3- Expansion of line DDA algorithm is
a. Digital difference analyzer b. Direct differential analyzer c. Digital differential analyzer d. Data differential analyzer 11 المحاضرة الثانية ساليد رقم 4- Which algorithm is a faster method for calculating pixel positions? a. Bresenham’s line algorithm b. Parallel line algorithm c. Mid-point algorithm d. DDA line algorithm 33 المحاضرة الثالثة ساليد 5- The disadvantage of lineDDA is a. Time consuming b. Faster c. Neither a nor b d. None of the mentioned 33 المحاضرة الثالثة ساليد 6- An accurate and efficient raster line-generating algorithm is a. DDA algorithm b. Mid-point algorithm c. Parallel line algorithm d. Bresenham’s line algorithm 33 المحاضرة الثالثة ساليد 7- To apply the midpoint method, we define a. Circle (x, y) = x 2+ y 2- r2 b. Circle (x, y) = x+ y 2- r2 c. Circle (x, y) = x 2– y 2- r2 d. Circle (x, y) = x2+ y 2- z2 5 المحاضرة الرابعه ساليد رقم 8- _______ is defined as set of points such that the sum of the distances is same for all points. a. Ellipses b. Lines c. Circles d. Only a 4 المحاضرة الخامسة ساليد رقم