Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Chapter: 26
Q841:
In which shading model is light calculated for each triangle vertex?
A. Phong
B. Gouraud
C. Lambert
D. Flat
Correct Answer:
B
Chapter: 26
Q842:
Which of the following is not a type of light discussed in the content?
A. Parallel light
B. Directional light
C. Ambient light
D. Point light
Correct Answer:
C
Chapter: 26
Q843:
Phong shading is known for handling __________ more realistically than other models.
A. Shadows
B. Highlights
C. Shadows and highlights
D. Ambient light
Correct Answer:
B
Chapter: 26
Q844:
Spotlights can have a falloff effect between the inner and __________ cones.
A. Outer
B. Internal
C. Normal
D. Point
Correct Answer:
A
Chapter: 26
Q845:
Which shading model uses the vertex normal averaged over shared polygons?
A. Phong
B. Lambertian
C. Gouraud
D. Flat
Correct Answer:
C
Chapter: 26
Q846:
The purpose of attenuation in lighting calculations is to adjust light intensity based on __________.
A. Distance
B. Angle
C. Time
D. Direction
Correct Answer:
A
Chapter: 26
Q847:
Phong shading is considered __________ to implement in real-time rendering.
A. Easy
B. Moderate
C. Difficult
D. Incompatible
Correct Answer:
C
Chapter: 26
Q848:
The shading model that uses solid color without a gradient is __________.
A. Phong
B. Gouraud
C. Lambertian
D. Flat
Correct Answer:
C
Chapter: 26
Q849:
In 3D rendering, Gouraud shading is useful for achieving a __________ look.
A. Shiny
B. Smooth
C. Realistic
D. Sharp
Correct Answer:
B
Chapter: 26
Q850:
Point lights in 3D models simulate light emitted from a __________.
A. Large source
B. Small point
C. Parallel direction
D. Directional beam
Correct Answer:
B
Chapter: 27
Q851:
What is the purpose of clipping in graphics?
A. To limit the effect of graphics to a specific region
B. To enhance image quality
C. To apply filters to images
D. To change the color palette
Correct Answer:
A
Chapter: 27
Q852:
Which of the following is a method for point clipping?
A. Line clipping
B. Point clipping
C. Polygon clipping
D. Image clipping
Correct Answer:
B
Chapter: 27
Q853:
The default clipping rectangle is the _______.
A. Full canvas
B. Clipping rectangle
C. Screen window
D. Clipping polygon
Correct Answer:
A
Chapter: 27
Q854:
The Cohen-Sutherland algorithm is efficient when out-code testing can be done _______.
A. Cheaply
B. Slowly
C. Using complex calculations
D. Through bit-wise operations
Correct Answer:
A
Chapter: 27
Q855:
The Liang-Barsky algorithm is more efficient than the Cohen-Sutherland algorithm because _______.
A. It reduces the number of intersection calculations
B. It uses more divisions
C. It clips more polygons
D. It is slower
Correct Answer:
A
Chapter: 27
Q856:
Polygon clipping for unfilled polygons can be done using _______ techniques.
A. Line-clipping
B. Polygon-clipping
C. Bit-mapping
D. Transformational
Correct Answer:
B
Chapter: 27
Q857:
The Sutherland-Hodgeman algorithm clips a polygon by testing against _______ edges.
A. Two
B. Three
C. Four
D. Five
Correct Answer:
C
Chapter: 27
Q858:
Which algorithm is used to clip polygons with holes?
A. Weiler-Atherton algorithm
B. Sutherland-Hodgeman algorithm
C. Polygon-clipping algorithm
D. Line-clipping algorithm
Correct Answer:
A
Chapter: 27
Q859:
In the Sutherland-Hodgman algorithm, the vertices after clipping against one edge are saved for clipping against _______ edges.
A. Remaining
B. Adjacent
C. Opposite
D. Topmost
Correct Answer:
A
Chapter: 27
Q860:
The limitation of the Sutherland-Hodgman algorithm is that it cannot handle _______ polygons.
A. Concave
B. Convex
C. Circular
D. Irregular
Correct Answer:
A