Are you a student preparing for an upcoming exam on computer graphics? Are you in search of comprehensive and reliable multiple-choice questions (MCQs) to enhance your preparation? Look no further, as this article aims to provide you with just that.
We understand the importance of having access to a diverse range of MCQs and their corresponding answers in order to solidify your understanding and boost your confidence before stepping into the examination hall.
Computer graphics is a fascinating field that encompasses various aspects such as rendering, modeling, animation, and visualization. To excel in this subject, it is crucial to have a thorough grasp of its fundamental concepts and principles.
Computer Graphics MCQ Questions and Answers pdf
1) ___ refers to shutting off the electron beam as it returns from the bottom of the display at the end of a cycle to the upper left-hand corner to start a new cycle.
(a) Horizontal retraces blanking
(b) Diagonal retrace blanking
(c) Vertical retrace blanking
(d) None of the above
Answer: (c)
2) Cartesian coordinate system can be
(a) Left-handed
(b) Right-handed
(c) Both a and b
(d) None of the above
Answer: (c)
3) Each byte is composed of ___ bits
(a) 2
(b) 4
(c) 8
(d) 16
Answer: (c)
4) The majority of ___ systems assign 1 bit in the memory map to one pixel on the display.
(a) Monochromatic
(b) Dichromatic
(c) Polychromatic
(d) Tri-chromatic
Answer: (a)
5) There are ___ steps involved in converting Cartesian coordinates
(a) 1
(b) 2
(c) 3
(d) 4
Answer: (d)
6) Most display terminals provide the uses with ___ keyboard.
(a) Alphabetic
(b) Numeric
(c) Alphanumeric
(d) All of the above
Answer: (c)
7) Two types of graphical interaction are-
(a) Partitioning and positioning
(b) Partitioned and painting
(c) Positioning and pointing
(d) None of the above
Answer: (c)
8) CRT raster display can be considered as a matrix of ___ calls
(a) Concrete
(b) Discrete
(c) Successive
(d) Perceived
Answer: (b)
9) The process of determining which pixels will provide a better approximation to the desired line is known as___.
(a) Scan conversion
(b) Randomization
(c) Rasterization
(d) Recreation
Answer: (c)
10) Rasterization combined with the process of rendering the picture scan line order is known as ___
(a) Scan conversion
(b) Randomization
(c) Recreation
(d) None of the above
Answer: (a)
11) One technique for obtaining a raster zed straight line is to solve the governing __ equation.
(a) Linear
(b) Drastic
(c) Integrated
(d) Differentials
Answer: (d)
12) Basic methods of projection are ___ and ___.
(a) Parallel and perspective
(b) Parallel and perceptive
(c) Perceptive and perspective
(d) None of the above
Answer: (a)
13) In viewing/specifying any objective the first viewing parameter is ___ & next is ___
(a) view reference point, view plane normal vector
(b) View plane normal vector, the View reference point
(c) Both a & b
(d) None of these
Answer: (a)
14) Equation for e in Brasenhams algorithm is.
(a) e = dy/dx -1/2
(b) e = 2dy –dx
(c) e =dy-dx/2
(d) e = dy-2dx
Answer: (a)
15) Equation for e in integer Brasenhams algorithm is.
(a) e =dy/dx -1/2
(b) e = 2dy-dx
(c) e =dy-dx/2
(d) e = dy- 2dx
Answer: (b)
16) The First octant in the Brasenhams algorithm is –
(a) > dy> dn
(b) ≥ dy ≥ dn
(c) ≤ dy≤ dx
(d) ≤ dy< dx
Answer: (c)
17) Brasenhams circle algorithm, it is desirable to perform the calculation necessary to find the scan–converted points with only.
(a) Integer addition
(b) Subs traction
(a) Multiplication
(d) All of the above
Answer: (d)
18) The best approximation in the Brasenhams circle algorithm of the true circle will be described by those pixels in the raster that falls the ___ distance from the true circle.
(a) Least
(b) Far
(c) Both a and b
(d) None of the above
Answer: (a)
19) Good graphics programming avoids the use of ___ operations whenever possible.
(a) Multiplications
(b) Division
(c) Floating point
(d) Integer
Answer: (c)
20) Many closed ___ are simple polygons
(a) Counters
(b) Contours
(c) Controls
(d) Canters
Answer: (b)
21) The simplest method of felling a polygon is to examine ___ in the raster.
(a) 1 pixel
(b) 2 pixel
(c) 5 pixel
(d) Every pixel
Answer: (d)
22) The bounding box is the ___ that contains the polygon.
(a) Smallest rectangle
(b) Largest rectangle
(c) Smallest triangle
(d) Smallest square
Answer: (a)
23) Expect at boundary edges, adjacent pixels are likely to have some characteristics. This property is referred to as ___.
(a) Coherence
(b) Special coherence
(c) Spatial coherence
(d) None of the above
Answer: (c)
24) For a ___graphics device adjacent pixels on a scan line are likely to have the same characteristics.
(a) Random scan
(b) Raster scan
(c) CRT
(d) None of the above
Answer: (b)
25) What is scan line coherence?
(a) Adjacent pixels on a scan line are likely to have different characteristics
(b) Non-adjective pixels on a scan line are likely to have different characteristics
(c) Adjective pixels on a scan line are likely to have the same characteristics
(d) None of the above
Answer: (c)
26) The characteristics of pixels on a given scan line change only where a polygon ___ scan line
(a) Intersects
(b) Unions
(c) Differences
(d) All of the above
Answer: (a)
27) Efficient algorithms for scan–converting solid area polygons can be developed. These are called
(a) Unordered edge list algorithm
(b) Ordered edge list algorithm
(c) A lumbered edge list algorithm
(d) All of the above
Answer: (b)
28) The efficiency of the algorithm depends on the ___.
(a) Efficiency of searching
(b) Efficiency of time
(c) Efficiency of sorting
(d) None of the above
Answer: (c)
29) The ordered edge list algorithm is ___.
(a) Powerful
(b) Weak
(c) Extremely weak
(d) Very powerful
Answer: (d)
30) The edge flag algorithm is a ___ process
(a) One-step
(b) Three-step
(c) Two-step
(d) Four-step
Answer: (b)
31) Using the half scan line convention for each edge interesting the polygon, set the leftmost pixel whose endpoint lies to the right of the interaction. This is a procedure for-
(a) Fill
(b) Counter
(c) Contour outline
(d) None of the above
Answer: (c)
32) The disadvantage of both the edge fill and fence fill algorithm is the number of pixels addressed
(a) More than once
(b) Not even once
(c) Exactly once
(d) None of the above
Answer: (c)
33) The edge fill, fence fill, and edge flag algorithm are ___ to simple polygons.
(a) Limited
(b) Not limited
(c) Both a and b
(d) None of the above
Answer: (b)
34) The First step of edge –flag algorithm is
(a) Fill
(b) Sean line
(c) Contour outline
(d) None of the above
Answer: (c)
35) The edge flag algorithm lists each pixel ___
(a) At least once
(b) Almost once
(c) 1
(d) None
Answer: (b)
36) A simple seed fill algorithm for a boundary the defined region can be developed using a ___.
(a) Queue
(b) Linked list
(c) Dequeue
(d) Stack
Answer: (d)
37) In a stack values may be placed or removed ___.
(a) Sequentially
(b) Randomly
(c) Directly
(d) None of the above
Answer: (a)
38) A push-down stack is ___.
(a) FIFO
(b) LILO
(c) LIFD
(d) None of the above
Answer: (c)
39) In a simple seed fill algorithm ___ function is used for placing a pixel on the stack.
(a) Seed
(b) Push
(c) POP
(d) None of the above
Answer: (b)
40) In a simple seed fill algorithm ___ function is used for removing a pixel from the stack.
(a) Seed
(b) Push
(c) Pop
(d) All of the above
Answer: (c)
41) ___ is the process of extracting a portion of the database, which is fundamental to several aspects of computer graphics.
(a) Projection
(b) Clipping
(c) Rotation
(d) Translation
Answer: (b)
42) Clipping algorithm can be implemented in –
(a) Software
(b) Both a and b
(c) Hardware
(d) None of the above
Answer: (c)
43) If both the points of a line are exterior to the window then,
(a) It is completely exterior to the window
(b) The line is not necessarily complete exterior of the window
(c) Both a and b
(d) None of the above
Answer: (b)
44) If a and b are endpoints of a line, then an algorithm for identifying completely visible and most invisible lines might be:
(a) Visibility algorithm
(b) Simple visibility algorithm
(c) Complex visibility algorithm
(d) None of the above
Answer: (b)
45) Endpoint code checking can easily be implemented when ___ is available.
(a) Byte manipulation
(b) Megabyte manipulation
(c) Bit manipulation
(d) None of the above
Answer: (c)
46) Midpoint subdivision algorithm woods direct calculation by performing
(a) Sequential search
(b) Direct search
(c) Binary search
(d) None of the above
Answer: (c)
47) In hardware division by 2 can be accomplished by shifting each bit to the –
(a) Right
(b) Left
(c) Up
(d) Down
Answer: (a)
48) Polygon clipping operator on
(a) Vertices
(b) Edges of the polygon
(c) Both a and b
(d) None of the above
Answer: (a)
49) The object is held stationary while the coordinate system is moved relative to the object is called
(a) Geometric Transformation
(b) Coordinate transformation
(c) Translation
(d) Rotation
Answer: (a)
50) The object is held stationary while the coordinates system is moved in relation to the object is called.
(a) Geometric transformation
(b) Coordinate transformation
(c) Translation
(d) Rotation
Answer: (b)
51) The object is displaced a given distance and direction its original position is called
(a) Translation
(b) Rotation
(c) Transformation
(d) Scaling
Answer: (a)
52) ___ is the process of expanding or compressing the dimensions of an object.
(a) Translation
(b) Rotation
(c) Transformation
(d) Scaling
Answer: (d)
53) A scaling constant ___ indicates an expansion of length.
(a) 1
(b) <1
(c) = 1
(d) ≥ 1
Answer: (a)
54) A scaling constant ___ indicates, compression of lengthy-
(a) < 1
(b) = 1
(c) ≥ 1
(d) None of these
Answer: (a)
55) If both scaling constants have the same value S, the sealing transformation is said to be
(a) Homogeneous
(b) Heterogeneous
(c) Both a and b
(d) None of the above
Answer: (a)
56) In Perspective Projection eye of the artist is placed at the
(a) Left of projection
(b) Right of projection
(c) Top of projection
(d) Center of projection
Answer: (d)
57) Which of them is not a perspective anomaly
(a) Foreshortening
(b) Vanishing points
(c) View confusion
(d) Topological Creation
Answer: (d)
58) Shift Register is operated in ___ fashion i.e. similar to ___
(a) FIFO, Queue
(b) FILO, Stack
(c) LIFO, Stack
(d) None of the above
Answer: (a)
59) In raster scan display a special area of memory is dedicated to graphics only. This memory area is called ___ & it holds the set of ___ values for all screen points.
(a) Frame Buffer, Intensity
(b) LUT, Canvas
(c) Canvas, Output
(d) None of the above
Answer: (a)
60) In the display controller architecture, the ___ allows the CPU to access the frame buffer directly & the display controller to access the ___ & there is a separate position to avoid memory conflicts when the CPU & display controller run asynchronously.
(a) Memory mapping, CPU memory
(b) Direct Mapping, CPU memory
(c) Indirect mapping, main memory
(d) Memory mapping, a frame buffer
Answer: (a)
61) The ___ line is straight but its ___ is not constant.
(a) 45°, width
(b) 60°, Height
(c) 30°, length
(d) None of the above
Answer: (a)
62) In DDA, the rasterized line lies to both sides of the actual line i.e. algo. is ___ dependent & here end. pt. accuracy is ___
(a) rasterization, 90%
(b) Orientation, poor
(c) Orientation, good
(d) Conversion, poor
Answer: (b)
63) The basic principle of Bresenham’s Line algorithm is to select the optimum ___ loan to represent a line i.e. increment the value of x or y by one unit depending upon ___ of line.
(a) raster, slope
(b) random, intensity
(c) raster, intensity
(d) random, slope
Answer: (a)
64) The increase in x or y is determined by examining the distance between locn & nearest pixel. This distance is called ___ or ___
(a) Decision variable, error gradient
(b) e, error
(c) Proposition to d1…d2
(d) All of the above
Answer: (a)
65) Bresenham’s circle drawing algorithm considers ___ way symmetry of the circle to generate it. It plots 1/8th part of the circle i.e. from 90° to ___
(a) eight, 45°
(b) eight, 180°
(c) 16, 45°
(d) four, 45°
Answer: (a)
66) ___ polygon is a polygon in which the line segment joining any two points within the polygon lines completely inside the polygon & its opposite is ___ polygon.
(a) Concave, convex
(b) Convex, concave
Answer: (b)
67) Algorithm that fills interior defined region are called ___ algorithm, Those that fill boundary defined region are called ___ algorithm.
(a) Flood fill, boundary fill
(b) Flood fill, edge fill
(c) Boundary fill, edge fill
(d) Both a & b
Answer: (d)
68) Two basic approaches used to fill the polygons are ___ & ___.
(a) Seed point, the scan line
(b) Raster izaion, scan conversion
(c) Seed point, bucket file
(d) None of the above
Answer: (a)
69) ___ give the color of the specified pixel & ___ draws the pixel with the specified color.
(a) get pixel(), put pixel()
(b) put pixel(), get pixel()
(c) Both a & b
(d) None of the above
Answer: (a)
70) Filling an area with a rectangular pattern is called ___ & relating the area of pattern with the area of primitive is known as ___.
(a) Filing, anchoring
(b) filing, viewing
(c) clipping, viewing
(d) anchor, cryptography
Answer: (a)
71) Horizontal & vertical lines have different thicknesses than line at an angle. If the thickness of the horizontal /vertical line is t then the line drawn at 45° has an average thickness of ___ & unequal line thickness results in unequal ___
(a) t/√3, replication
(b) t/2 , replication
(c) t/√2 brightness
(d) t/√3, brightness
Answer: (c)
72) In the ___ method the thickness of the primitive varies with the angle of primitive & varies in the opposite way than in the pixel ___ method.
(a) Moving pen, replication
(b) replication, moving the pen
(c) pattern filling, moving the pen
(d) all of the above
Answer: (a)
73) The process of selecting & viewing the picture with different views is called ___ & a process that divides each element of the picture into its visible & invisible position is called ___.
(a) Windowing, clipping
(b) anchoring, filling
(c) anchoring, cartography
(d) all of the above
Answer: (a)
74) The region against which an object is to be clipped is called ___ or___.
(a) Boundary, edges
(b) Clip window, clipping window
(c) viewport, window
(d) Both a & b
Answer: (b)
75) The oldest & most popular line clipping algorithm is ___ & was developed by ___ to speed up the processing
(a) Cohen subdivision algorithm, Ivan Sutherland
(b) Sutherland line clipping algorithm, Den Cohen
(c) Both a & b
(d) None of the above
Answer: (c)
76) 4-bit codes are called ___ or ___
(a) region code, out code
(b) UDLR code, LRTB code
(c) Both a & b
(d) None of the above
Answer: (c)
77) ___ is a generalized line clipping algorithm and is applicable to an arbitrary ___ region.
(a) Cyrus Beck, Convex
(b) Cohen Sutherland, concave
(c) Cyrus Beck, Concave
(d) Cohen Sutherland, convex
Answer: (a)
78) ___ algorithm is not applicable for non-rectangular clipping windows. SO we introduced ___ equation of line segment to find the intersection points of a line with the clipping edge.
(a) Cohen Sutherland, parametric
(b) Cyrus Beck, coordinate
(c) Cohen Sutherland, trigonometric
(d) Cyrus beck, elliptical
Answer: (a)
79) Transaction is a process of changing ___ of object & scaling is the process of changing ___
(a) position, shape
(b) position, direction
(c) size, shape
(d) axis, shape
Answer: (a)
80) Consider lines (5,5) to (13,9) Use Bresenhen & give the value of full term :
(a) ∆x=8, ∆y=4, e=0, m=2
(b) ∆x=7, ∆y=3, e=7, m=3
(c) ∆x=6, ∆y=4, e=1, m=4
(d) None of these
Answer: (a)
Conclusion
The Computer Graphics MCQ Questions and Answers pdf has provided a comprehensive assessment tool for individuals interested in testing their knowledge in this field. We hope that you have found these multiple-choice questions informative and helpful in expanding your understanding of computer graphics concepts.
If you have enjoyed using our MCQs, we encourage you to share them with your friends and colleagues on social media platforms.
By doing so, you will not only contribute to the dissemination of valuable educational resources but also help others enhance their knowledge and skills in computer graphics. Together, let’s continue to foster a community of learning and growth in this ever-evolving field.
Read More:
- Computer Graphics MCQs: set-1
- Grid Computing Multiple MCQs
- Computer Fundamentals MCQ
- Computer Networks MCQs
Click here to Download Computer Graphics MCQ with Answers in pdf
