Computer Graphics MCQ (Multiple Choice Questions)

Here are 1000 MCQs on Computer Graphics (Chapterwise).

1. Which of the following statements define Computer Graphics?
a) It refers to designing plans
b) It means designing computers
c) It refers to designing images
d) None of the mentioned
View Answer
2. Among the given scientists/inventor who is known as the father of Computer
Graphics?
a) Nikola Tesla
b) Ivan Sutherland
c) Ada Lovelace
d) Marie Curie
View Answer
Answer: b
Explanation: Ivan Sutherland is considered the father of Computer Graphics. He is the
inventor of an interactive graphics system called sketchpad in 1963.

3. Which of the following are the features of Computer Graphics?

a) Creation and deletion of images by computer only
b) Deletion and manipulation of graphical images by computer
c) Creation and manipulation of graphics by computer
d) Creation of artificial images by computer only
View Answer
Answer: c
Explanation: Creation and manipulation of graphics (artificial images) by computer are
the features of Computer Graphics.

4. Which of the following is a Computer Graphics type?

a) Raster and Vector
b) Raster and Scalar
c) Scalar only
d) All of the above
View Answer
Answer: a
Explanation: Vector graphics are computer-rendered visual art that follows a
mathematical formula. Raster images are made up of thousands of tiny pixels, making
them resolution-dependent and ideally suited for photo editing.

5. Which of the following plane is used for 2D transformations?

a) Three-dimensional plane
b) Two-dimensional plane
c) One-dimensional plane
d) Four-dimensional Plane
View Answer
Answer: b
Explanation: A two-dimensional plane is used for 2D transformations. Transformations
are useful for modifying an object’s position, size, orientation, and shape, among other
things.
advertisement
6. Which of the following is a Computer Graphics Curve?
a) Bezier Curves
b) Implicit Curves
c) Explicit Curves
d) All of the above
View Answer
Answer: d
Explanation: A curve is made up of an unlimited number of points. Except for
endpoints, each point has two neighbors. Explicit, implicit, Bezier and parametric
curves are the three types of curves.

7. Who is the first user of computer graphics?

a) William Fetter
b) Ivan Edward Sutherland
c) Ada Lovelace
d) Nicholas Williams
View Answer
Answer: a
Explanation: In 1960s William Fetter used computer graphics to create cockpit drawing.
He along with Verne Hudson did research on computer graphics.

8. Which of the following is the purpose for using clipping in computer graphics?
a) copying
b) zooming
c) adding graphics
d) removing objects and lines
View Answer
Answer: d
Explanation: Clipping is a technique for removing objects, lines, and line segments that
are outside of the viewing pane. Several types of clippings are used in computer
graphics like:
• Point Clipping
 • Line Clipping
• Area Clipping (Polygon)
• Curve Clipping
• Text Clipping
• Exterior Clipping

9. In a graphical system, an array of pixels in the picture are stored in which of the
following locations?
a) Frame buffer
b) Processor
c) Memory
d) All of the mentioned
View Answer
Answer: c
Explanation: The main purpose of using a framer buffer is to store pixels.

10. Curves in computer graphics is primarily used for which of the following function?
a) To draw different types of objects onto the screen
b) Zooming out a picture
c) Copying a picture
d) Zooming in a picture
View Answer
Answer: a
Explanation: We frequently need to draw several types of things onto the screen in
computer graphics. Objects are not always flat, and we must draw curves many times
in order to draw an object.

11. __________ types of translation are present in computer graphics.

a) 5
b) 3
c) 4
d) 6
View Answer
Answer: b
Explanation: There are three types of translation techniques in computer graphics:
point translation (which deals with a single point), line translation (which deals with a
line), and polygon translation (which deals with a polygon) (deals with a shape).

12. Bitmap is a collection of ____________ that describes an image.

a) pixels
b) algorithms
c) bits
d) colors
View Answer
Answer: a
Explanation: A bitmap is a set of pixels that make up an image. It’s a sort of computer
graphics that lets you store and show photographs on your computer.

13. Which of the following devices provides positional information to the graphics
system?
a) Pointing devices
b) Both Input devices and Pointing devices
c) Output devices
d) Input devices
View Answer
Answer: b
Explanation: Input devices provide positional information to the system they are often
called pointing devices.

14. Which of the following is defined as the number of pixels stored in the frame buffer
of a graphics system?
a) Resalution
b) Resolution
c) Depth
d) None of the mentioned
View Answer
Answer: d
Explanation: The Resolution is defined as the number of pixels.

15. Which of the following is a primary output device of a graphics system?

a) Printer
b) Scanner
c) Video monitor
d) Neither Scanner nor Video monitor
View Answer
Answer: c
Explanation: The video monitor is the commonly used output device since it displays
the images on the screen.

16. Which of the following is used in graphics workstations as input devices to accept
voice commands?
a) Speech recognizers
b) Touch panels
c) None of the mentioned
d) All of the mentioned
View Answer
Answer: a
Explanation: Speech recognizers allow users to issue voice commands.

17. What is the use of voice system input?

a) To enter data
b) To initiate graphics operation and also to enter data
c) To initiate graphics operation
d) None of the mentioned
View Answer
Answer: b
Explanation: The voice system input is utilized to start graphics operations or to enter
data.

18. Which of the following is defined as the process of elimination of parts of a scene
outside a window or a viewport?
a) editing
b) cutting
c) plucking
d) clipping
View Answer
Answer: d
Explanation: Clipping is the process of removing excess content from a project. Clipping
is a way of selectively enabling or disabling rendering activities within a defined region
of interest in computer graphics.

19. Which of the following is known as the window opened on the raster graphics
screen in which the image will be displayed?
a) Interface window
b) World window
c) World co-ordinate system
d) Screen co-ordinate system
View Answer
Answer: a
Explanation: In layman’s terms, it’s referred to as a graphical user interface (GUI). Users
can interact with electronic equipment by using graphical icons and visual indicators
like secondary notation.

20. Which of the following operations can be used to zoom in or out around any axis on
a three-dimensional object from its original position?
a) Rotation
b) Shearing
c) Scaling
d) Translation
View Answer
Answer: c
Explanation: Scaling is the process of changing or modifying the size of objects in
computer graphics. The object’s size can be increased or decreased via scaling.

21. Among the following process, which process is known as the elimination of parts of
a scene outside a window or a viewport?
a) editing
b) plucking
c) cutting
d) clipping
View Answer
Answer: d
Explanation: Clipping is the process of removing excess content from a project. Clipping
is a way of selectively enabling or disabling rendering activities within a defined region
of interest in computer graphics.

22. Viewing transformation is the process of mapping a world window in World

Coordinates to the Viewport.
a) False
b) True
View Answer
Answer: b
Explanation: The viewing transformation is a computer graphics procedure in which
the maps represent the perspective view of an object in world coordinates into the
display space of a physical device.

23. Which of the following is defined as the drawing of number of copies of the same
image in rows and columns across the interface window so that they cover the entire
window?
a) Zooming
b) Panning
c) Tiling
d) Roaming
View Answer
Answer: c
Explanation: ‘Tilling’ is the process of drawing several copies of the same image in rows
and columns across the interface window until the entire window is covered. In
computer graphics, the window remains static while the viewpoint is modified multiple
times to accomplish tiling.

24. How many axes do 3D graphics consist of?

a) Two axes
b) Three axes
c) Five axes
d) One axis
View Answer
Answer: b
Explanation: The x-axis, y-axis, and z-axis are the three axes that make up a three-
dimensional graphic. The length, breadth, and height of a three-dimensional object are
represented by these axes.

25. Which of the following is the most commonly used boundary representation for a
3-dimensional graphics object?
a) Volume polygon
b) System polygon
c) Data polygon
d) Surface polygon
View Answer
Answer: d
Explanation: The most common border representation for a 3-D graphics item is a
surface polygon. This surface polygon encloses the object’s inside. A set of polygons is
maintained for a description of the object in this way of representation.

26. Which of the following is the process of digitizing a given picture definition into a set
of pixel-intensity for storage in the frame buffer?
a) Scan conversion
b) True color system
c) Encoding
d) Rasterization
View Answer
Answer: a
Explanation: The digitization of a picture definition into a collection of pixel-intensity for
storage in the frame buffer process is called scan conversion.

27. Which of the following is commonly known as frame buffer on a black and white
system with one bit per pixel?
a) Bitmap
b) Pix map
c) Multi map
d) All of the mentioned
View Answer
Answer: a
Explanation: The bit map frame buffer is always 1 bit per pixel.

28. Which of the following algorithm is a faster method for calculating pixel positions?
a) Parallel line algorithm
b) Mid-point algorithm
c) DDA line algorithm
d) Bresenham’s line algorithm
View Answer
Answer: c
Explanation: The fastest method DDA for calculating pixel positions is a faster method.

29. If the boundary is specified in a single color, and if the algorithm proceeds pixel by
pixel until the boundary color is encountered is known as ____
a) Parallel curve algorithm
b) Flood-fill algorithm
c) Scan-line fill algorithm
d) Boundary-fill algorithm
View Answer
Answer: d
Explanation: This algorithm proceeds outward pixel by pixel until the boundary color is
encountered.

30. Which of the following defines a pixel mask?

a) A string containing 1 and 0
b) A string containing 0 and 0
c) A string containing only 0’s
d) A string containing only 1;s
View Answer
Answer: a
Explanation: Inter-span spacing can be specified in a pixel mask that contains digits 1
and 0.

31. What does an aspect ratio mean?

a) Ratio of vertical points to horizontal points
b) Ratio of vertical points to horizontal points and horizontal points to vertical points
c) Number of pixels
d) Ratio of horizontal points to vertical points
View Answer
Answer: b
Explanation: The ratio of vertical points to horizontal points and horizontal points to
vertical points is known as an aspect ratio.

32. Which of the following is a correct abbreviation of DDA algorithm?

a) Data differential analyzer
b) Direct differential analyzer
c) Digital difference analyzer
d) Digital differential analyzer
View Answer
Answer: d
Explanation: DDA stands for the digital differential analyzer.

33. The Cohen-Sutherland algorithm divides the region into how many spaces?
a) 9
b) 8
c) 7
d) 6
View Answer
Answer: a
Explanation: The Cohen-Sutherland algorithm divides a two-dimensional space into 9
areas before determining the visible lines and sections of lines. The sections of interest
are seen in the central region.

34. The Cohen Sutherland algorithm is more efficient than the Liang-Barsky algorithm.
a) False
b) True
View Answer
Answer: a
Explanation: Because the Liang–Barsky clipping technique performs as much testing as
feasible before computing line crossings, it is significantly more efficient than other
algorithms.

35. Which of the following is used for 3D positioning and modeling, animation, and
other application?
a) Spac ball
b) Trackball
c) Space ball
d) All of the mentioned
View Answer
Answer: c
Explanation: A space ball is a 3D positioning device.
36. Which of the following can be used to determine the position on the data tablet?
a) Either Signal strength or coded pulse
b) Coded pulse
c) Signal strength
d) Strip microphones
View Answer
Answer: a
Explanation: Either Signal strength or coded pulse determines the position on the data
tablet.

37. Which of the following type of perspective projection is also called “Angular
Perspective”?
a) Four-Point
b) Three-point
c) One-point
d) Two-point
View Answer
Answer: d
Explanation: “Angular Perspective” is another name for Two-Point. The two vanishing
points on the line in a two-point perspective form an angle between them, which is why
it is also known as angular perspective.

38. Which of the following type of perspective projection is used in drawings of railway
lines?
a) Three-point
b) Two-point
c) One-point
d) Perspective projection is not used to draw railway lines
View Answer
Answer: c
Explanation: The One Point projection is commonly used to depict highways, railroad
tracks, and buildings. Only one vanishing point on the horizon line is present in a One-
Point perspective, which aids in the creation of railway tracks.

39. Which of the following representation represents a three-dimensional object?

a) Function
b) Point
c) Polygon
d) Equation
View Answer
Answer: d
Explanation: An equation representation can be used to represent a three-dimensional
entity. Three variables, x, y, and z, and four coefficients, A, B, C, and D, make up the
equation for a three-dimensional object.

40. Which part of a picture is considered and saved in exterior clipping?

a) We don’t consider the picture in exterior clipping
b) Picture which is outside the view window
c) Picture which is inside the view window
d) Picture which is on the edges of the view window
View Answer
Answer: b
Explanation: The image beyond the view window is examined and preserved
throughout the external cutting procedure. The portion of the image that is visible
through the view window is discarded. The external clipping method is the polar
opposite of the text and curve clipping methods.

41. Which of the following clipping process handles the clipping of strings?
a) Text Clipping
b) Exterior Clipping
c) Curve Clipping
d) Shape Clipping
View Answer
Answer: a
Explanation: Text Clipping is the technique that manages string clipping. It’s the
method for determining which parts of the string should be kept depending on their
position in the view window. Text Clippings come in a variety of forms, such as all or
none character clipping, all or none string clipping, and so on.

42. Which of the following algorithm can be used to clip a polygon in 3D space?
a) Vatti Clipping Algorithm
b) Polygon in 3D space cannot be clipped
c) Weiler Atherton Algorithm
d) Greiner Hormann Clipping Algorithm
View Answer
Answer: c
Explanation: Weiler Atherton Method is a 2D algorithm that may also be utilised in 3D
space. It is primarily utilised in 2D space, but with the help of Z-ordering, it can also be
used in 3D space. The Greiner Hormann Clipping algorithm and the Vatti Clipping
method only function in 2D space.

43. How is the line path on the polygon area for a 45% line?
a) Vertical
b) Horizontal
c) Centered
d) None of the mentioned
View Answer
Answer: a
Explanation: Only if a line is 45 percent is the line path centered on the polygon region.

44. Which of the following is defined as the sampling of object characteristics at a high
resolution and displaying the result at a lower resolution?
a) Anti-aliasing
b) Super-sampling or Post-filtering
c) Post-filtering
d) Super-sampling
View Answer
Answer: b
Explanation: By computing intensities and combining findings to create pixel
intensities, super-sampling is also known as Post-filtering.

45. Which of the following is the correct full form of the NLN line clipping algorithm?
a) Nicholai-Lee-Nicholl algorithm
b) Nicholl-Liang-Nicholl algorithm
c) Nicholl-Lee-Nicholl algorithm
d) Nicholai-Liang-Nicholl algorithm
View Answer
Answer: c
Explanation: The full form of the NLN clipping algorithm is the Nicholl-Lee-Nicholl
algorithm. It is a fast method of clipping.

46. ‘Skala’ is an example of which of the following type of clipping?

a) polygon clipping
b) line clipping
c) curve clipping
d) point clipping
View Answer
Answer: b
Explanation: Skala is a clipping procedure that can be used to clip a line or a line
segment against a rectangular window as well as a convex polygon. Its algorithm is
based on duality and homogeneous coordinates.

47. Which of the following is not a type of area sampling?

a) Point sampling
b) Weighted area sampling
c) Anti-aliasing
d) Unweighted area sampling
View Answer
Answer: a
Explanation: Weighted and unweighted area sampling are two methods of area
sampling that differ in terms of intensity proportionality. Unweighted area sampling is
also known as anti-aliasing, but point sampling is not a sort of area sampling.

48. In which of the following method, fixed pattern of a line is used to generate
characters?
a) Dot-matrix method
b) Bitmap method
c) Stroke method
d) Starbust method
View Answer
Answer: d
Explanation: A mixture of 24bit line segments is employed in the Starbust approach. It
is a character generating method in which only 24 strokes are defined for character
generation.

49. Which of the following stores the picture information as a charge distribution
behind the phosphor-coated screen?
a) Direct-view storage tube
b) Flat panel displays
c) 3D viewing device
d) Cathode ray tube
View Answer
Answer: a
Explanation: DVST saves the picture information behind the screen rather than
updating it.

50. Which of the following device is designed to minimize the background sound?
a) Joystick
b) Data glove
c) Microphone
d) Digitizers
View Answer
Answer: c
Explanation: The microphone is designed to minimize the background sound.

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
View Answer
Answer: a
Explanation: Equation for a straight line is y = m.x + b.

2. For lines with slope magnitude |m|<1, ?x can be_________

a) A set corresponding vertical deflection
b) A set proportional to a small horizontal deflection voltage
c) Only a
d) All of the mentioned
View Answer
Answer: b
Explanation:?x can be a set proportional to a small horizontal deflection voltage only if
slope magnitude |m| < 1.

3. On raster system, lines are plotted with

a) Lines
b) Dots
c) Pixels
d) None of the mentioned
View Answer
Answer: c
Explanation: Using pixels lines can be plotted.

4. Expansion of line DDA algorithm is

a) Digital difference analyzer
b) Direct differential analyzer
c) Digital differential analyzer
d) Data differential analyzer
View Answer
Answer: c
Explanation: DDA stands for digital differential analyzer.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
5. 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
View Answer
6. The disadvantage of lineDDA is
a) Time consuming
b) Faster
c) Neither a nor b
d) None of the mentioned
View Answer
Answer: a
Explanation: The DDA algorithm takes more time than other algorithm.

Check this: Computer Graphics Books | Computer Science Books

7. 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
View Answer
Answer: d
Explanation: Bresenham’s line algorithm is a very efficient and accurate algorithm.

8. In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk

is______
a) Positive
b) Equal
c) Negative
d) Option a or c
View Answer
Answer: c
Explanation: If d1 < d2 then the decision variable is always negative.

9. Which is the best line algorithm to balance the processing load among the
processers?
a) Parallel line algorithm
b) DDA line algorithm
c) Bresenham’s line algorithm
d) Position Bresenham’s line algorithm
View Answer
Answer: a
Explanation: If there are ‘n’ processes then this algorithm divides it into number of
partitions and generates line segments.

10. The algorithm which uses multiple processors to calculate pixel positions is
a) Midpoint algorithm
b) Parallel line algorithm
c) Bresenham’s line algorithm
d) All of the mentioned
View Answer
Answer: b
Explanation: In Parallel line algorithm each processors calculates pixel positions.

11. Coordinate references in the polyline function are stated as

a) Relative coordinate values
b) Absolute coordinate values
c) Current position
d) Real coordinate values
View Answer
Answer: b
Explanation: Coordinate references in the polyline function are stated as absolute
coordinate values.

12. To apply the midpoint method, we define

a) ?circle(x, y)= x 2+ y 2-? r?2
b) ?circle(x, y)= x+ y 2-? r?2
c) ?circle(x, y)= x 2– y 2-? r?2
d) ?circle(x, y)= x2+ y 2-? z?2
View Answer
Answer: a
Explanation: None.

13. _______ 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
View Answer
Answer: d
Explanation: Ellipses is defined as set of points.

14. If the boundary is specified in a single color, and if the algorithm proceeds pixel by
pixel until the boundary color is encountered is called
a) Scan-line fill algorithm
b) Boundary-fill algorithm
c) Flood-fill algorithm
d) Parallel curve algorithm
View Answer
Answer: b
Explanation: This algorithm proceeds outward pixel by pixel until the boundary color is
encountered.

15. If we want to recolor an area that is not defined within a single color boundary is
known as
a) Boundary-fill algorithm
b) Parallel curve algorithm
c) Flood-fill algorithm
d) Only b
View Answer
Answer: c
Explanation: We can paint such areas by replacing a specified interior color.

1. The basic attributes of a straight line segment are

a) Type
b) Width
c) Color
d) All of these
View Answer
Answer: d
Explanation: Type, width and colors are the basic attributes of line.

2. A dashed line could be displayed by generating_________.

a) Inter dash spacing
b) Very short dashes
c) Botha a and b
d) A or B
View Answer
Answer: a
Explanation: The inter dash spacing that is equal to the length of the solid sections
displays dashed line.

3. A dotted line can be displayed by generating

a) Very short dashes with spacing equal to and greater than dash size
b) Very long dashes with spacing equal to or greater than dash size
c) Very short dashes with spacing equal to and greater than dash size
d) Dots
View Answer
Answer: c
Explanation: Very long dashes with spacing equal to or greater than dash size can
displays dotted line.

4. Which of the following is not a line-type?

a) Dashed line
b) Dark line
c) Dotted line
d) Only b
View Answer
Answer: d
Explanation: Except dark line those are the types of the line.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement
5. In an application program, to set line-type attributes the following statement is used.
a) SetLinetype(lt)
b) setLinetype(lt)
c) SETLINETYPE(lt)
d) SETLINE()
View Answer
Answer: b
Explanation: None.

6. The algorithm which displays line-type attributes by plotting pixel spans is

a) Raster line algorithm
b) Raster scan algorithm
c) Random line algorithm
d) Random scan algorithm
View Answer
Answer: a
Explanation: Raster line algorithm displays line-type attributes.

Check this: Computer Science Books | MCA MCQs

7. Pixel mask means

a) A string containing only 1;s
b) A string containing only 0’s
c) A string containing 1 and 0
d) A string containing 0 and 0
View Answer
Answer: c
Explanation: Inter span spacing can be specified in a pixel mask that contains digits 1
and 0.

8. A heavy line on a video monitor could be displayed as

a) Adjacent perpendicular lines
b) Adjacent parallel lines
c) Both a and b
d) Neither a nor b
View Answer
Answer: b
Explanation: A heavy line displayed as adjacent parallel lines, while pen plotter might
require pen changes.

9. To set the line-width attribute the following command is used.

a) SETLINEWIDTHSCALEFACTOR (lw)
b) Setlinewidth()
c) Setlinewidthscalefacto (lw)
d) setLineWidthScaleFactor (lw)
View Answer
Answer: d
Explanation: setLineWidthScaleFactor (lw) function can be used to set line-width
attribute.

10. The parameter to “setLineWidthScaleFactor (lw) “function specifies?

a) Standard width
b) Relative width of the line
c) Thickness of the line
d) All of the mentioned
View Answer
Answer: b
Explanation: The positive value to lw indicates the relative width of the line.
Standard width, if Value=1
Thickness, if value>1.

11. We can adjust the shape of the line ends to give them a better appearance by using
a) Line spacing
b) More dots
c) Line caps
d) Round cap
View Answer
Answer: c
Explanation: Line caps are obtained by adjusting the end points of the line.

12. Thick line drawn with

a) Butt caps
b) Round caps
c) Projecting square caps
d) All of the mentioned
View Answer
Answer: d
Explanation: None.

13. We set the line-color value in PHIGS with the function

a) setPolylineColorIndex (lc)
b) setline Color()
c) SETPOLYLINECOLORINDEX (lc)
d) Only b
View Answer
Answer: a
Explanation: The setPolylineColorIndex (lc) function is used to set the line color.

14. If the angle between 2 connected line segments is very small then ________ can
generate a long spike that distorts the appearance of the polyline.
a) Miter join
b) Round join
c) Bevel join
d) None of the mentioned
View Answer
Answer: a
Explanation: Miter join provides long spikes that distort the appearance of the polyline.

15. A line drawn in the background color is

a) Visible
b) Invisible
c) Visible or Invisible
d) Only b
View Answer
Answer: d
Explanation: A line drawn in the background color is always invisible because both are
same color.

1. The color options are numerically coded with the following values.
a) Ranging from 0 through the positive integer
b) Ranging from 0 to 1
c) Ranging from 0 to -0
d) Only c
View Answer
Answer: a
Explanation: Color options can have any value from 0 to any positive number.

2. In color raster system, the number of color choices available depends on

a) colors in frame buffer
b) Amount of storage provided per pixel in frame buffer
c) RGB color
d) Neither a nor b
View Answer
Answer: b
Explanation: The amount of storage provided per pixels in frame buffer provides verity
range of colors.

3. The color code “000” is for

a) White
b) Black
c) Blue
d) Green
View Answer
Answer: b
Explanation: All zero means it is black color (the mixture of red, green and blue).

4. Color information can be stored in

a) Main memory
b) Secondary memory
c) Graphics card
d) Frame buffer
View Answer
Answer: d
Explanation: The frame buffer is a space that is used to store the color information.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
5. Whenever a particular color code is specified in an application program, the
corresponding binary value is placed in?
a) Color look-up table
b) Directly in frame buffer
c) a or b
d) Video lookup table
View Answer
Answer: b
Explanation: With the direct storage scheme, the binary values of color are stored in
frame buffer.

6. The range that specifies the gray or grayscale levels is

a) The value range from -1 to 1
b) The value range from 0 to -1
c) The value range from 0 to 1
d) Any one of the above
View Answer
Answer: c
Explanation: Any value ranging from 0 to 1 can specify grayscale levels.

Check this: MCA MCQs | Computer Science MCQs

7. With 3 bits per pixel, we can accommodate 8 gray levels. If we use 8 bits per pixel
then what is the value of gray levels?
a) 18 gray levels
b) 128 gray levels
c) 256 gray levels
d) No color
View Answer
Answer: c
Explanation: 8 bits per pixel means 2 power 8 i.e. 256.

8. With the display intensity corresponding to a given color index ci calculated as

a) Intensity=0.5[max(r, g, b)+ max(r, g, b)]
b) Intensity=0.5[min(r, g, b)+ min(r, g, b)]
c) Intensity=0.5[max(r, g, b)- max(r, g, b)]
d) Intensity=0.5[min(r, g, b)+ max(r, g, b)]
View Answer
Answer: d
Explanation: None.

9. A user can set color-table entries in a PHIGS application program with the function
a) setColourRepresentation (ws, ci, colorptr)
b) setColorRepresentation (ws, ci, colorptr)
c) setColour (ws, ci, colorptr)
d) setColourRepresentation ()
View Answer
Answer: a
Explanation: By using setColourRepresentation (ws, ci, colorptr) we can set the color-
table.

10. If any intensity input value near 0.33 would be stored as the binary value 1 in the
frame buffer, then it displays
a) Dark green color
b) Light gray color
c) Dark gray color
d) White or black
View Answer
Answer: c
Explanation: The intensity value 0.0 and 1 for black white respectively, and it is 0.33 for
dark gray and 0.67 for light gray.

1. We can think a line as a _____________________ in the grid.

a) Parallelogram
b) Rectangle
c) Circle
d) Triangle
View Answer
Answer: b
Explanation: A line can be viewed as a rectangle of defined thickness. It covers a
desired area in the grid. Even the thinnest horizontal line has a thickness of one pixel.

2. Line should set an intensity of only a single pixel in a column to black.

a) True
b) False
View Answer
Answer: b
Explanation: A line should not set an intensity of a single pixel in a column to black, but
rather should contribute some amount of intensity to each pixel in the column, whose
area it intersects.

3. A signal can also be represented as ____________________

a) Amplitude domain
b) Signal domain
c) Frequency domain
d) Phase domain
View Answer
Answer: c
Explanation: The signal can also be represented as a frequency domain, that is why we
may represent it as a sum of two different sine waves.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement
4. What is lower bound on the sampling rate known as?
a) Syquist rate
b) Nyquist rate
c) Hartley rate
d) Sampling rate
View Answer
Answer: b
Explanation: Sampling theory tells us that a signal can be reconstructed by its samples.
The original signal is sampled at a frequency larger than twice. This sampling rate is
called Nyquist rate.

5. The equal area in area sampling contributes _______________

a) Equal intensity
b) Greater intensity
c) Lower intensity
d) Area is not dependent on the intensity
View Answer
Answer: a
Explanation: The equal area contributes to equal intensity in area sampling. Only the
total amount of overlapped area matters, regardless of the distance between the
pixel’s centre.

Check this: Computer Science Books | Computer Graphics Books

6. Which of the following is NOT a type of area sampling?

a) Weighted area sampling
b) Unweighted area sampling
c) Anti-aliasing
d) Point sampling
View Answer
Answer: d
Explanation: Weighted and unweighted area sampling are types of area sampling
classified on the basis of proportionality of intensity. Anti-aliasing is another name of
unweighted area sampling whereas, point sampling is not a type of area sampling.

7. The technique of setting the intensity proportional to the amount of area covered is
used in weighted area sampling.
a) True
b) False
View Answer
Answer: b
Explanation: The technique of setting the intensity proportional to the amount of area
covered is used in unweighted area sampling. This technique produces noticeably
better results than others.

8. What happens to intensity if an area of overlapping increases?

a) Intensity remains same
b) Intensity decreases
c) Intensity increases
d) Can’t say anything
View Answer
Answer: c
Explanation: When the line covers pixel completely the intensity is a maximum while
when the line doesn’t touch the pixel the intensity is zero. Hence we can say, the
intensity is directly proportional to the overlapping area.

9. What is the effect of weighted area sampling on adjacent pixels?

a) Intensity is increased
b) Intensity is decreased
c) Contrast is increased
d) Contrast is decreased
View Answer
Answer: d
Explanation: The net effect of weighted area sampling is to decrease the contrast of
adjacent pixels. This gives a lot of help in order to provide smooth transactions.

10. What is the name of the effect that causes different signals to become
indistinguishable?
a) Aliasing
b) Anti-aliasing
c) Sampling
d) Staircase effect
View Answer
Answer: a
Explanation: When the resolution is too low, visual stair-stepping of edges occurs in an
image. That effect is called aliasing.

1. A translation is applied to an object by

a) Repositioning it along with straight line path
b) Repositioning it along with circular path
c) Only b
d) All of the mentioned
View Answer
Answer: a
Explanation: A translation is applied to an object by repositioning it along with straight
line path from one location to another.

2. We translate a two-dimensional point by adding

a) Translation distances
b) Translation difference
c) X and Y
d) Only a
View Answer
Answer: d
Explanation: We can translate 2D point by adding translation distances dx and dy.

3. The translation distances (dx, dy) is called as

a) Translation vector
b) Shift vector
c) Both a and b
d) Neither a nor b
View Answer
Answer: c
Explanation: The translation distances (dx, dy) from its original position is called as
translation vector or shift vector.

4. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation
a) x’=x+dx and y’=y+dx
b) x’=x+dx and y’=y+dy
c) X’=x+dy and Y’=y+dx
d) X’=x-dx and y’=y-dy
View Answer
Answer: b
Explanation: By adding translation distance dx and dy to its originsl position (x, y) we
can obtain a new position (x’, y’).

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
5.The two-dimensional translation equation in the matrix form is
a) P’=P+T
b) P’=P-T
c) P’=P*T
d) P’=p
View Answer
Answer: a
Explanation: The 2D translation equation is P’=P+T.

6. _________ is a rigid body transformation that moves objects without deformation.

a) Rotation
b) Scaling
c) Translation
d) All of the mentioned
View Answer
Answer: c
Explanation: Translation a rigid body transformation that moves objects without
deformation.

Check this: Computer Science MCQs | Computer Science Books

7. A straight line segment is translated by applying the transformation equation

a) P’=P+T
b) Dx and Dy
c) P’=P+P
d) Only c
View Answer
Answer: a
Explanation: A straight line segment is translated by applying the transformation
equation P’=P+T to each of line endpoints.

8. Polygons are translated by adding __________ to the coordinate position of each

vertex and the current attribute setting.
a) Straight line path
b) Translation vector
c) Differences
d) Only b
View Answer
Answer: d
Explanation: None.

9. To change the position of a circle or ellipse we translate

a) Center coordinates
b) Center coordinates and redraw the figure in new location
c) Outline coordinates
d) All of the mentioned
View Answer
Answer: b
Explanation: By translating the center coordinates and redraw the figure in new
location we can change the position of a circle or ellipse.

10.The basic geometric transformations are

a) Translation
b) Rotation
c) Scaling
d) All of the mentioned
View Answer
Answer: d
Explanation: These are the basic geometric transformations and other transformations
are reflection and shear

1. A two dimensional rotation is applied to an object by

a) Repositioning it along with straight line path
b) Repositioning it along with circular path
c) Only b
d) Any of the mentioned
View Answer
Answer: c
Explanation: A two dimensional rotation is applied to an object by repositioning it along
with circular path.

2. To generate a rotation , we must specify

a) Rotation angle ϴ
b) Distances dx and dy
c) Rotation distance
d) All of the mentioned
View Answer
Answer: a
Explanation: Generate a rotation, we must specify rotation angle ϴ of the rotation point
or pivot point which the object is to be rotated.

3. Positive values for the rotation angle ϴ defines

a) Counterclockwise rotations about the end points
b) Counterclockwise translation about the pivot point
c) Counterclockwise rotations about the pivot point
d) Negative direction
View Answer
Answer: c
Explanation: A positive value for the rotation angle ϴ defines counterclockwise
rotations about the pivot point.

4. The rotation axis that is perpendicular to the xy plane and passes through the pivot
point is known as
a) Rotation
b) Translation
c) Scaling
d) Shearing
View Answer
Answer: a
Explanation: The rotation transformation is also described as a rotation about a
rotation axis that is perpendicular to the xy plane and passes through the pivot point.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
5. The original coordinates of the point in polor coordinates are
a) X’=r cos (Ф +ϴ) and Y’=r cos (Ф +ϴ)
b) X’=r cos (Ф +ϴ) and Y’=r sin (Ф +ϴ)
c) X’=r cos (Ф -ϴ) and Y’=r cos (Ф -ϴ)
d) X’=r cos (Ф +ϴ) and Y’=r sin (Ф -ϴ)
View Answer
Answer: b
Explanation: The original coordinates of the point in polor coordinates are X’=r cos (Ф
+ϴ) and Y’=r sin (Ф +ϴ).

6. The two-dimensional rotation equation in the matrix form is

a) P’=P+T
b) P’=R*P
c) P’=P*P
d) P’=R+P
View Answer
Answer: b
Explanation: The 2D translation equation is P’=R*P.

Check this: MCA MCQs | Computer Science Books

7. ________ is the rigid body transformation that moves object without deformation.
a) Translation
b) Scaling
c) Rotation
d) Shearing
View Answer
Answer: c
Explanation: Rotation is the rigid body transformation that moves object without
deformation.

8. An ellipse can also be rotated about its center coordinates by rotating

a) End points
b) Major and minor axes
c) Only a
d) None
View Answer
Answer: b
Explanation: None.

1. The transformation that is used to alter the size of an object is

a) Scaling
b) Rotation
c) Translation
d) Reflection
View Answer
Answer: a
Explanation: Scaling is used to alter the size of an object.

2. The two-dimensional scaling equation in the matrix form is

a) P’=P+T
b) P’=S*P
c) P’=P*R
d) P’=R+S
View Answer
Answer: b
Explanation: The 2d scaling equation is P’=S*P.

3. Scaling of a polygon is done by computing

a) The product of (x, y) of each vertex
b) (x, y) of end points
c) Center coordinates
d) Only a
View Answer
Answer: d
Explanation: Scaling of a polygon is done by computing the product of (x, y) of each
vertex with scaling factor sx and sy to produce the transformation coordinates ( Xnew,
Ynew).

4. If the scaling factors values sx and sy < 1 then

a) It reduces the size of object
b) It increases the size of object
c) It stunts the shape of an object
d) None
View Answer
Answer: a
Explanation: If the scaling factors values sx and sy < 1 then it reduces the size of object.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
5. If the scaling factors values sx and sy are assigned to the same value then
a) Uniform rotation is produced
b) Uniform scaling is produced
c) Scaling cannot be done
d) Scaling can be done or cannot be done
View Answer
Answer: b
Explanation: When sx and sy are assigned the same value then uniform scaling is
produced that maintains relative object proportions.

6. If the scaling factors values sx and sy are assigned to unequal values then
a) Uniform rotation is produced
b) Uniform scaling is produced
c) Differential scaling is produced
d) Scaling cannot be done
View Answer
Answer: c
Explanation: Unequal values for sx and sy results in differential scaling that is often
used in design applications.

Check this: MCA MCQs | Computer Science MCQs

7. The objects transformed using the equation P’=S*P should be

a) Scaled
b) Repositioned
c) Both a and b
d) Neither a nor b
View Answer
Answer: c
Explanation: The objects transformed using the equation P’=S*P should be scaled and
repositioned.

8. We control the location of a scaled object by choosing the position is known as

a) Pivot point
b) Fixed point
c) Differential scaling
d) Uniform scaling
View Answer
Answer: b
Explanation: None.

9. If the value of sx=1 and sy=1 then

a) Reduce the size of object
b) Distort the picture
c) Produce an enlargement
d) No change in the size of an object
View Answer
Answer: d
Explanation: sx=sx=1 does not change the size of the object.

10. The polygons are scaled by applying the following transformation.

a) X’=x * Sx + Xf(1-Sx) and Y’=y * Sy + Yf(1-Sy)
b) X’=x * Sx + Xf(1+Sx) and Y’=y * Sy + Yf(1+Sy)
c) X’=x * Sx + Xf(1-Sx) and Y’=y * Sy – Yf(1-Sy)
d) X’=x * Sx * Xf(1-Sx) and Y’=y * Sy * Yf(1-Sy)
View Answer
Answer: a
Explanation: The polygons are scaled by applying the transformation X’=x * Sx + Xf(1-
Sx) and Y’=y * Sy + Yf(1-Sy).

Computer Graphics Questions & Answers – Matrix

Representations and Homogeneous Coordinates
« Prev
Next »
This section of our 1000+ Computer Graphics multiple choice questions focuses on
Matrix Representations and Homogeneous Coordinates.
1.The matrix representation for translation in homogeneous coordinates is
a) P’=T+P
b) P’=S*P
c) P’=R*P
d) P’=T*P
View Answer
Answer: d
Explanation: The matrix representation for translation is P’=T*P.

2. The matrix representation for scaling in homogeneous coordinates is

a) P’=S*P
b) P’=R*P
c) P’=dx+dy
d) P’=S*S
View Answer
Answer: a
Explanation: The matrix representation for scaling is P’=S*P.

3. The matrix representation for rotation in homogeneous coordinates is

a) P’=T+P
b) P’=S*P
c) P’=R*P
d) P’=dx+dy
View Answer
Answer: c
Explanation: The matrix representation for rotation is P’=R*P.

4. What is the use of homogeneous coordinates and matrix representation?

a) To treat all 3 transformations in a consistent way
b) To scale
c) To rotate
d) To shear the object
View Answer
Answer: a
Explanation: To treat all 3 transformations in a consistent way, we use homogeneous
coordinates and matrix representation.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
5. If point are expressed in homogeneous coordinates then the pair of (x, y) is
represented as
a) (x’, y’, z’)
b) (x, y, z)
c) (x’, y’, w’)
d) (x’, y’, w)
View Answer
Answer: d
Explanation: If point are expressed in homogeneous coordinates then we add 3rd
coordinate to the point (x, y), that is represented as (x’, y’, w).

6. For 2D transformation the value of third coordinate i.e. w=?

a) 1
b) 0
c) -1
d) Any value
View Answer
Answer: a
Explanation: For 2D we have (x, y, 1) i.e. w=1.

Check this: MCA Books | Information Science MCQs

7. We can combine the multiplicative and translational terms for 2D into a single matrix
representation by expanding
a) 2 by 2 matrix into 4*4 matrix
b) 2 by 2 matrix into 3*3
c) 3 by 3 matrix into 2 by 2
d) Only c
View Answer
Answer: b
Explanation: We can combine the multiplicative and translational terms for 2D into a
single matrix representation by expanding 2 by 2 matrix representation into 3 by 3.

8. The general homogeneous coordinate representation can also be written as

a) (h.x, h.y, h.z)
b) (h.x, h.y, h)
c) (x, y, h.z)
d) (x,y,z)
View Answer
Answer: b
Explanation: The general homogeneous coordinate representation can also be written
as (h.x, h.y,

Computer Graphics Questions & Answers – Composite

2D Transformations
« Prev
Next »
This set of Computer Graphics Questions and Answers for Aptitude test focuses on
“Composite 2D Transformations”.

1. Two successive translations are___________________

a) Multiplicative
b) Inverse
c) Subtractive
d) Additive
View Answer
Answer: d
Explanation: Successive translations are additive.
P’= T(tx1, ty1) .[T(tx2, ty2)] P
= {T(tx1, ty1). T(tx2, ty2)}.P
Or T(tx1, ty1). T(tx2, ty2) = T(tx1+tx2 , ty1 + ty2).

2. Two successive translations are not commutative.

a) True
b) False
View Answer
Answer: b
Explanation: According to commutative property, the order does not matter. Same as
in the case of successive translations. Hence we can say that two successive
translations are commutative.

3. General pivot point rotation can be expressed as _____________________

a) T(zr,yr).R(θ).T(-zr,-yr) = R(xr,yr,θ)
b) T(xr,yr).R(θ).T(-xr,-yr) = R(xr,yr,θ)
c) T(xr,yr).R(θ).T(-xr,-yr) = R(zr,yr,θ)
d) T(xr,yr).R(θ).T(-xr,-yr) = R(xr,yr,Q)
View Answer
Answer: b
Explanation: Since the first two parameters are in 2D, hence only ‘x’ and ‘y’ can be
variable along with ‘θ’. In other options, there is one more parameter ‘z’.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
4. Which of the following is NOT correct? (A, B and C are matrices)
a) A.B = B.A
b) A.B.C = (A.B).C = A.(B.C)
c) C(A+B) = C.A + C.B
d) 1 A = A 1
View Answer
Answer: a
Explanation: Matrix multiplication does not commute. We cannot switch the order of
the factors and expect to end up with the same result. Hence, A.B ≠ B.A.

5. Reflection about the line y=0, the axis, is accomplished with the transformation
matrix with how many elements as ‘0’?
a) 8
b) 9
c) 4
d) 6
View Answer
Answer: d
Explanation: The matrix used for reflection about y=0 is an identity matrix with 6 ‘0’s
and two ‘1’s and one element as ‘-1’.

Check this: Computer Science MCQs | Computer Graphics Books

6. Which transformation distorts the shape of an object such that the transformed
shape appears as if the object were composed of internal layers that had been caused
to slide over each other?
a) Rotation
b) Scaling up
c) Scaling down
d) Shearing
View Answer
Answer: d
Explanation: Two common shearing transformations are the type of transformation
that shift coordinate x values coordinate y values. In shear transformation, the
transformed shape appears as if the object were composed of internal layers that had
been caused to slide over each other.

7. Transpose of a column matrix is________________

a) Zero matrix
b) Identity matrix
c) Row matrix
d) Diagonal matrix
View Answer
Answer: c
Explanation: Transpose of a matrix is a matrix which is made by interchanging the rows
and columns of the original matrix. Hence the transpose of column matrix is row
matrix and vice versa.

8. Reversing the order in which a sequence of transformations is performed may affect

the transformed position of an object.
a) True
b) False
View Answer
Answer: a
Explanation: As we know that, matrix transformations are not commutative and the
order of transformation matters. So it will affect the position of the object.

9. Which one of the following is the correct notation of a matrix with ‘m’ rows and ’n’
columns?
a) m + n
b) m – n
c) m x n
d) m/n
View Answer
Answer: c
Explanation: m x n represents a matrix with ‘m’ number of rows and ‘n’ number of
columns, while others are just arithmetic operations which can be done on 2 matrices.

10. How many minimum numbers of zeros are there in ‘3 x 3’ triangular matrix?
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: b
Explanation: In a triangular matrix, all entries, either above or below the diagonal are
zero. So in case of ‘3 x 3’ matrix, there should be minimum 3 elements as 0.

Computer Graphics Questions & Answers –

Transformations between Coordinate Systems and
Affine Transformations
« Prev
Next »
This set of Computer Graphics Interview Questions and Answers focuses on
“Transformations between Coordinate Systems and Affine Transformations”.
1. A ___________ is a system which uses one or more numbers, or coordinates, to
uniquely determine the position of a point.
a) co-ordinate system
b) binary-system
c) vector-system
d) euclid geometry
View Answer
2. Which of the co-ordinate represents X co-ordinate in (6,8,9)?
a) 6
b) 8
c) 9
d) 0
View Answer
Answer: a
Explanation: In a co-ordinate system, any position of a point is denoted as (x,y,z).
Where x denotes the perpendicular distance of the point from the x-axis. Hence x is the
X co-ordinate.

3. Which of the co-ordinate represents Y co-ordinate in (6,8,9)?

a) 6
b) 8
c) 9
d) 0
View Answer
Answer: b
Explanation: In a co-ordinate system, any position of a point is denoted as (x,y,z).
Where y denotes the perpendicular distance of the point from the y-axis. Hence y is the
Y co-ordinate.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
4. Which of the co-ordinate represents Z co-ordinate in (6,8,9)?
a) 6
b) 8
c) 9
d) 0
View Answer
Answer: c
Explanation: In a co-ordinate system, any position of a point is denoted as (x,y,z).
Where z denotes the perpendicular distance of the point from the z-axis. Hence z is the
Z co-ordinate.
5. _______________ and ___________ are two types of transformations.
a) quadratic, cubic
b) variable, affine
c) linear, quadratic
d) linear, affine
View Answer
Answer: d
Explanation: Linear and affine transformations are two different types of
transformations of matrices. In linear, points are in vector space but in affine, points
are in affine space.

Check this: MCA Books | Computer Science MCQs

6. Adding points to a vector give a vector.

a) True
b) False
View Answer
Answer: b
Explanation: Adding a vector to a point gives a point, but Subtracting points gives a
vector.

7. Which of the following properties are preserved in affine transformation?

a) co-linearity
b) convexity
c) concavity
d) parallelism
View Answer
Answer: c
Explanation: The col-linearity, convexity and parallelism of bunch of points are
conserved in affine transformations but any 3 or more points which are concave can
turn parallel, so we can say concavity is not conserved.

8. Ratio of length along a line is preserved in affine transformations.

a) True
b) False
View Answer
Answer: a
Explanation: The ratio of length gets preserved, for example, distinct collinear points
x1,x2,x3. The ratio of x1x2 and x2x3 is same as that of f(x1)f(x2) and f(x2)f(x3).
9. Which co-ordinates allow common vector operations such as translation, rotation,
scaling and perspective projection to be represented as a matrix by which the vector is
multiplied.
a) vector co-ordinates
b) 3d co-ordinates
c) affine co-ordinates
d) homogenous co-ordinates
View Answer
Answer: d
Explanation: The function of homogenous co-ordinates is to allow common vector
operations such as translation, rotation, scaling and perspective projection to be
represented as a matrix by which the vector is multiplied.

10. For orthonormal basis, which of these is correct?

a) M-1 = Mt
b) M-1 = Mt
c) M = M
d) Mt = I
View Answer
Answer: a
Explanation: Due to the effect of similitude and similarity transform, the inverse is
equal to the transpose. So, we can say that M-1 = Mt.

This set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on
“Two Dimensional Viewing”.

1. A view is selected by specifying a sub-area of the __________ picture area.

a) half
b) total
c) full
d) quarter
View Answer
2. Co-ordinates are ranging according to the screen resolution.
a) True
b) False
View Answer
Answer: a
Explanation: When we display a scene, only those objects which have a particular
window are displayed. So for that mechanism to work, co-ordinates are made to range
themselves according to the screen resolution.
3. Any convenient co-ordinate system or Cartesian co-ordinates which can be used to
define the picture is called ___________
a) spherical co-ordinates
b) vector co-ordinates
c) viewport co-ordinates
d) world co-ordinates
View Answer
Answer: d
Explanation: World Coordinate Systems (WCS) are the type of coordinate systems
which describe the physical coordinates associated with a data array, such as sky
coordinates. It is also used to denote wavelengths of a spectrum and to draw
astronomical images.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
4. Which of the following co-ordinates are NOT used in 2d viewing transformation?
a) modelling co-ordinates
b) viewing co-ordinates
c) vector co-ordinates
d) device co-ordinates
View Answer
Answer: c
Explanation: Vector co-ordinates are used to denote vectors which are physical
quantities having magnitude as well as direction. In 2d viewing transformations-
Modelling co-ordinates, viewing co-ordinates, Normalised co-ordinates and Device co-
ordinates are used.

5. The process of elimination of parts of a scene outside a window or a viewport is

called _____________
a) cutting
b) plucking
c) clipping
d) editing
View Answer
Answer: c
Explanation: Clipping is the process of cutting out extra material. In the context of
computer graphics, clipping is a method to selectively enable or disable rendering
operations within a defined region of interest.

Check this: Computer Graphics Books | Computer Science MCQs

6. For a 2d transformation viewing, in how many ways a clipping algorithm can be
applied?
a) 3
b) 2
c) 1
d) 5
View Answer
Answer: b
Explanation: Clipping algorithm can be applied in two ways for 2d transformation
viewing. Two ways in which clipping algorithms can be applied are- 1) world co-ordinate
clipping. 2) viewport clipping.

7. Which of the following is NOT a type of clipping algorithm used on the raster system?
a) line clipping
b) point clipping
c) area clipping
d) solid clipping
View Answer
Answer: d
Explanation: Since clipping is done in 2 dimensional viewing and solid is a 3
dimensional object so clipping algorithm can’t be applied on a solid object. Instead of
solid clipping, there is another type of clipping algorithm known as curve clipping.

8. For a point to be clipped, which of the following conditions must be satisfied by the
point?
a) xwmin < x < xwmax
b) xwmin = x = xwmax
c) xwmin > x > xwmax
d) ywmin = y = ywmax
View Answer
Answer: c
Explanation: A point P(x,y) is NOT clipped if x is more than the minimum value of x and
less than the maximum value of x. Mathematically, it can be written as “xwmin ≤ x ≤
xwmax“.

9. For a point to be clipped, which of the following conditions must be satisfied by the
point?
a) ywmin < y < ywmax
b) ywmin > y > ywmax
c) ywmin = y = ywmax
d) xwmin < x < xwmax
View Answer
Answer: b
Explanation: A point P(x,y) is NOT clipped if y is more than the minimum value of y and
less than the maximum value of y. Mathematically, it can be written as “ywmin ≤ y ≤
ywmax“.

10. Which type of clipping is used to clip character strings?

a) text clipping
b) line clipping
c) sentence clipping
d) word clipping
View Answer
Answer: a
Explanation: Text clipping is the algorithm which is used to clip character strings. It
depends on the methods which are used to generate original characters.

11. In polygon clipping, line clipping algorithms can be used.

a) True
b) False
View Answer
Answer: a
Explanation: Polygon is a two dimensional shape formed by straight lines. So we can
conclude, polygon’s basic components are lines, hence line clipping algorithm can be
used for polygon clipping.

his set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses
on “Clipping Operations”.

1. What is the primary use of clipping in computer graphics?

a) adding graphics
b) removing objects and lines
c) zooming
d) copying
View Answer
Answer: b
Explanation: The primary use of clipping in computer graphics is to remove objects,
lines, or line segments that are outside the viewing pane.

2. A polygon can be clipped using clipping operations.

a) True
b) False
View Answer
Answer: a
Explanation: A polygon can also be clipped by specifying the clipping window.
Sutherland Hodgeman polygon clipping algorithm is used for polygon clipping.

3. Which vertex of the polygon is clipped first in polygon clipping?

a) top right
b) bottom right
c) bottom left
d) top left
View Answer
Answer: d
Explanation: In polygon clipping, first the polygon is clipped against the left edge of the
polygon window to get new vertices of the polygon. So, it is the top left which is clipped
first.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement
4. How many methods of text clipping are there?
a) 5
b) 4
c) 3
d) 2
View Answer
Answer: c
Explanation: There are three methods for text clipping which are −
1) All or none string clipping 2) All or none character clipping 3) Text clipping.

5. A bitmap is collection of ___________________ that describes an image.

a) bits
b) colors
c) algorithms
d) pixels
View Answer
Answer: d
Explanation: A bitmap is a collection of pixels that describe an image. It is a type of
computer graphics that the computer uses to store and display pictures.

Check this: MCA Books | MCA MCQs

6. We can change the size or resize the bitmap image.

a) True
b) False
View Answer
Answer: b
Explanation: We can’t resize the bitmap image. When the bitmap image is resized, the
image pixels get distorted. It is one of the main disadvantages of the bitmap.

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
View Answer
Answer: a
Explanation: Line clipping follows the same algorithm that is in the case of point
clipping. So, in line clipping also, we will cut the portion of the line which is outside of
the window and keep only the portion that is inside the window.

8. ‘Skala’ is an example of which type of clipping?

a) curve clipping
b) point clipping
c) polygon clipping
d) line clipping
View Answer
Answer: d
Explanation: Skala is a type of clipping operation which can be used for a line or line-
segment clipping against a rectangular window, as well as against a convex polygon. Its
algorithm is based on homogenous co-ordinates and duality.

9. ‘Vatti’ clipping algorithm is used in _________________

a) curve clipping
b) point clipping
c) polygon clipping
d) line clipping
View Answer
Answer: a
Explanation: Vatti is used in polygon clipping. It allows clipping of any number of
arbitrarily shaped subject polygons. It can also be used to clip any number of arbitrarily
shaped polygons.

10. The process of removal of hidden surfaces is termed as _______________

a) clipping
b) copying
c) culling
d) shorting
View Answer
Answer: c
Explanation: An area which is related to the visible surface determination (VSD) is called
culling. ‘Viewing frustum culling’ and ‘Backface culling’ are examples of some culling
algorithms.

1. Cohen-Sutherland clipping is an example of _________________

a) polygon clipping
b) text clipping
c) line clipping
d) curve clipping
View Answer
Answer: c
Explanation: It is a type of algorithm which is used for line clipping or in other words it
is line clipping algorithm. Other examples of line clipping algorithms are a Liang-Barsky
algorithm and Cyrus-Beck algorithm.

2. The Cohen-Sutherland algorithm divides the region into _____ number of spaces.
a) 8
b) 6
c) 7
d) 9
View Answer
Answer: d
Explanation: The Cohen-Sutherland algorithm divides a two-dimensional space into 9
regions and then efficiently determines the lines and portions of lines that are visible.
The portions are visible in the central region of interest.

3. 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
View Answer
Answer: b
Explanation: A small integer holding a bit for the result of every plane test failed in
clipping is termed as outcode. Primitives may be trivially rejected if the bitwise of all its
vertices outcodes is non zero.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate
Now!
advertisement
4. 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
View Answer
Answer: a
Explanation: The outcode will have 4 bits for two-dimensional clipping, or 6 bits in the
three-dimensional case. The first bit is set to 1 if the point is above the viewport. The
bits in the 2D outcode represent: top, bottom, right, left.

5. The centre region of the screen and the window can be represented as________
a) 0000
b) 1111
c) 0110
d) 1001
View Answer
Answer: a
Explanation: In any co-ordinate system, the origin is the centre of the various axis and
is represented as (0,0). So in this case also the origin, or the centre of the window, will
be represented as 0000.

6. The Cohen–Sutherland algorithm can be only be used on a rectangular clip window.

a) True
b) False
View Answer
Answer: a
Explanation: The Cohen–Sutherland algorithm can be used only on a rectangular clip
window. For other convex polygon clipping windows, use the Cyrus–Beck algorithm.

Check this: Information Science MCQs | Computer Science MCQs

7. 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
View Answer
Answer: c
Explanation: To perform the trivial acceptance and rejection tests, we extend the edges
of the window to divide the plane of the window into the nine regions. If both codes are
0000 and 1111, (bitwise OR of the codes yields 0000) line lies completely inside the
window and outside the window respectively.

8. The 4-bit code of top-left region of the window is ____________

a) 1001
b) 1100
c) 0101
d) 1010
View Answer
Answer: a
Explanation: The sequence for reading the codes’ bits is LRBT (Left, Right, Bottom, Top).
Since it is in the top-left corner of the window, hence its code will be 1001.

9. The 4-bit code of bottom-right region of the window is ____________

a) 1001
b) 0101
c) 1010
d) 0110
View Answer
Answer: d
Explanation: The sequence for reading the codes’ bits is LRBT (Left, Right, Bottom, Top).
Since it is in the bottom-right corner of the window, hence its code will be 0110.

10. If the logical AND of the endpoint codes is NOT zero, the line can be trivially
accepted.
a) True
b) False
View Answer
Answer: b
Explanation: Once the codes for each endpoint of a line are determined, the logical
AND operation of the codes determines if the line is completely outside of the window.
If the logical AND of the endpoint codes is not zero, the line can be trivially rejected and
if it is zero, then only it is accepted.

11. The logical ______ of the endpoint codes determines if the line is completely inside
the window.
a) AND
b) OR
c) NOT
d) NOR
View Answer
Answer: b
Explanation: The logical OR of the endpoint codes determines if the line is completely
inside the window. If the logical OR is zero, the line can be trivially accepted. For
example, if the endpoint codes are 0000 and 0000, the logical OR is 0000 – the line can
be trivially accepted.

Computer Graphics Questions & Answers – Liang-

Barsky Line Clipping
« Prev
Next »
This set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on
“Liang-Barsky Line Clipping”.

1. Liang–Barsky algorithm is a __________ clipping algorithm.

a) circle
b) text
c) line
d) pixel
View Answer
Answer: c
Explanation: Liang–Barsky algorithm is a line clipping algorithm. The Liang–Barsky
algorithm uses the parametric equation of a line for clipping operations.

2. 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
View Answer
Answer: a
Explanation: The ideas for clipping line of Liang-Barsky and Cyrus-Beck are the same.
The only difference is Liang-Barsky algorithm has been optimized for an upright
rectangular clip window.

3. Liang Barsky algorithm can be used to clip 3-D lines.

a) True
b) False
View Answer
Answer: a
Explanation: Liang Barsky algorithm can be used for 1-D lines, 2-D lines, and 3-D line
clipping. This algorithm can be used for line clipping of 4-D lines too.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
4. This algorithm uses the ____________ equations for a line and solves four inequalities.
a) linear
b) quadratic
c) cubic
d) parametric
View Answer
Answer: d
Explanation: This algorithm uses the parametric equations for a line and solves four
inequalities to find the range of the parameter for which the line is in the viewport.

5. The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm.
a) True
b) False
View Answer
Answer: a
Explanation: Liang–Barsky clipping algorithm does as much testing as possible before
computing line intersections, hence it is much more efficient than others.

Check this: MCA MCQs | Computer Science Books

6. When the line is parallel to the boundaries then what is the value of pk?
a) pk < 0
b) pk > 0
c) pk = 0
d) pk = 1
View Answer
Answer: c
Explanation: When pk < 0 line starts exceeding the boundary while if pk > 0 line is
bounded inside the boundary. When the line is parallel then pk = 0.

7. Which type of arithmetic is used in Liang Barsky algorithm?

a) simple arithmetic operations
b) floating point arithmetic
c) fixed point arithmetic
d) logarithmic operations
View Answer
Answer:b
Explanation: Liang and Barsky have created an algorithm that uses floating-point
arithmetic but finds the appropriate endpoints with at most four computations with
use of parametric equations.

8. When pk < 0, then the line is ___________

a) parallel to the boundaries
b) exceeding the boundaries
c) bounded inside the boundaries
d) can’t say
View Answer
Answer: b
Explanation: When pk < 0 line starts exceeding the boundary while if pk > 0 line is
bounded inside the boundary. When the line is parallel then pk = 0.

9. How many inequalities are solved in this algorithm?

a) 3
b) 2
c) 1
d) 4
View Answer
Answer: d
Explanation: Liang-Barsky line clipping algorithm solves 4 inequalities to find the range
of the parameter for which the line is in the intersection with the rectangle.

10. What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D
lines?
a) 40%
b) 50%
c) 70%
d) 36%
View Answer
Answer: d
Explanation: The relative speed improvement over Sutherland-Cohen algorithm are: –
36% for 2D lines, 40% for 3D lines, 70% for 4D lines.

Computer Graphics Questions & Answers – Nicholl-Lee-

Nicholl Line Clipping
« Prev
Next »
This set of Computer Graphics MCQs focuses on “Nicholl-Lee-Nicholl Line Clipping”.

1. Cohen Sutherland clipping algorithm computes _______ number of intersections than

NLN line clipping.
a) more
b) less
c) same
d) can’t be predicted
View Answer
Answer: a
Explanation: One of the problems common to both the Cohen-Sutherland and the
Liang-Barsky algorithm is that more intersections are computed than necessary.

2. Liang-Barsky clipping algorithm computes _______ number of intersections than NLN

line clipping.
a) more
b) less
c) same
d) can’t be predicted
View Answer
Answer: a
Explanation: One of the problems common to both the Cohen-Sutherland and the
Liang-Barsky algorithm is that more intersections are computed than necessary.

3. What is full form of NLN line clipping algorithm?

a) Nicholl-Liang-Nicholl algorithm
b) Nicholai-Liang-Nicholl algorithm
c) Nicholai-Lee-Nicholl algorithm
d) Nicholl-Lee-Nicholl algorithm
View Answer
Answer: d
Explanation: The full form of NLN clipping algorithm is Nicholl-Lee-Nicholl algorithm. It
is a fast method of clipping.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement
4. A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm.
a) True
b) False
View Answer
Answer: b
Explanation: The Nicholl–Lee–Nicholl algorithm is a fast line clipping algorithm that
reduces the chances of clipping a single line segment multiple times.

5. The area around the clipping window is divided into a number of different
______________
a) pixels
b) squares
c) areas
d) lines
View Answer
Answer: c
Explanation: The area around the clipping window is divided into a number of different
areas, depending on the position of the initial point of the line to be clipped.

Check this: Computer Graphics Books | Information Science MCQs

6. In how many areas the initial point should be present?

a) 3
b) 5
c) 2
d) 8
View Answer
Answer: a
Explanation: The initial point should be in three predetermined areas; so that the line
may have to be translated or rotated to bring it into the desired region.

7. These areas are given names depending on the location of ___________________

a) endpoints
b) initial points
c) intermediate points
d) intersection points
View Answer
Answer:b
Explanation: These areas are then designated as L, LT, LB, or TR, depending on the
location of the initial point.

8. What is the denotation of a ray if it intersects the top boundary?

a) L
b) T
c) P
d) B
View Answer
Answer: b
Explanation: T – ray intersects top boundary; LT – ray intersects left and top boundary.

9. What is the denotation of a ray if it intersects the top and right boundary?
a) RT
b) TR
c) LR
d) LT
View Answer
Answer: b
Explanation: R – ray intersects right boundary; TR – ray intersects top and right
boundary.

10. The division of area is affected by the position of endpoints.

a) True
b) False
View Answer
Answer: b
Explanation: The regions are determined by the property that, no matter where in the
regio

Computer Graphics Questions & Answers – Sutherland-

Hodgeman Polygon Clipping
« Prev
Next »
This set of Computer Graphics Questions and Answers for Entrance exams focuses on
“Sutherland-Hodgeman Polygon Clipping”.

1. Sutherland-Hodgeman clipping is an example of_________________ algorithm.

a) line clipping
b) polygon clipping
c) text clipping
d) curve clipping
View Answer
Answer: b
Explanation: The Sutherland–Hodgman algorithm is used for clipping polygons. Cohen-
Sutherland is line clipping algorithm.

2. How many polygons are used in this method?

a) 4
b) 3
c) 2
d) 1
View Answer
Answer: c
Explanation: Two polygons are used in this algorithm namely clip polygon and subject
polygon.

3. Only vertices from the subject polygon that are on the _______________ are selected.
a) lower half
b) boundary
c) opaque side
d) visible side
View Answer
Answer: d
Explanation: Only vertices from the subject polygon which are on the visible side are
selected and rest of the vertices are clipped.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate

Now!
advertisement
4. 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
View Answer
Answer: a
Explanation: The process is repeated iteratively for each clip polygon side, using the
output list from one stage as the input list for the next. When the process is completed,
a new polygon is generated.

5. 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
View Answer
Answer: c
Explanation: We can correctly clip a polygon by processing the polygon boundary as a
whole against each window edge which can be accomplished by processing all polygon
vertices against each rectangle.

Check this: Information Science MCQs | MCA Books

6. How many edges of the clipping are/is present in 2D?
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: d
Explanation: If the algorithm is done in 2D, we have 4 edges of the clipping area. Left
edge, right edge, top edge and bottom edge.

7. 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
View Answer
Answer: d
Explanation: If we used Left->Right->Up->Bottom, the final output will be the vertex list
outputted by the bottom edge. The final result is given by the last edge which is a
bottom edge in this case.

8. If the subject polygon is concave at vertices outside the clipping polygon, the new
polygon may have coincident edges.
a) True
b) False
View Answer
Answer: a
Explanation: If the subject polygon was concave at vertices outside the clipping
polygon, the new polygon may have coincident edges. The result will be the same in
case of overlapping edges too.

9. In a convex polygon, each of the interior angles is less than ____degrees.

a) 90
b) 180
c) 360
d) 45
View Answer
Answer: b
Explanation: A convex polygon is a simple polygon in which no line segment between
two points on the boundary ever goes outside the polygon and interior angles are less
than 180 degrees.
10. One of the drawbacks of Sutherland- Hodgeman algorithm is that it can’t produce
____________ areas.
a) connected
b) multiple
c) discrete
d) circular
View Answer
Answer: a
Explanation: The Sutherland-Hodgeman algorithm is not able to produce connected
areas. For connected areas, Weiler-Atherton Algorithm is used.

1. How many types of basic polygons are present?

a) 4
b) 2
c) 10
d) 5
View Answer
Answer: b
Explanation: There are two types of basic polygons present. They are concave polygons
and convex polygons. In a concave polygon at least one angle should be greater than
180. In a convex polygon all the angles should be less than 180.

2. A polygon can be a figure whose all edges are not connected with another edge.
a) True
b) False
View Answer
Answer: b
Explanation: In a polygon, all lines are connected. Lines can be a combination of edges
and vertices, which together form a polygon. It is a 2-dimensional shape made by
connecting multiple straight lines.

3. Which of the following part of a polygon is considered in a polygon clipping

algorithm?
a) Part which is both inside and outside the window
b) Part which is outside the window
c) Part which is inside the window
d) Part which is neither inside nor outside the window
View Answer
Answer: c
Explanation: Polygon clipping is a process in which we only consider the part which is
inside the view pane or window. We will remove or clip the part that is outside the
window.
Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters
advertisement
4. Which of the following polygon clipping algorithm can be used to clip a filled area?
a) Sutherland Hodgman Clipping Algorithm
b) Weiler Atherton Clipping Algorithm
c) Vatti Clipping Algorithm
d) Greiner Hormann Clipping Algorithm
View Answer
Answer: b
Explanation: Weiler Atherton Clipping algorithm helps us to clip a filled area. The filled
area may be a convex polygon or concave polygon. This algorithm was introduced to
identify the visible surfaces. This algorithm helps to create individual polygons in some
cases.

5. In Weiler Atherton Clipping Algorithm which of the following is consider to clip a

polygon?
a) Polygon edges and Window boundaries
b) Polygon Vertices
c) Polygon Edges
d) Window boundaries
View Answer
Answer: d
Explanation: In the Weiler Atherton algorithm, we consider the view pane boundaries
instead of edges and vertices of the polygon to clip a polygon. Points very close to the
edge of the other polygon may be considered as both in and out until their status can
be confirmed after all the intersections have been found and verified but this increases
the complexity.

Check this: MCA Books | Computer Graphics Books

6. Which of the following algorithm can be used to clip a self-intersecting polygon?

a) Greiner Hormann Clipping Algorithm
b) Weiler Atherton Clipping Algorithm
c) Vatti Clipping Algorithm
d) Both Vatti and Greiner Hormann Clipping Algorithm
View Answer
Answer: d
Explanation: To clip a self-intersecting polygon we can use the Vatti Clipping Algorithm
as well as the Greiner Hormann Clipping Algorithm. Polygons with holes can also be
clipped using these algorithms. Algorithms like Sutherland-Hodgman and Weiler-
Atherton cannot perform clipping on a self-intersecting polygon.
7. Vatti Clipping Algorithm uses the sweep line approach to clip a polygon.
a) True
b) False
View Answer
Answer: a
Explanation: The Vatti Clipping algorithm uses the sweep line approach to clip a
polygon. In scan line approach the selected polygon is selected and placed upon
imaginary horizontal lines that passes through the polygons every vertex and divides
the polygon on different parts.

8. Greiner Hormann Clipping Algorithm is more efficient than the Vatti Clipping
Algorithm.
a) True
b) False
View Answer
Answer: a
Explanation: The Greiner Hormann Clipping Algorithm works better than the Vatti
Clipping Algorithm. It can work on self-intersecting polygons as well as non-convex
polygons but it cannot work upon polygons having common edges.

9. Which of the following algorithm can be used to clip a polygon in 3D space?

a) Weiler Atherton Algorithm
b) Vatti Clipping Algorithm
c) Greiner Hormann Clipping Algorithm
d) Polygon in 3D space cannot be clipped
View Answer
Answer: a
Explanation: The algorithm that can be used in 3D space as well is Weiler Atherton
Algorithm. It is mostly used in 2D space but can be used in 3D space with the help of Z-
ordering. The Vatti Clipping algorithm and Greiner Hormann Clipping algorithm only
works on 2D space.

10. Which of the following clipping algorithm is based upon the “inside” of a polygon
based on the winding number?
a) Sutherland Hodgman Clipping Algorithm
b) Weiler Atherton Clipping Algorithm
c) Vatti Clipping Algorithm
d) Greiner Hormann Clipping Algorithm
View Answer
Answer: d
Explanation: The Greiner Hormann Clipping algorithm is based upon the “inside” of a
polygon based on the winding number. The winding number of a closed curve in the
plane around a given point is an integer representing the total number of times that
curve travels counter clockwise around the point. The algorithm considers regions with
odd winding number to be inside the polygon.

1. How many axes does a three-dimensional graphics consists of?

a) One axis
b) Two axes
c) Three axes
d) Six axes
View Answer
Answer: c
Explanation: A three-dimensional graphics consists of three axes namely the x axis, the
y axis and the z axis. These axes simulate the length, width and height of a 3-
dimensional object.

2. Which of the following is the most commonly used boundary representation for a 3-
D graphics object?
a) Data polygon
b) Surface polygon
c) System polygon
d) Volume polygon
View Answer
3. A three-dimensional object can be represented using which of the following
representation?
a) Equation
b) Function
c) Point
d) Polygon
View Answer
Answer: a
Explanation: A three-dimensional object can be represented by using an equation
representation. The equation for a 3-dimensional object contains 3 variables x, y and z
and 4 coefficients A, B, C and D.

Note: Join free Sanfoundry classes at Telegram or Youtube

advertisement
4. Which of the following equation correctly represent a 3 D plane?
a) Ax + By + Cz = 1
b) Ax + By + Cz = 0
c) Ax + By + Cz + D = 1
d) Ax + By + Cz + D = 0
View Answer
Answer: d
Explanation: The equation that correctly represent a 3 D plane is Ax + By + Cz + D = 0.
Where x, y, z is any point on the plane, and the coefficients A, B, C, and D are constants
describing the spatial properties of the plane.

5. Which of the following transformations are most common that are applied on three-
dimensional objects?
a) Translation
b) Scaling
c) Rotation
d) Translation, Scaling, Rotation
View Answer
Answer: d
Explanation: Most common transformations that are applied on three-dimensional
objects are Translation, Scaling and Rotation. Translation refers to moving of an object
from its original position. Scaling refers to zooming in or out the size of an object.
Rotation refers to rotating an object about its axis.

Check this: Computer Graphics Books | Computer Science MCQs

6. How many types of projections are present in 3 D graphics?

a) 2
b) 3
c) 5
d) 7
View Answer
Answer: c
Explanation: In 3 D graphics there are 5 types of projections namely – Parallel
Projection, Orthographic Projection, Oblique Projection, Isometric Projection and
Perspective Projection.

7. Which of the following refers to the shapes created by union, intersection and
difference of given shapes?
a) Wire frame model
b) Composite transformation
c) Constructive solid geometry methods
d) Destructive solid geometry methods
View Answer
Answer: c
Explanation: Constructive solid geometry methods refers to the shapes created by
union, intersection and difference of given shapes. In a constructive solid geometry
approach, a solid model of an object is created by using the three-dimensional
geometric entities, known as primitives.
8. Which of the following refer to a model that represent all the dimension of an object
external as well as internal?
a) Wire frame model
b) Constructive solid geometry methods
c) Composite transformation
d) Destructive solid geometry methods
View Answer
Answer: a
Explanation: Wire frame model is used to represent all the dimension of an object
external as well as internal. The wireframe model is made by connecting all the vertices
of an object by either a straight line or a curve. In this model every vertex is connected
with each other.

9. In which of the following, the projection plane is intersected by all three x, y and z
axes at the same distances?
a) Cabinet projection
b) Perspective projection
c) Isometric projection
d) Cavalier projection
View Answer
Answer: c
Explanation: isometric projection is a projection where the projection plane intersects
each coordinate axis in the coordinate system at an equal distance. In this projection
parallelism of lines are preserved but their angles are not preserved.

10. Which of the following constitutes of subcategories of Perspective Projection?

a) Cavalier projection, Cabinet Projection
b) One point, Two point, Three point
c) Front projection, Top projection, Side projection
d) Orthographic projection, Oblique projection
View Answer
Answer: b
Explanation: The Perspective Projection consists of – One point, Two point, Three point.
One point perspective projection is simple to draw. Two point perspective projection
gives better impression of depth. Three point perspective projection is most difficult to
draw.

Sanfoundry Global Education & Learning Series – C

1. Which of the following operation can be applied on a 3 D object to move it along any
axis from its original position?
a) Translation
b) Scaling
c) Rotation
d) Shearing
View Answer
Answer: a
Explanation: The process of translation is applied to move a point along a specified axis
from its original position in the coordinate plane. Translation of a point adds a constant
vector to that point to move it from its original place.

2. If a point (x, y, z) is to be translated by an amount dx, dy and dz respectively, then

what will be the value of the new translated points (x1, y1, z1)?
a) x1 = x
y1 = y
z1 = z
b) x1 = dx
y1 = dy
z1 = dz
c) x1 = x + dx
y1 = y + dy
z1 = z + dz
d) x1 = x – dx
y1 = y – dy
z1 = z – dz
View Answer
Answer: c
Explanation: If point (x, y, z) is to be translated by amount dx, dy and dz to a new
location (x1, y1, z1) then new coordinates can be obtained by adding dx to x, dy to y
and dz to z as:
x1 = dx + x
y1 = dy + y
z1 = dz + z

3. In the equation x1 = dx + x; which part of the equation is called as the translation

factor?
a) x1
b) dx
c) x
d) dx + x
View Answer
Answer: b
Explanation: In the equation x1 = dx + x; dx, is the translation factor, i.e. the amount by
which the point will be translated. x is the original point. x1 is the coordinate of the
point after translation.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate
Now!
advertisement
4. If the original point P = (5, 7, 3) and the translation factor, T = (-2, -1, 3), then what will
be the value of the final point P1?
a) P1 = (7, 8, 6)
b) P1 = (3, 6, 0)
c) P1 = (7, 8, 0)
d) P1 = (3, 6, 6)
View Answer
Answer: d
Explanation: The new coordinates can be obtained by adding dx to x, dy to y and dz to z
as:
x1 = dx + x ; y1 = dy + y ; z1 = dz + z
So, P1 = (5+(-2), 7+(-1), 3+3)
P1 = (3, 6, 6)

5. How many different types of translation are present in computer graphics?

a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation: In computer graphics, there are 3 types of translation techniques namely –
the point translation (deals with a single point), the line translation (deals with a line)
and the polygon translation (deals with a shape).

Check this: MCA Books | Computer Science Books

6. Which of the following matrix equation is correct for 3 D translation?

a) x1[y1]=z11100Tx[010Ty]001Tz0001x0[y0]z01

b) x1[y1]=z111001[010Tx]001Ty000Tzx0[y0]z01

c) x1[y1]=z11100Tx[010Ty]001Tz0001x0[y0]z01

d) x1[y1]=z11000Tx[010Ty]010Tz1000x0[y0]z01
View Answer
Answer: a
Explanation: The correct matrix equation for 3 D translation is –
x1[y1]=z11100Tx[010Ty]001Tz0001x0[y0]z01
First matrix is for the final point, second matrix is for the translation factor and the
Third matrix is for the original point.

7. Which of the following operation can be applied on a 3 D object to zoom it in or out

about any axis from its original position?
a) Translation
b) Scaling
c) Rotation
d) Shearing
View Answer
Answer: b
Explanation: In computer graphics, scaling is a process of modifying or altering the size
of objects. Scaling may be used to increase or reduce the size of object.

8. What will be the value of new co-ordinates if the old co-ordinates are (X0 = 2, Y0 = 0,
Z0 = 4) and the scaling factor is (Sx = 2, Sy = 1, Sz = 3)?
a) (X1 = 4, Y1 = 1, Z1 = 7)
b) (X1 = 0, Y1 = -1, Z1 = 1)
c) (X1 = 1, Y1 = 0, Z1 = 4/3)
d) (X1 = 4, Y1 = 0, Z1 = 12)
View Answer
Answer: d
Explanation: The new co-ordinates would be – (X1 = 4, Y1 = 0, Z1 = 12)
Applying the scaling equations, we have-
X1 = X0 x Sx = 2 x 2 = 4
Y1 = Y0 x Sy = 0 x 1 = 0
Z1 = Z0 x Sz = 4 x 3 = 12

9. Which of the following matrix equation is correct for 3 D scaling of an object?

a) x1[y1]=z11Sx000[0Sy00]00Sz00001x0[y0]z01

b) x1[y1]=z11Sx001[0Sy10]01Sz01000x0[y0]z01

c) x1[y1]=z10Sx000[0Sy00]00Sz00001x0[y0]z00

d) x1[y1]=z11000Sx[00Sy0]0Sz001000x0[y0]z01
View Answer
Answer: a
Explanation: The correct matrix equation for 3 D scaling of an object is –
x1[y1]=z11Sx000[0Sy00]00Sz00001x0[y0]z01
First matrix is for the final point, second matrix is for the scaling factor and the third
matrix is for the original point.

10. If Scaling factor is lesser than 1 then the object size is increased.
a) True
b) False
View Answer
Answer: b
Explanation: The scaling factor of an object is used to determine whether the object is
to scaled up or scaled down. If the scaling factor of the object is greater than 1 then the
object is increased in scale and if the scaling factor of the object is lesser than 1 then
the object is decreased in scale.

uestions & Answers (MCQs) focuses on “3D Rotation – 1”.

1. Which of the following operation can be applied on a 3 D object to rotate it about

any axis from its original position?
a) Translation
b) Scaling
c) Rotation
d) Shearing
View Answer
Answer: c
Explanation: The process of rotation is applied on a 3 D object to rotate it about any
axis from its original position. The rotation of the object can be in clockwise direction or
in anti-clockwise direction. We must specify the angle of rotation and the rotational
point while performing the rotation transformation.

2. The positive value of the pivot point rotates an object in which of the following
position?
a) Clockwise
b) Anti-Clockwise
c) Both Clockwise and Anti-Clockwise
d) Neither Clockwise nor Anti-Clockwise
View Answer
Answer: b
Explanation: An object can be rotated in two ways – either clockwise or anticlockwise. If
the rotation value of pivot point of the object is positive then the object is rotated in
anti-clockwise direction and if the rotation value of pivot point of the object is negative
then the object is rotated in clockwise direction.
3. Which of the following matrix equation is correct for 3 D rotation around x axis?
a) x1[y1]=z111000[0cosθ−sinθ0]0sinθcosθ00001x0[y0]z01

b) x1[y1]=z111000[0cosθsinθ0]0−sinθcosθ00001x0[y0]z01

c) x1[y1]=z111000[0sinθ−cosθ0]0cosθsinθ00001x0[y0]z01

d) x0[y0]=z011000[0cosθ−sinθ0]0sinθcosθ00001x1[y1]z11
View Answer
Answer: a
Explanation: The correct matrix equation for 3 D rotation around x axis is –
x1[y1]=z111000[0cosθ−sinθ0]0sinθcosθ00001x0[y0]z01
First matrix is for the final point, second matrix is the rotation matrix for x axis and the
third matrix is for the original point.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
4. Which of the following matrix equation is correct for 3 D rotation around y axis?
a)x1[y1]=z11cosθ0sinθ1[1011]−sinθ0cosθ01000x0[y0]z01

b) x1[y1]=z11sinθ0sinθ0[0100]−cosθ0cosθ00001x0[y0]z01

c) x1[y1]=z11cosθ0sinθ0[0100]−sinθ0cosθ00001x0[y0]z01

d) x1[y1]=z10cosθ0sinθ0[0100]−sinθ0cosθ01110x0[y0]z00

View Answer
Answer: c
Explanation: The correct matrix equation for 3 D rotation around x axis is –
x1[y1]=z11cosθ0sinθ0[0100]−sinθ0cosθ00001x0[y0]z01
First matrix is for the final point, second matrix is the rotation matrix for y axis and the
third matrix is for the original point.

5. Which of the following matrix equation is correct for 3 D rotation around z axis?
a) x1[y1]=z11sinθ−cosθ00[cosθsinθ00]00100001x0[y0]z01

b) x1[y1]=z11cosθ−sinθ11[sinθcosθ11]00010010x0[y0]z01

c) x1[y1]=z10cosθ−sinθ00[sinθcosθ00]00101110x0[y0]z00
d) x1[y1]=z11cosθ−sinθ00[sinθcosθ00]00100001x0[y0]z01

View Answer
Answer: d
Explanation: The correct matrix equation for 3 D rotation around x axis is –
x1[y1]=z11cosθ−sinθ00[sinθcosθ00]00100001x0[y0]z01
First matrix is for the final point, second matrix is the rotation matrix for z axis and the
third matrix is for the original point.

Check this: Computer Graphics Books | MCA MCQs

6. Every vertex in a polygon is rotated with the same rotation angle.

a) True
b) False
View Answer
Answer: a
Explanation: When we apply 3 D rotation on any three dimensional polygon then the
polygon is rotated by shifting every vertex using the same rotational angle. When the
object is rotated, then every point of the object is rotated by the same angle.

7. Which of the following equation is correct for the new Y co-ordinate if an object
undergoes 3D rotation around x axis?
a) Ynew = Yold x cosθ – Zold x sinθ
b) Ynew = Yold x sinθ – Zold x cosθ
c) Ynew = Yold x cosθ + Zold x sinθ
d) Ynew = Yold x sinθ + Zold x cosθ
View Answer
Answer: a
Explanation: The correct equation for the new Y co-ordinate if an object undergoes 3D
rotation around x axis is – Ynew = Yold x cosθ – Zold x sinθ.
When the matrix form for 3D rotation around x axis is expanded then we get the
following equations – Xnew = Xold; Ynew = Yold x cosθ – Zold x sinθ; Znew = Yold x sinθ
+ Zold x cosθ.

8. Which of the following equation is correct for the new Z co-ordinate if an object
undergoes 3D rotation around y axis?
a) Znew = Yold x cosθ + Xold x sinθ
b) Znew = Yold x cosθ – Xold x sinθ
c) Znew = Yold x sinθ + Xold x cosθ
d) Znew = Yold x sinθ – Xold x cosθ
View Answer
Answer: b
Explanation: The correct equation for the new Y co-ordinate if an object undergoes 3D
rotation around x axis is – Znew = Yold x cosθ – Xold x sinθ.
When the matrix form for 3D rotation around x axis is expanded then we get the
following equations – Xnew = Zold x sinθ + Xold x cosθ; Ynew = Yold; Znew = Yold x cosθ
– Xold x sinθ

Sanfoundry Global Education & Learning Series – Computer Graphics.

his set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on
“3D Composite Transformations”.

1. What does composite transformations means?

a) Transformations that can be done in sequence
b) Transformations that cannot be done in sequence
c) Transformations that can be done simultaneously
d) Transformations that cannot be done simultaneously
View Answer
Answer: a
Explanation: Composite transformations are transforms that may be done in sequence,
hence they can be concatenated. Here we compose two or more than two
transformations together and calculate a resultant transformation matrix by
multiplying all the corresponding transformation matrix conditions with each other.

2. A normal scaling operation also moves the object being scaled from its original
points.
a) True
b) False
View Answer
Answer: a
Explanation: It is true that the normal scaling operation also moves the object being
scaled from its original points. As an object scale from its original points its size
increases due to which its end points changes and it moves from its original position.

3. In terms of a line, which of the following means fixed point scaling?

a) Both endpoints of the line remains same even after scale
b) Both endpoints of the line changes after scaling
c) One endpoint of the line remains same after scaling
d) The line can be scaled only till a fixed point
View Answer
Answer: c
Explanation: Fixed point scaling refers to one endpoint of the line remains same even
after scaling. If we scale a line from both its endpoints then it changes its position so, to
keep an endpoint same we only scale the line with respect to only one of the endpoint.

Subscribe Now: Computer Graphics Newsletter | Important Subjects Newsletters

advertisement
4. Which of the following is the first step in composite transformation performed to
scale a line with a fixed end point?
a) Changing the position of the line so that the origin and the line’s endpoint overlaps
b) Keeping the origin same and scaling the line with respect to the origin
c) Changing the position of the line so that the endpoint and the fixed endpoint of the
line overlaps
d) Keeping the end point same and scaling the line with respect to the endpoint
View Answer
Answer: a
Explanation: The first step in composite transformation performed to scale a line with a
fixed endpoint is to translating the line so that its end coincides with the origin. After
this step only that endpoint is scaled which is not on the origin and then the non-scaled
endpoint is translated back to its original position.

5. Composite transformations increases the number of operations performed in a

series of transformation.
a) True
b) False
View Answer
Answer: b
Explanation: Composite transformation decreases the number of operations
performed in a series of transformation. The resultant matrix is obtained by only
multiplying the given two matrices whereas in simple transformations every single
point of an object has to be multiplied with the given matrix which increases the
operations.

Check this: Computer Graphics Books | Information Science MCQs

6. What should be sequence of transformations that are required to perform rotation

of an object around an arbitrary point?
a) Inverse Translation, Rotation, Translation
b) Scaling, Translation, Rotation
c) Translation, Rotation, Inverse Translation
d) Rotation, Translation, Scaling
View Answer
Answer: c
Explanation: The sequence of transformations that are required to perform rotation of
an object around an arbitrary point is – Translation, Rotation, Inverse Translation.
First the object is translated to origin, then it is rotated and then inverse translated
back to its original point.

Sanfoundry Global Education & Learning Series – Computer Graphics.