1. A bitmap is collection of ___________________ that describes an image.
a) bits
b) colors
c) algorithms
d) pixels
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.
2. We can change the size or resize the bitmap image.
a) True
b) False
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.
3. 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
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.
4. ‘Skala’ is an example of which type of clipping?
a) curve clipping
b) point clipping
c) polygon clipping
d) line clipping
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.
5. ‘Vatti’ clipping algorithm is used in _________________
a) curve clipping
b) point clipping
c) polygon clipping
d) line clipping
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.
6. The process of removal of hidden surfaces is termed as _______________
a) clipping
b) copying
c) culling
d) shorting
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.
7. Cohen-Sutherland clipping is an example of _________________
a) polygon clipping
b) text clipping
c) line clipping
d) curve clipping
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.
8. The Cohen-Sutherland algorithm divides the region into _____ number of spaces.
a) 8
b) 6
c) 7
d) 9
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.
9. 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
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.
10. 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
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.