Computer Graphics
IMP MCQ
1. The basic geometric structures provided by graphics primitive packages are referred to as ____________.
A) inputs
B) input primitives
C) outputs
D) output primitives
2. ____________ and ____________ are the basic output primitives.
A) Points, lines segments
B) Points, circles
C) Line segments, Curves
D) Circles, polygons
3. _______________ is the fundamental element of the picture representation.
A) Line segment
B) Point
C) Circle
) Polygon
4. Minimum ____________ points are required to represent a line.
A) two
B) three
C) four
D) none of these
5. The equation of a line in slope intercept form is given as _____________.
A) x = my + b
B) y + b = mx
C) y = mx + b
D) b = mx + y 6.
6.In a equation of a line, y = mx + b, b is ______________.
A) Slope of a line
B) constant
C) the height at which the line crosses the x-axis
D) the height at which the line crosses the y-axis
7. When we say a line, it ____________
A) extends forward
B) extends backward
C) ends at two points
D) extends forever both forward and backward
8. If two lines are parallel, they have ____________ slope.
A) different
B) zero
C) same
D) none of these
9. The multiplication of a vector and the reciprocal of its length is equal to __________________.
A) zero
B) one
) Can’t define
D) none of these
10. The process of turning on the pixels for a line segment is called _______________.
A) vector generation
B) line generation
C) pixel generation
D) (a) or (b)
11. The line drawn using line drawing algorithm should be displayed with ____________ brightness.
A) varying
B) constant
C) minimum
D) maximum
12. The width of 45o line drawn by line drawing algorithm is __________.
A) constant
B) not constant
C) minimum
D) maximum
13. The end point accuracy of DDA line drawing algorithm is ____________.
A) good
B) better
C) best
D) poor
14. Floating point arithmetic in DDA algorithm is ______________.
A) Time efficient
B) time consuming
C) fast
D) slow
15. DDA line drawing algorithm for calculating pixel positions is ____________ the direct use of equation y = mx+b.
A) slower than
B) faster than
C) of equal speed to that of
D) none of these
16. Algorithms those use the outputs of the previous iteration, in the computation of outputs in the current iteration are called _____________algorithms.
A) successive approximation
B) incremental
C) double refreshing
D) scan-line
17. The advantage of Bresenham’s algorithm over conventional DDA algorithm is ________________?
A) no rounding operation
B) use of integer addition and subtraction
C) producing smooth appearance
D) less number of iterations
18. In one octant of the circle is generated, to complete the generation of full circle, how many reflections are required?
A) 1
B) 2
C) 4
D) 8
19. The best line drawing algorithm among all possible line drawing algorithms is ________________.
A) DDA
B) Algorithm which uses direct equation of line
C) Bresenham’s algorithm
D) None of these
20. The value of initial decision parameter in Bresenham’s line drawing lgorithm for |m| < 1 is ______________.
A) 2∆𝒚− ∆𝒙
B) 2∆𝑦 + ∆𝑥
C) -2∆𝑦 +∆𝑥
D) -2∆𝑦 − ∆𝑥
21. The value of initial decision parameter in mid point circle drawing algorithm is ______________.
A) 3 − 2r
B) 5/4 − r
C) 1 − 2r
D) 3-3
22. Points P1(3.2, 7.8) and P2(3.7, 7.1) are both represented by pixel _____________.
A) (3, 8)
B) (4, 7)
C) (3, 7)
D) (4, 8)
23. Pixel phasing is an anti-aliasing technique based on _____________.
A) hardware
B) software
C) both hardware and software
D) none of these
24. The anti-aliasing technique which allows shift of ¼, ½ and ¾ of a pixel diameter enabling a closer path of a line is ________.
A) pixel phasing
B) filtering
C) intensity compensation
D) sampling technique
26. Pixel phasing is a technique for _____________.
A) shading
B) anti-aliasing
C) hidden line control
D) none of these
27. A line connecting the points (1, 1) and (5, 3) is to be drawn, using the DDA algorithm. Find the values 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 these
28. Which of the following algorithms can be used for circle generation?
A) Bresenham’s algorithm
B) Midpoint algorithm
C) Both (a) and (b)
D) none of these
29. Aliasing means ____________.
A) Rendering effect
B) Shading effect
C) Staircase effect
D) Cueing effect
30. Slope of the line joining the points (1, 2) and (3, 4) is _____________.
A) 0
B) 1
C) 2
D) 3
31. ____________is a global character set that enables information from any language to be stored using a single character set.
A) Gcode
B) Unicode
C) Mcode
D) Globalcode
32. ____________ provides a unique code value for every character, regardless of the platform, program or language.
A) Gcode
B) Unicode
C) Mcode
D) Globalcode
33. ____________ uses 8-bit encoding.
A) UTF-8
B) UCS-2
C) UTF-16
D) none of these
34. ____________ uses 16-bit encoding.
A) UTF-8
B) UCS-2
C) UTF-16
D) both (b) and (c)
35. ____________ uses variable-width encoding.
A) UTF-8
B) UCS-2
C) UTF-16
D) both (b) and (c)
