22318 Computer Graphics MCQs PDF Download
Welcome Diploma and degree students to mypractically. Get 22318 Computer Graphics MCQs For Computer Engineering Students PDF.
This important and major post is helpful and beneficial for MSBTE Computer/IT Engineering Diploma and Degree Students.
In this article, you will get MSBTE Computer Engineering 22318 Computer Graphics MCQs Pdf.
By getting this DTE MCQs 22318 Computer Graphics Mcqs, you will easily get more marks for MSBTE Exams.
In this post, we have added MSBTE unit wise and chapter wise 22318 Computer Graphics MCQs for Computer Engineering MCQs Pdf, so if you like it make sure you will share it with your MSBTE diploma & degree Students
COMPUTER ENGINEERING DEPARTMENT
Question Bank for Multiple Choice Questions
Program: Diploma in Computer engineering Program Code:- CO
Scheme:-I Semester:- 3
Course:- Computer Graphics Course Code:- 22318
01 –Basic of computer Graphics Marks:- 08
l. l Image and Objects, pixel and resolution, Text mode. Graphics mode. Basic Graphics Pipeline.
Bitmap and Vector-Based Graphics. Applications of Computer Graphics.
1.2 Display Devices: Raster-Scan Display, Random -Scan Display, FlatPanel Display. LED. LCD
display, Plasma, Touch screen.
1.3 Output primitives: line, polygon, marker, text.
1.4 Graphics actions and standards.
1.5 Latest trends in Computer Graphics
02 – Raster Scan Graphics Marks:- 18
2.1 Basic concepts of line drawing: Line drawing algorithms: Digital Differential Analyzer (DDA) Algorithm, Bresenham's algorithm
2.2 Circle generating algorithms: Symmetry of circle, Bresenham'scircle drawing algorithm.
2.3 Polygons - Types of polygons, inside-outside test, Polygon Filling: Seed fill algorithms: Flood fi!LBoundary fill, scan line algorithms
2.4 Scan conversion, Frame Buffers
2.5 Character generation methods: stroke, starburst.
03 – Overview of Transformation Marks:-18
3.1 Two Dimensional Transformations: Translation, Scaling, Rotation, Reflection, Shearing.
3.2 Matrix representations and homogeneous coordinates: TranslationScaling, Rotation, Reflection,
Shearing.
3.3 Composite Transformations- rotation about an arbitrary point.
3.4 Three dimensional transformations: Translation, Scaling, Rotation.
3.5 Types of Projections: Perspective and parallel projection.
04 – Windowing and clipping Marks:-14
4.1 Windowing and clipping concepts: Window to-viewport transformation.
4.2 Line clipping: Cohen Sutherland clipping algorithm, Cyrusbeck, LiangBarsky,
Midpoint subdivision.
4.3 Polygon clipping: Sutherland -Hodgeman.
4.4 Text clipping.
05 – Introduction to Curves Marks:-12
5.1 Curve generation: Arc generation usingDDA algorithm, Interpolation
5.2 Types of curves: Hilbert's Curve, Kochcurve, B-Spline, Bezier curves.
{tocify} $title={Table of Contents}
01 –Basic of computer Graphics Marks:- 08
1, Anything Which is not a text on a computer is treated as a
a Computer Device
b Computer
c Computer Graphics
d Computer Graphics card
2. Computer graphics allow communication through
(a) Charts
(b) Diagrams
(c) Pictures
(d) All of the above
3. are notable graphics pipeline models accepted as widespread industry standards.
(a) OpenGL
(b Direct2D
(c) Direct3D
(d) DirectX
(e) All the above
(f) a and b
(g) c and a
4. GPU stands for
(a) Graphics Process Utilizer
(b) Graphics Process Unicode
(c) Graphic Process Unit
(d) None of the above
5. What is a Zener diode used as?
a) Oscillator
b) Regulator
c) Rectifier
d) Filter
6. What is a Zener diode used as?
a) Oscillator
b) Regulator
c) Rectifier
d) Filter
7. Mathematical formulas are used to form based images.
a)Bitmap
b)Vector
c) Buffer
d) Pixel
8. Which is correct? refer to the number of dots on screen.
A Pixel
B VectorBitmap
C Resolution
9. 24 bits is equal to (=)
A 32 thousand colors
B 16 thousand colors
C 16 million colors
D True color
E None of the above
01.Initgraph() function is used for
A Interaction
B Initialization
C Detection
D None of the mention above
11. VGA stands for
A Video Game Accelerator
B Video Game Adapter
C Video Graphics Adapter
D Video Graphics Array
12. Which of the following are not graphics devices?
A Scanners
B Joystick
C Video Display Devices
D Video Game
13. CRT is cost-effective
A True
B False
14. Backlit LED better known as
A Brighter Picture Display
B Sharper Picture Display
C All of the above
D Full-Array Lighting
15. CGA (Color Graphics Adapter) is introduced by and when?
A Microsoft 1981
B Microsoft 1991
C IBM 1981
D IBM 1991
16. Which of the following displays required low memory?
A Random scan
B Raster Scan
C Both
D None of the above
17. Raster Scan display used tubes.
A CRT
B DVST
C a and b
D none of the above
18. Which emerging tech is used to enhance an imaginary reality for gaming
A VR
B AR
19. Scanners are referred as
A Data Generating Devices
B Display Devices
C Scanning Devices
D Interactive devices
20. Computer Graphics is a device for drawing or painting.
A Tablet
B Digitizer
C Joystick
D Scanner
21. VR creates a totally artificial environment.
A True
B False
22. GUI stands for
A Graphics uniform interaction
B Graphical user interaction
C Graphical user interface
D None of the above
23. The components of Interactive computer graphics are
A A monitor
B Display controller
C Frame buffer
D All of the above
24. The higher number of pixels gives us a image -
A Better
B Worst
C Smaller
D None of the above
25. Which one of the following is the primarily used output device?
A Video monitor
B Scanner
C Speaker
D Printer
26. Which of the following is not the pattern of line?
A Dotted line
B Dashed line
C Dark line
D All of the above
27. Which one is not a type of basic fill styles?
A. solid color
B. Hollow
C. Pattern
D. Dark
28. The Quantity Of An Image Depend On
A. No. Of Pixel Used By Image
B. No. Of Line Used By Image
C. No. Of Resolution Used By Image
D. None
29. Pixel Can Be Arranged In A Regular
A. One Dimensional Grid
B. Two Dimensional Grid
C. Three Dimensional Grid
D. None Of These
30. Raster Images Are More Commonly Called
A. PixMap
B. Bitmap
C. Both A & B
D. None Of These
31. Raster Graphics Are Composed Of
A. Paths
B. Palette
C. Pixels
D. None Of These
32. Types Of Computer Graphics Are
A. Scalar And Raster
B. Vector And Raster
C. Vector And Scalar
D. None Of These
33. Each Pixel Has basic Color Components
A. Two Or Three
B. One Or Two
C. Three Or Four
D. None Of These
34. Graphics can be -
a) Simulation
b)Drawing
c) Movies, photographs
d)All of the above
35. A user can make any change in the image using -
A Interactive computer graphics
B Non-Interactive computer graphics
C Both (a) & (b)
D None of the above
36. Aspect Ratio can be defined as –
A The ratio of the vertical points to horizontal points
of pixels
b Both (a) & (b)
c None of the above
37. What is a pixel mask?
a) a string containing only 0's
b)a string containing only 1's
c) a string containing two 0's
d)a string containing both 1's and 0's
38. Which one of the following is the most commonly used and basic input device?
A Mouse
B Printer
C Scanner
D Keyboard
39. Which is not the input device?
A Impact printers
B Trackball
C Mouse
D Keyboard
02 – Raster Scan Graphics Marks:- 18
1. Raster scan systems generally use to display an image.
A Frame buffer
B Display controller
C Display file program
D None of the These
2. With reference to Random Scan Display, which of the following options is correct?
A It has an electron beam that directed only to the screen areas where any picture has to be
displayed.
B It has a good pixel amount.
C It's ideal for line drawing.
D All of the above mentioned.
3. Which one of the following does not fit for Random Scan and Raster Scan?
A Polygon Drawing Techniques
B Line Drawing Techniques
C Techniques to display an image on the screen
D Only A
4. With reference to Random Scan Display the beam of electron moves to the left top corner of the
screen to move to another frame. This motion is referred to as
A Vertical retrace
B Horizontal retrace
C Scan line
D All of the above mentioned
5. What is the formula for calculating the slope 'm' of a line?
A m = dx / dy
B m = dy / dx
D C y = mx + c
None of the above
6. Which of the following is a line drawing algorithm?
A Line equation algorithm
B Digital Differential Analyzer (DDA) algorithm
C Bressenham's algorithm
D All of the above
7. Which of the following statements is not true with respect to the Digital Differential Analyzer (DDA)
algorithm?
A It is an incremental method of scan conversion of line
B In this method, calculation is performed at each step but by using the results of previous steps.
C This algorithm can also be used to draw circle
D None of the above
8. Which of the following options is not correct according to the definition of Bresenham's line drawing algorithm?
A It gives a close approximation of points of line by determining n-dimensional raster that should be
selected.
B It is an incremental error algorithm.
C It gives exact line points.
D None of the above
9. The Digital Differential Analyzer (DDA) algorithm is an incremental method of scan conversion of line." Based upon the above statement, determine whether the following condition is true or false.
"The DDA algorithm uses the results of previous step for determining the value of the next step."
A True
B False
10. Which of the following is true with respect to the Bresenham's line drawing algorithm?
A It overcomes the drawbacks of DDA line drawing algorithm
B The DDA algorithm was proposed to overcome the limitations of Bresenham's line drawing
algorithm
C Both a. and b.
D None of the above
11. Why is the complexity of Bresenham's line drawing algorithm less than that of DDA line drawing
algorithm?
A It uses floating point operations over integer addition and subtraction
B It considers only selected ranged inputs
C It uses integer addition and subtraction over floating point operations
D None of the above
12. Which of the following properties is followed by the Bresenham's algorithm?
A It is an incremental method
B It chooses points randomly
cIt uses floating point operations
d All of the above
13. Which of the following are true with respect to the Bresenham's algorithm?
A. It produces smooth polygons
B. The results of this algorithm are 100 percent accurate.
C. Due to integer operations, it's complexity gets reduced
D. All of the above
14. "This algorithm is more accurate than any other circle drawing algorithms as it avoids the use of round off function."
Based upon the above statement, determine whether it is true or false.
A True
B False
15. "The mid-point algorithm is used for both circle drawing as well as ellipse drawing, but the procedure
is different for both of them."
Based upon the above statement, determine whether the following condition is true or false.
"The circle follows 8 - symmetry property whereas the ellipse follows 4 – symmetry property."
A True
B False
16. In Bresenham’s line algorithm, there are certain conditions for deciding the successive parameters. Of the distances d1 < d2 then decision parameter Pk is which of the following?
A Positive
B Equal
C Negative
D Can be any of the above
17. Which of the following line-generating algorithms is the most effective and efficient?
A Midpoint algorithm
B Bresenham's Line algorithm
C DDA algorithm
D None of the mentioned above
18. The main role of a frame buffer is the of the video signals that drive the display device.
A Storage, conditioning, and output
B Same speed
C Different speed
D None of the mentioned above
19. The between the strong regions equal to the duration of the dashed lines.
A Very short dashes
B Inter dash spacing
C Both A and B
D None of these
20. Which of the following sentence used in application software to specify line-type attributes?
A SETLINE ()
B SETLINE TYPE (lt)
C Both of the above mentioned
D None of the above mentioned
21. A-line can be seen by,
A Two points
B One point
C Four points
D Three points
22. At any point (x, y) on the boundary of the circle with radius r satisfies the equation fcircle (x,y)=0. If the point is in the interior of the circle, the circle function is negative while if the point is outside the circle
the, circle function is
A Positive
B Also negative
C May be positive or negative
D None of the above mentioned
03 – Overview of Transformation Marks:-18
1. If we multiply any matrix with matrix then we get the original matrix A_ .
A. Scaling matrix
B. Translation matrix
C. Identity matrix
D. Opposite matrix
2. Pixel is represented dy a tuple Xw,Yw,w in .
A. Normalised Device Coordinates
B. Homogeneous coordinates system
C. 3D coordinate system
D. None of these
3. transformation alters the size of an object.
A. Scaling
B. Rotation
C. Translation
D. Shear
4. If the angle Q is positive then the rotation direction will be .
A. Clockwise
B. Anticlockwise
C. Parallel
D. Perpendicular
5. Reflection of a point about x-axis ,followed by a conter-clockwise rotation of 90 is equivalent to
reflection about the
line .
A. X=-Y
B. Y=-X
C. X=Y
D. X+Y=1
6. The shape of the object gets by transformation.
A. Scaling
B. Rotation
C. Translation
D. Shear
7. is a transformation that produces a mirror image of an object.
A. Scaling
B. Translation
C. Reflection
D. Both B & C
8.If we multiply any matrix A with identity matrix then we get the matrix.
A. Identity matrix
B. Translation matrix
C. Scaling matrix
D. Original matrix
9. In homogeneous co-ordinate system a pixel is represented as .
A. X,Y
B. X,Y,Z
C. X,Y,W
D. Xw,Yw,w
10. Two consecutive transformation t1 and t2 are .
A. Additive
B. Substractive
C. Multiplicative
D. None of these
11. Reflection about the line Y=X is equivalent to ,followed by a anticlockwise rotation 90 .
A. Reflection about y-axis
B. Reflection about x-axis
C. Reflection about origin
D. None of these
12/ Two consecutive scaling transformation t1 and t2 are .
A. Additive
B. Substractive
C. Multiplicative
D. None of these
13. After scaling a triangle having coordinates A(0,0),B(5,0),C(5,5)by 2 units in X and 3 units in Y direction
the new
coordinates will be .
A. A(0,0),B(10,0),C(10,15)
B. A(0,0),B(10,15),C(10,0)
C. A(0,0),B(0,10),C(15,10)
D. A(2,3),B(10,0),C(10,15)
14. After performing Y-shear transformation we got A(2,5),B(4,11),C(2,7).If the constant value is 2 then original coordinates will be .
A. A(2,5),B(4,11),C(2,7)
B. A(2,1),B(4,3),C(2,3)
C. A(4,1),B(10,3),C(4,3)
D. A(5,11),B(3,4),C(3,2)
16. The point (x,y)becomes(y,x)in_ transformation.
A. Reflection about origin y-axis
B. Reflection about x-axis
C. Reflection at line Y=XD. Reflection about y-axis
17. Which of the following transformation is not used in rotation about arbitrary point in 2D?
A. Scaling
B. Rotation
C. Translation
D. None of these
18. If the resultant object is given along with the set of transformations applied on it, then to find the
original object we
have to use .
A. Affine transformation
B. Reverse transformation
C. Normal transformation
D. Inverse transformation
19. Two consecutive rotation transformation are always .
A. Additive
B. Subtractive
C. Multiplicative
D. None of these
20. Two consecutive rotation transformation are always commutative .
A. TRUE
B. FALSE
C. Not always
D. None of these
21. In Y-shear transformation point (x,y) becomes_ .
A. x+yb,xa+y
B. x+yb,y
C. x,xa+y
D. None of these
22. Reflection about X-axis followed by reflection about Y-axis is equivalent to .
A. Reflection about line Y= X
B. Reflection about origin
C. Reflection about line Y=-X
D. Reflection about Y-axis
23. If a circle is scaled in only one direction then it will become .
A. Parabola
B. Hyperbola
C. Ellipse
D. Circle
24. The transformation that changes the co-ordinate positions of an object along a circular path is
called .
A. Translation
B. Scaling
C. Rotation
D. Reflection
25. The result of two successive 2D rotations R(Q1) and R(Q2) is .
A. R(Q1+Q2)
B. R(Q1.Q2)
C. R(Q1-Q2)
D. R(Q1/Q2)
26. If we take mirror reflection of a points(x,y) along x-axis then the point becomes_ .
A. (x,-y)B. (-x,-y)
C. (-x,y)
D. (y,x)
27. If we take mirror reflection of a points(x,y) along the line Y=X then the point becomes_ .
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
28. The number of matrices required to rotate an object about a point(1,1) are _.
A. 1
B. 2
C. 3
D. 4
29. In X-shear transformation point(x,y)becomes_ .
A. (x+yb,xa+y)
B. (x+yb,y)
C. (x,xa+y)
D. None of these
30. If we take mirror reflection of a point (-x,y) along the origin then the point Becomes_ .
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
31. Shear transformation can be formed by scaling and rotation,justify True or False .
A. TRUE
B. FALSE
C. Not always
D. None of these
32. Which transformation needs homogeneous coordinates to represent it in Matrix from?
A. Scaling
B. Rotation
C. Translation
D. Reflection
33. Any 2D point is represented in a matrix form with dimension as .
A. 1*2B. 2*1
C. 1*1
D. 2*2
34. Any 2D point in homogeneous coordinates is represented in a matix form with dimension as__ .
A. 1*2
B. 2*1
C. 1*3
D. 3*1
35. If have the final coordinates of the polygen, then to recover the original coordinates of polygen we
have to
apply_ .
A. Scaling
B. Translation
C. Inverse transformation
D. None of these
04 – Windowing and clipping Marks:-14
1. What is the primary use of clipping in computer graphics?
a) adding graphics
b) removing objects and lines
c) zooming
d) copying
2. A polygon can be clipped using clipping operations.
a) True
b) False
3. Which vertex of the polygon is clipped first in polygon clipping?
a) top right
b) bottom right
c) bottom left
d) top left
4. How many methods of text clipping are there?
a) 5
b) 4
c) 3
d) 2
5. How many methods of text clipping are there?
a) 5
b) 4
c) 3
d) 2
6. We can change the size or resize the bitmap image.
a) True
b) False
7. In line clipping, the portion of line which is of window is cut and the portion that is
the window is kept.
a) outside, inside
b) inside, outside
c) exact copy, different
d) different, an exact copy
8. Skala’ is an example of which type of clipping?
a) curve clipping
b) point clipping
c) polygon clipping
d) line clipping
9. The process of removal of hidden surfaces is termed as
a) clipping
b) copying
c) culling
d) shorting
10. Cohen-Sutherland clipping is an example of
a) polygon clipping
b) text clipping
c) line clipping
d) curve clipping
11. The Cohen-Sutherland algorithm divides the region into number of spaces.
a) 8
b) 6
c) 7
d) 9
12. What is the name of the small integer which holds a bit for the result of every plane test?
a) setcode
b) outcode
c) incode
d) bitcode
13. An outcode can have bits for two-dimensional clipping and bits for three-dimensional
clipping.
a) 4,6
b) 6,8
c) 2,4
d) 1,3
14. The centre region of the screen and the window can be represented as_
a) 0000
b) 1111
c) 0110
d) 1001
15. The Cohen–Sutherland algorithm can be only be used on a rectangular clip window.
a) True
b) False
16. If both codes are 0000, (bitwise OR of the codes yields 0000) line lies the
window.
a) completely outside
b) half inside half outside
c) completely inside
d) can’t say anything
17.The 4-bit code of top-left region of the window is
a) 1001
b) 1100
c) 0101
d) 1010
18. The 4-bit code of bottom-right region of the window is
a) 1001
b) 0101
c) 1010
d) 0110
19. The object space or the space in which the application model is defined is called
a) World co-ordinate system
b) Screen co-ordinate system
c) World window
d) Interface window
20. What is the name of the space in which the image is displayed?
a) World co-ordinate system
b) Screen co-ordinate system
c) World window
d) Interface window
21. What is the rectangle in the world defining the region that is to be displayed?
a) World co-ordinate system
b) Screen co-ordinate system
c) World window
d) Interface window
22. The window opened on the raster graphics screen in which the image will be displayed is called
a) World co-ordinate system
b) Screen co-ordinate system
c) World window
d) Interface window
23. The process of mapping a world window in World Coordinates to the Viewport is called Viewing
transformation.
a) True
b) False
24. The scale factor of viewport transformation for x co-ordinate is
a) Sx = (svmax – svmin)/ (swmax – swmin)
b) Sx = (svmax – svmin)/ (swmax + swmin)
c) Sx = (svmin – svmax)/ (swmax – swmin)
d) Sx = (svmax + svmin)/ (swmax – swmin)
25. By changing the dimensions of the viewport, the and of the objects being
displayed can be manipulated.
a) Number of pixels and image quality
b) X co-ordinate and Y co-ordinate
c) Size and proportions
d) All of these
26. is a basic approach used to fill the polygon.
A. seed fill
B. scan fill
C. A and B
D. None of these
27. The seed fill algorithm for filling polygon is classified as fill algorithm and fill
algorithm.
A. flood, boundry
B. even, odd
C. edge, flood
D. boundry, scan
28. Polygoan filling algorithms those fill interior-defined regions are called algorithms.
A. flood fill
B. boundry fill
C. scan line
D. edge fill
29. Sutherland-Hodgeman clipping is an example of algorithm.
a) line clipping
b) polygon clipping
c) text clipping
d) curve clipping
30. How many polygons are used in Sutherland-Hodgeman clipping method?
a) 4
b) 3
c) 2
d) 1
31. Only vertices from the subject polygon that are on the are selected.
a) lower half
b) boundary
c) opaque side
d) visible side
32. The process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next.
a) True
b) False
33. We can correctly clip a polygon by processing the polygon boundary as a whole against each
a) side wall
b) top edge
c) window edge
d) bottom edge
34. How many edges of the clipping are/is present in 2D?
a) 1
b) 2
c) 3
d) 4
35. If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the
edge.
a) left edge
b)right edge
c) top edge
d) bottom edge
36. If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have
coincident edges.
a) True
b) False
37. In a convex polygon, each of the interior angles is less than degrees.
a) 90
b) 180
c) 360
d) 45
38. One of the drawbacks of Sutherland- Hodgeman algorithm is that it can’t produce
areas.
a) connected
b) multiple
c) discrete
d) circular
39. Liang–Barsky algorithm is a clipping algorithm.
a) circle
b) text
c) line
d) pixel
40. The ideas of the Liang-Barsky algorithm are the same with which algorithm?
a) Cyrus Beck algorithm
b) Liam-Chopsky algorithm
c) Cohen Sutherland algorithm
d) All have the same
05 – Introduction to Curves Marks:-12
1. Three-dimensional graphics
has Two axes
Three axes
Both a & b
None of these
2.n can be considered as an extension of spherical surface
Bezier
Ellipsoid
Shearing
None of these
3. ______ curve is one of the sp line approximation methods
Bezier
Ellipsoid
Shearing
None of these
4. Bezier curve is a polynomial of degree the no of control points used
One more than
One less than
Two less than
None of these
D) False, True, True
5. Bezier curve obtained from the four control points is called a
Square Bezier curve
Cubic Bezier curve
Hectare Bezier curve
Rectangle Bezier curve
6. The shape of a Bezier curve primarily depends upon the
Position of control points
Distance of control points
Position of the control panel
None of these
7. More the control points of a Bezier curve, quality of the curve
Higher
Lower
Bad
None of these
8. The blinding functions of Bezier curves are
a Splines
b Bernstein polynomials
c Lagrangian polynomials
d Newton polynomial
9. Spline curve can be either
Bezier spline
Spline
Both a & b
None of these
10. Bezier spline always passes through
First and second control point
Does not pass from First and second control point
Both a & b
None of these
11. The no of control points in a Bezier curve ensures the
Jaggies of curve
Smoothness of curve
Straightness of curve
None of these
Computer Graphics Multiple Question bank with answers pdf
22318 Computer graphics mcq with answers pdf (Download)
Subscribe & Follow us on Social Media. (Second Year)
Thankyou for Visiting MSBTE Solution Mypractically.
Mypractically is created to help msbte diploma students to find study resources, which are very much needed for diploma students while preparing for the exam. www.mypractically.xyz will provide all msbte mcq question bank with answers which are provided by msbte.org.in. with these model question and answer papers students gets a rough idea about paper pattern and marks distribution.
Tags:-22318 Computer Graphics Solved MCQs PDF Download,computer graphics mcq with answers pdf download,sppu computer graphics mcqs,22318 Computer Graphics MCQs PDF Download,computer graphics solved mcqs,