Techno India Batanagar
Computer Science and Engineering
Model Questions
Subject Name: Computer Graphics Subject Code: 604 B
Multiple Choice Questions
1. In Bresenham’s circle generation algorithm, if (x,y) is the current pixel position then the 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
2. Tablet is
a) logical interactive device b) data generation device
b) c) physical interactive device d) none of these
3. Bresenham’s Algorithm seeks to select the optimum raster locations that represent a
a) Straight line b) curve line c) polygon d) none of these
4. According to simple Area Arid aliasing, pixel is considered as
a) a mathematical point b) a finite area c) an infinite area d)none of these
5. The reflection matrix of a point P(x,y) about the straight line y = -x is
a) b) c) d)
-1 0 0 -1 -1 0 -1 0
0 -1 -1 0 -1 0 0 -1
6. 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 that drift away from true line path d) none of these
7. In Bresenham’s circle algorithm, if points are generated from 900 to 450 and (x,y) are the
Coordinate of last scan converted pixel then the next pixel coordinate is
a) (x+1,y+1)or(x-1,y-1) b) (x+1,y)or(x,y+1)
c) (x,y+1)or(x+1,y-1) d) (x+1,y)or(x+1,y-1)
8. Aliasing means
a) Rendering effect b) Shading effect c) Staircase effect d) Cueing effect
9. The technique of using a minimum number of intensity levels to obtain increased visual
resolution is
a) Dithering b)Half toning c)Depth-Cueing d)Rendering
10. A raster colour display processor supports a resolution of 1024 * 800 with up to 16 million
colours simultaneously displayable. What will be the approximate size(in bytes)of the frame
buffer used in the display processer?
a)1.2*106 b)2.4*106 c)16*106 d)105
11. If blue is represented as 001 the yellow is represented as
a) 001 b) 010 c) 101 d) 110
12. A 24-bit plane colour frame butter with three 10-bit wide colour look up tables can have
………….number of colours.
a) 224 b) 28 c) 248 d) 230
13. ________________________acts as anode in CRT.
a) The phosphorous coating b) The glass panel c) The deflectors d) None of these
14. Slope of the line joining the points (1, 2) and (3, 4) is
a) 0 b) 1 c) 2 d) 3
15. 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
16. Run length coding is used for
a) Image smoothening b) Image compression
c) Image colouring. d) Image dithering
17. Which device is used to grasp a ‘virtual object’?
a) Space ball b) Data glove c) Digitizer d) Touch panels
18. Resolution can be defined by
a) Number of component b) Number of small square boxes
c) Number of pixels d) Number of pixels per unit length
19. The video memory that is used to hold the image displayed on screen is known as
a) Display processor b) LUT c) Frame buffer d) Display file
20. The maximum number of dots that can be displayed without overlap on CRT is referred to as
a) Refresh rate b) Interlacing c) Screen resolution d) None of these
21. Raster means
a) Series of parallel lines b) Series of parallel blocks
c) Series of parallel medium d) Series of parallel sweeps
22. Physical Aspect Ratio is termed as
a) Ratio of width of the frame to its height b) Ratio of width of pixel to its height
c) Ratio of width of block to its height d) all of these
23. Flood fill algorithm cannot be applied if
a) More than one boundary colour b) More than one interior colour
c) Single boundary colour d) Single interior colour
24. In order to avoid Flicker in monitor having low refresh rate the techniques used is
a) Refreshing b) Vertical refreshing
c) Interfacing d) horizontal refreshing
25. Colour printer use
a) RGB colour model b) CMYK colour model
c) HSB colour model d) LAB colour model
26. In circle drawing algorithm we use
a) 4-Symmetry b) 2-Symmetry c) 8-Symmetry d) No Symmetry
27. CMY coordinates of a colour at (0.2, 1, and 0.5) in the RGB space are
a) (1.2,2,1.5) b) (2.2,2,2.5) c) (0.8,0,0.5) d) (0.1,0.5,0.25)
28. In raster scanning system, the screen is scanned
a) Top to bottom and right to left b) Left to right and top to bottom
c) Bottom to top and left to right d) Bottom to top and right to left
29. The term that is not synonymous with ‘vector CRT’ is
a) Calligraphic CRT b) Raster CRT
c) Stroke-writing CRT d) Random-scan CRT
30. A monitor can display 4 shades of red, 8 shades of blue and 16 shades of green. The colour
depth supported by the monitor is
a) 7 bits b) 8 bits c) 9 bits d) 10 bits
31. For the scan-line polygon fill algorithm, each horizontal edge should be
a) Ignored
b) Treated as a single intersection point
c) Treated as two intersection points
d) Treated as one or two intersection point, depending on the adjacent vertices
32. Line end point codes of 4 lines are given below. Which one of the following is totally
invisible?
a) 1010, 0110 b) 0000, 0000 c) 1001, 0000 d) 0001, 0100
33. Under a parallel projection, the point (2, 3,-1) has been viewed at (3, 3, 0), then the direction
of projection should be the vector
a)(1,0,1) b(1,0,-1) c)(0,1,1) d)(0,-1,1)
34. If (x,y,w), w= 0 , is a point in the homogeneous coordinate system than its equivalent in the
two dimensional system is
a)(x,y,1) b)(x,y,0) c)(x/w,y/w) d)(x,y, x-y)
35. An object is viewed by using perspective transformation. The maximum number of principal
vanishing point(s) possible is
a) b)2 c)3 d) Infinite
36.In the Cohen Sutherland line clipping algorithm, if the codes of the two point P&Q are 0101
& 0001 then the line segment joining the points P&Q will be __________ the clipping
window.
a) Totally outside b) Partially outside
c) Totally inside d) None of these
37. Clipping algorithms are
a) Two or three dimensional b) Two dimensional
c)Three dimensional d)None of these
38. When the angle between the projectors and the plane of projection is not equal to 900 then
the projection is
a) Orthographic b) Isometric
c) Perspective d) Oblique
39. Sutherland-Hodgeman algorithm is used for
a) Line clipping b) Point clipping
c) Polygon clipping d) Hybrid clipping
40. Clipping algorithms are
a) Two or three dimensional b) two dimensional
c) Remain parallel d) become circular arcs
41. after arbitrary 2D transformation, a pair of parallel lines
a) Become intersecting b) Become coincident
c) Remain parallel d) Become circular arcs
42. The matrix representation of reflection about y = -x is
1 0 0 -1 0 0 0 1 0 0 -1 0
a) 0 -1 0 b) 0 1 0 c) 1 0 0 d) -1 0 0
0 0 1 0 0 1 0 0 1 0 0 1
43. In view-port clipping of 3D viewing, the region code contains __________number of bits.
a) 6 b) 4 c) 5 d) 7
44. If (x,y,h), h 0, is a point in the homogeneous co-ordinate system then its equivalent in
the two dimension system is
a) (x,y,1) b) (x,y,0) c) (x/h, y/h) d) (x,y, x+y)
45. When projection lines are perpendicular to the view plane then such type of projection is
called
a) Parallel b) Perspective c) Orthographic d) Oblique
46. The orthographic projections have the projectors where
a) The direction of these projectors is parallel to the view plane
b) The direction of these projectors is perpendicular to the image plane
c) The direction of these projectors is perpendicular to the view plane
d) The direction of these projectors is parallel to the image plane
47. The viewing transformation is formed by
a) Translations b) Translation and scaling
c) Translation, scaling and reflection d) Translation, scaling and rotation
48. The slope of the Bezier curve at start of the curve of is controlled by
a) First control point b) First two control points
c) First three control points d) All four control points
49. Two curves are said to be connected at a point with first order continuity if
a) Both curves simply meet at that point
b) The tangents to both the curves at that point is equal
c) The curvatures to both the curves at that point is equal
d) There is a discontinuity of both the curves at that point
50. The best hidden surface removal method(s) used for complex scenes with more than a few
thousand surfaces is/are
a) Depth sorting method b) Scan line algorithm
c) Depth buffer algorithm d) Octree method
51. Z-buffer algorithm is used for
a) Frame buffer removal b) Hidden line removal
c) Rendering d) Animation
52. A Bezier cubic curve with control points P0, P1, P2 and P3 is defined by the equation
𝑓(𝑢) = 𝑃𝑖 𝐵𝑖3 (𝑢), 𝐵23 is
a)(1-u)3 b)u3 c)3u(1-u)2 d)3u(1-u)
53. 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
54. Which of the following is not a hidden surface removal algorithm?
a) Depth sort b) painter’s algorithm
c) Z-buffer d) none of these
55. The blinding functions of Bezier curves are
a) Splines b) Bernstein polynomials
c) Lagrangian polynomials d) Newton polynomials
56. Quantization is done by
a) Before sampling b) After sampling
c) Simultaneously d) None of these
57. Onion skinning technique used in
a) Audio compression b) Video compression
c) Animation d) None of these
58. Which one is the Compression Technique?
a) Hoffman b) DES c) DFS d) None of these
59. How many channels are specified by MIDI standards?
a) 16 b) 24 c) 32 d) none of these
60. In which type of compression l-frame is used?
a)JPEG b)MPEG c)GIF d)none of these
61. How many reception modes are present in MIDI standards?
a) 4 b) 8 c) 6 d) none of these
62. The amount of memory in frame buffer is called
a) Bit plane b) plane c) bit d) none of these
63. Another name of super sampling is
a) Post filtering b) aliasing
c) anti-aliasing d) none of these
64. The format for storing digital audio in multimedia applications is
a)JPEG b)TIFF c)WAV d)BMP
65. Lossy image simplification is based on ____________operation.
a ) DCT b)CCI c)ISO d)DMS
66. The animator creates the illusion of smooth motion by
a)onion skinning b)masking c)tweening d)color cycling
67. Entropy encoding is
a) run length encoding b)lossless encoding
c)lossy encoding d)both(b)&(c)
68. Intensity ratio of Red(R) Green(G)and Blue(B) in Gray axis is
a)1:2:1 b)1:1:1 c)2:1:1 d)1:1:2
69. DAC means
a) direct access coding b)digitally activated compression
c) direct area clipping d)digital to analog converter
70. If XL,XR,YB,YT represent the four parameter of x-left , x-right , y-bottom and y-top of the
clipping window and (x,y)is a point inside the window then
a)𝑋𝐿 ≤ 𝑥 ≤ 𝑋𝑅 𝑎𝑛𝑑 𝑌𝐵 ≤ 𝑦 ≤ 𝑌𝑇 b) 𝑋𝐿 ≤ 𝑥 ≤ 𝑋𝑅 𝑎𝑛𝑑 𝑌𝐵 ≥ 𝑦 ≥ 𝑌𝑇
c) 𝑋𝐿 ≥ 𝑥 ≥ 𝑋𝑅 𝑎𝑛𝑑 𝑌𝐵 ≤ 𝑦 ≤ 𝑌𝑇 d) 𝑋𝐿 ≥ 𝑥 ≥ 𝑋𝑅 𝑎𝑛𝑑 𝑌𝐵 ≥ 𝑦 ≥ 𝑌𝑇
71. A line with end point codes as 0000 and 0000 is
a)partially invisible b)completely visible
c)trivially visible d)completely invisible
72.A projection in which all three foreshortening factors are kept equal is called as
a) Isometric projection b) diametric projection
c) Trimetric projection d) none of these
73.Using odd parity rule ,if the number of polygon edges crossed by a line , from a point is
odd ,then
a) P is an exterior point b)P is interior point
c)P is on the edge point d)odd parity-rule along is not sufficient to judge
74. if Sx and Sy are scaling factors applied in X and Y directions respectively , on p (x,y),the
output point co-ordinates after applying scaling operation is
a) x1=1/x.Sx, y1=y.Sy b)x1=x+Sx,y1=y+Sy
c) x1=x.Sx, y1=1/y.Sy d)x1=x.Sx,y1=y.Sy
75. Perspective projection is characterized by the
a) View plane alone b) direction of projection and the view plane
c) Centre of projection and the view plane d) centre of projection alone
76. Achromatic light is
a) Quantity of light b) Quantity of colour
c) Quantity of darkness d) Quantity of shading
77. The memory area which holds a set intensity values for all the screen points is
a) Frame buffer b) refresh RAM
c) Video cache d) RAM
78. Bresenham’s algorithm seeks to the optimum raster location that represent a
a)straight line b)curve line c)polygon d)none of these
79. According to Simple area anti-aliasing ,pixel is considered as
a)a mathematical point b)a finite area
c)an infinite area d)none of these
80. Bresenham’s line drawing is superior then DDA because
a) It does not require floating point arithmetic b) No round -up is required
c) Both (a) & (b) d) it is easily computable
81. Minimum memory required for frame buffer when resolution is 800×600 and bit/pixel is
8.
a)512 kb b)1 Mb c)2 Mb d)256 kb
82. Disadvantage of DDA is
a) Round of error b) Subtraction error c) Addition error d)(a),(b)
83. The method super sampling is associated with
a) Boundary fills algorithm b) Ground shading
c) Antialiasing d) none of these
84. Refreshing on raster scan displays is carried out at the rate of
a) 60 to 80 frames per sec b) 40 to 60 frames per sec
c) 30 to 60 frames per sec d) none of these
85. The maximum number of points that can be displayed without overlap on CRT is
referred to as
a)Resolution b)Persistence c)Attenuation d)None of these
86. Size of a 640×480 image at 240 pixels per inch is
a) 2 by 2 inches b) 2*2/3 by 2 inches c) 3 by 2 inches d)none of these
87. What do you call the path the electron beam taken at the end of each refresh cycle?
a) Horizontal retraces b) vertical retrace
c) Diagonal retrace d) none of these
88. Which is not image file format?
a) bmp b)jpg c)tiff d) Both(a)&(b)
89. Raster scan display means that the screen is scanned
a) Top to bottom and right to left b) left to right & top to bottom
c) Bottom to top and left to right d) bottom to top and right to left
90. Dragging in computer graphics can be achieved through which of the following
transformation?
a) translation b)rotation c)scaling d)mirror reflection
91. GIF supports
a) 256 colours b) 572 colours c) 1024 colours d) 16 million colours
92. IF the resolution of a number is 320×200 then the aspect ratio is
a)8:5 b)3:13 c)13:4 d)all of these
93. In the Bresenham’s algorithm, error term initialised to
a) 0 b) 1 c)-1/2 d) none of these
94. In the generation of circle by Bresenham’s algorithm, it is simple to generate
a) All octants
b) one octants first and other by successive reflection
c) one octants first and other by successive rotation
d) one octants first and other by successive translation
95. Mid -point line and circle drawing algorithm use the sign of
a) Distance parameter b) decision parameter
c) Describe point d) both a&b
96. What will be the value of initial decision parameter if we intend to draw a line between
A (3, 6) and B (4, 9) using Bresenham’s algorithm?
a)6 b)5 c)3 d)none of these
97. The total number of pixel put ‘ON’ for the line starting at (1, 1) and ending at (12, 7)
would be
a) 7 b) 11 c) 12 d) more than 12
98. Which one is not the neighbour of a pixel (x,y) in 4 -connected method ?
a)(x,y+1) b)(x+1,y+1) c)(x,y-1) d)none of these
99. Parametric equation of straight line (where 0≤ 𝑡 ≤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
100. How many matrices are required to rotate an object about a point (x, y)?
a)2 b)3 c)4 d)5
0 1 0
101. In 2D graphics, the transformation 1 0 0 results in
0 0 1
a) Reflection about line y=x b) reflection about line y=-x
c) Reflection about line y=0 d) searching about x-axis
102. If direction of rotation is Z axis, then direction of position of positive rotation is
a) Y to X b) Z to X c) X to Y d) Y to X
103. How many matrices are required to reflect an object through a line y= mx + c?
a) 2 b) 3 c)4 d)5
104. What is perspective anomaly?
a) Oblique b) vanishing point c) cavalier d) none of these
105. In 2D graphics, if S1 & S2 are two scaling matrix and T1 & T2 are two translation matrices
then
a) S1S2=S2S1 b) S1T1=S2T2 c) T2S2=T1S1 d)S1T1=T2S1
106. Reflection of an object is same as rotation with angle
a) 45 b) 900 c) 1800 d) 3600
107. What are the conditions for point clipping?
a) Xmax>X>Xmin and Ymax >Y>Ymin b) Xmin ≤ 𝑋 ≤Xmax and Ymin≤ 𝑌 ≤Ymax
c) 𝑋𝑚𝑖𝑛 = 𝑋 = 𝑋𝑚𝑎𝑥 𝑎𝑛𝑑 𝑌𝑚𝑖𝑛 = 𝑌 = 𝑌𝑚𝑎𝑥 d) none of these
108. GKS is
a) GEOMETRIC KERNAL SYSTEM b) GRAPGICAL KARNEL SIFTWARE
c) GRAPHICAL KARNEL SYSTEM d) GEOMETRIC KERNEL SOFTWARE
109. The format of storing digital audio in multimedia application is
a)JPEG b)TIFF c)WAV d)BMP
110. MIDI is
a) Musical instrument digital interface b) Multiple instrument digital interface
c) Musical interchangeable digital interface d) Multiple interchangeable digital interface
Answers
1. C 48. B 95. D
2. C 49. A 96. B
3. A 50. D 97. C
4. B 51. B 98. D
5. B 52. D 99. A
6. B 53. C 100. B
7. D 54. D 101. A
8. C 55. B 102. B
9. B 56. B 103. D
10. B 57. C 104. B
11. D 58. B 105. A
12. A 59. A 106. C
13. D 60. A 107. B
14. B 61. D 108. C
15. C 62. A 109. C
16. B 63. C 110. A
17. B 64. C
18. D 65. A
19. C 66. A
20. C 67. B
21. D 68. B
22. A 69. D
23. B 70. A
24. C 71. B
25. B 72. A
26. C 73. B
27. C 74. D
28. B 75. C
29. B 76. A
30. C 77. A
31. D 78. A
32. A 79. A
33. B 80. C
34. C 81. A
35. C 82. A
36. A 83. C
37. A 84. A
38. D 85. A
39. C 86. B
40. A 87. B
41. C 88. C
42. D 89. B
43. A 90. A
44. A 91. A
45. C 92. A
46. B 93. C
47. D 94. B