Category: Computer Graphics Objective Questions

Computer Graphics multiple choice questions on Bundled Attributes.

1. The function which references a single attribute that specifies how a primitive is to be displayed with that attribute setting is called
a) Individual attribute
b) Unbundled attribute
c) Bundled attribute
d) A or B

Answer: d
Clarification: Individual attribute are also known as unbundled attribute.

2. A particular set of attribute values for a primitive on each output device is chosen by specifying appropriate table index is known as?
a) Individual attribute
b) Unbundled attribute
c) Bundled attribute
d) A or B

Answer: c
Clarification: Bundle attributes specifies group of attribute values. And these values can be bundled into the workstation table.

3. A table for which, a primitive defines groups of attribute values to be used when displaying that primitive on a particular output device is called
a) Bundle table
b) Index table
c) Both a and b
d) None of these

Answer: a
Clarification: None.

4. The choice between a bundled attribute or an unbundled attribute is made by
a) Setting switch
b) Setting bundle table
c) Index table
d) Only a

Answer: d
Clarification: By setting switch the user can change their choice between bundled attribute or an unbundled attribute.

5. Entries in the bundle table for line attributes are set using the function
a) Setlineattributes ()
b) setPolylineRepresentation (ws, li, lt, lc)
c) setPolylineRepresentation()
d) only a

Answer: b
Clarification: Entries in the bundle table for line attributes are set using the function setPolylineRepresentation (ws, li, lt, lc).

6. A poly-line that is assigned a table index value of 3 would be displayed using
a) Dashed line
b) Dotted line
c) Same index
d) All of the mentioned

Answer: a
Clarification: Using dashed line at half thickness the index value of 3 would be displayed.

7. Table entries for bundled area-fill attributes are set using the function
a) setInteriorRepresentation (ws, fi, fs, pi, fc)
b) SetInteriorRepresentation ()
c) Only b
d) Both a and b

Answer: a
Clarification: The function setInteriorRepresentation (ws, fi, fs, pi, fc) can be used to set the bundled area-fill attributes.

8. The choice between a bundled attribute or an unbundled attribute is made by switch called?
a) Aspect flag
b) Aspect ratio
c) Aspect source flag
d) Aspect destination flag

Answer: c
Clarification: We can chose any one of the above attributes by setting switch for each of the attributes.

9. We can check the attribute values by
a) Stating the name of the attribute in the inquiry function
b) Setting attribute values
c) Only a
d) Neither a nor b

Answer: c
Clarification: We can check the attribute values by stating the name of the attribute in the inquiry function.

10. A particular text index value is chosen with the function
a) setTextIndex()
b) settextindex(ti)
c) SetTextIndex(ti)
d) setTextIndex(ti)

Answer: d
Clarification: The function setTextIndex(ti) is used to chose the particular text index value.

Computer Graphics MCQs 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

Answer: a
Clarification: 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

Answer: a
Clarification: 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

Answer: d
Clarification: The full form of NLN clipping algorithm is Nicholl-Lee-Nicholl algorithm. It is a fast method of clipping.

4. A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm.
a) True
b) False

Answer: b
Clarification: 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

Answer: c
Clarification: 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.

6. In how many areas the initial point should be present?
a) 3
b) 5
c) 2
d) 8

Answer: a
Clarification: 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

Answer:b
Clarification: 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

Answer: b
Clarification: 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

Answer: b
Clarification: 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

Answer: b
Clarification: The regions are determined by the property that, no matter where in the region the second point (endpoint) is, the segment will have to be intersected with the same boundaries of the window.

Computer Graphics multiple choice questions on Character Attributes.

1. Which of the following is the basic attribute of a character?
a) Font
b) Size and color
c) Orientation
d) All of the mentioned

Answer: d
Clarification: Font, size, color and orientation are the basic attribute of a character.

2. Attribute can be set for
a) Entire character strings
b) Individual characters defined as marker symbol
c) Neither a nor b
d) Both a and b

Answer: d
Clarification: Character attributes can be set to text as well as marker symbols defined as individual characters.

3. A particular font and associated styles can be set using the function
a) setTextfont (tf)
b) setfont (tf)
c) setFont (tf)
d) setTextFont()

Answer: a
Clarification: The function setTextfont (tf) can be used to set the font and its style. Where “tf” specifies the available fonts style.

4. When a character string is to be displayed, the which color is used to set the pixel value in frame buffer?
a) White color
b) Current color
c) Black color
d) Any color

Answer: b
Clarification: The current color is used to set the pixel value corresponding to the character shape and positions.

5. The Character size is specified by
a) Printers
b) Compositors
c) Frame buffer
d) Both a and b

Answer: d
Clarification: The Character size is specified by printers and compositors in points where 1 point is 0.013837 inch.

6. The distance between the bottom-line and the top-line of the character body is
a) Same for all character
b) Different for all character
c) Same for some character
d) Different for some character

Answer: a
Clarification: The distance between the bottom-line and the top-line of the character body is always same for all the characters.

7. The width of the text or character can be set using the function
a) setCharacterExpansionFactor (cw)
b) SetCharacterExpansionFactor (cw)
c) setCharacterFactor (cw)
d) setCharacterExpansionfactor (cw)

Answer: a
Clarification: In this function the parameter cw (character-width) sets the width of the character.

8.__________ is a single character that can be displayed in different colors and in different sizes.
a) String
b) Marker symbol
c) Only a
d) Symbols

Answer: b
Clarification: A marker symbols can be displayed in any colors and in any size.

9. A function that allows the user to select a particular character to be as marker symbol is
a) setmarkertype (mt)
b) setMarkersymbol(mt)
c) setMarkerType (mt)
d) SETMARKER()

Answer: c
Clarification: None.

10. The orientation for a displayed character string is set according to, which of the following function?
a) Setcharacterupvector()
b) setcharacterUpvector(upvect)
c) setCharacterUpVector(upvec)
d) only b

Answer: c
Clarification: According to the direction of the character up vector, the orientation for a displayed character string is set.

Computer Graphics test on “Line Clipping Using Non Rectangular Clip Windows”.

1. Which method of clipping is based on duality?
a) Skala
b) Sutherland clipping
c) Liam Barsky method
d) NLN clipping

Answer: a
Clarification: Skala is a method of clipping whose algorithm is based on homogeneous coordinates and duality.

2. Which method of clipping is used against convex polygon?
a) Lg N clipping algorithm
b) Skala
c) NLN clipping
d) Sutherland clipping

Answer: b
Clarification: Skala can be used for a line or line-segment clipping against a rectangular window, as well as against a convex polygon.

3. Which algorithm classifies vertices against the given line?
a) P algorithm
b) NLN clipping algorithm
c) Skala
d) O algorithm

Answer: d
Clarification: O algorithm classifies vertices against the given line in the implicit form p: ax + by + c = 0. Another name of O algorithm is Lg N algorithm.

4. O algorithm is also known as __________________
a) Lg N algorithm
b) Lg P algorithm
c) Lg M algorithm
d) Lg O algorithm

Answer: a
Clarification: Another name of O algorithm is Lg N algorithm. This algorithm classifies vertices against the given line in the implicit form p: ax + by + c = 0.

5. Which type of search can be applied to O algorithm?
a) interpolation search
b) binary search
c) simple search
d) hexadecimal search

Answer: b
Clarification: Binary search can be applied to O algorithm which leads to run-time complexity.

6. O algorithm is simple and easy to implement.
a) True
b) False

Answer: b
Clarification: Skala is simple and easy to implement whereas O algorithm shows run time complexity.

7. The polygon is assumed to be _____________ and vertices are ordered clockwise or anti-clockwise while applying line clipping algorithms.
a) cylindrical
b)concave
c) plane
d) convex

Answer: d
Clarification: The polygon is assumed to be convex and vertices are ordered clockwise or anti-clockwise while applying line clipping algorithms. Anti-convex polygons are not used.

8. A plane duality is a map from a ______________________ to its dual plane.
a) projective plane
b) incident plane
c) parallel plane
d) reference plane

Answer: a
Clarification: A plane duality is a map from a projective plane C = (P, L, I) to its dual plane C∗ = (L, P, I); which preserves incidence.

9. Fast clipping algorithm is an example of ____________ clipping algorithm.
a) text
b) polygon
c) line
d) curve

Answer: c
Clarification: Line clipping is the process of removing lines or portions of lines outside an area of interest and fast clipping algorithm is an example of line clipping algorithm.

10. Fast clipping algorithm has similarities with Liam Barsky algorithm.
a) True
b) False

Answer: b
Clarification: Fast clipping algorithm has similarities with Cohen–Sutherland. The start and end positions are classified by which portion of the 9-area grid they occupy, in both of the algorithms.

Computer Graphics Multiple Choice Questions & Answers (MCQs) on “Character Generation”.

1. Which of the following is a video editing tool that produces an animated text which can be inserted into video streams?
a) Character generator
b) Title generator
c) Video generator
d) Animation generator

Answer: a
Clarification: Character generator also called as CG in video editing is the software or hardware that produces animated text video streams.

2. Is it possible to have hardware as character generator?
a) True
b) False

Answer: a
Clarification: Character generators can be both hardware or software. Hardware character generators are used in television studios and video editing suites, whereas software CG(s) are used in animation.

3. Which type of character generators are used in television production studios?
a) Hardware character generators
b) Software character generators
c) Both Hardware and software character generators can be used
d) Title generators are used

Answer: a
Clarification: Generally, only Hardware character generators are used in television studios. They provide a key signal. While the compositing vision mixer can use an alpha channel to determine which areas of the CG video are translucent.

4. Why aren’t camcorder CG used more frequently in the titler market?
a) They don’t record for longer time period
b) They use a background of video for title super imposition
c) They have low storage capacity
d) They are not economically feasible

Answer: c
Clarification: They have 2 drawbacks, first is that you have to give titles as you shoot and second, they have very low capacity in comparison to others.

5. How many Methods of character generations are there?
a) 2
b) 3
c) 4
d) 5

Answer: b
Clarification: There are three methods. Those 3 methods are Stroke method, Bitmap method and Starbust method. Each of them has different types of function.

6. Which method of character generation is also called Dot-matrix method?
a) Stroke method
b) Bitmap method
c) Starbust method
d) There isn’t that type of method

Answer: b
Clarification: Bitmap method is also called a dot-matrix method as it uses arrays of dots for character generation. These dots are the points for an array whose size is fixed.

7. In which method, graph is used in form of line to line?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method

Answer: a
Clarification: In Stroke method, graph is drawn in the form of line by line. Line drawing algorithm DDA follows this method for line drawing.

8. In which method, fixed pattern of a line is used to generate characters?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method

Answer: c
Clarification: In Starbust method, a combination of 24bit line segment is used. It is a method in which there is a particular pattern where only 24 strokes are defined for character generation.

9. Which method has the poorest character quality?
a) Stroke method
b) Bitmap method
c) Starbust method
d) Dot-matrix method

Answer: c
Clarification: Character quality is poor in Starbust method and is worse for curved characters. Whereas in Bitmap method and stroke method, it is very good as they use new technologies.

10. Character generators can produce _________________
a) Different type size but same fonts
b) Same type size but different fonts
c) Same type size and fonts
d) Different type size and fonts

Answer: d
Clarification: Character generators can produce different type sizes and fonts depending on the requirement. You can alter the type, size as well as colour of fonts too using character generators.

11. Font colours can be changed using character generators.
a) True
b) False

Answer: a
Clarification: Simple systems offer eight colours: black, white, yellow, red, magenta, blue, cyan and green. More sophisticated systems offer millions of colours.

Computer Graphics Questions and Answers for Entrance exams 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

Answer: b
Clarification: 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

Answer: c
Clarification: 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

Answer: d
Clarification: Only vertices from the subject polygon which are on the visible side are selected and rest of the vertices are clipped.

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

Answer: a
Clarification: 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

Answer: c
Clarification: 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.

6. How many edges of the clipping are/is present in 2D?
a) 1
b) 2
c) 3
d) 4

Answer: d
Clarification: 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

Answer: d
Clarification: 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

Answer: a
Clarification: 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

Answer: b
Clarification: 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

Answer: a
Clarification: The Sutherland-Hodgeman algorithm is not able to produce connected areas. For connected areas, Weiler-Atherton Algorithm is used.