This set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on “Curve, Text and Exterior Clipping – 2”. 1. Clipping in computer graphics is primarily used for which of the following function? a) Zooming In a picture b) Copying a picture c) Removing objects and lines from a picture d) Zooming out a … Read more
This set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on “Curve, Text and Exterior Clipping – 1”. 1. Which of the following can be first used to test for overlap of a curve with the clipping window? a) Edges of the curve b) The centre of the curve c) The bounding rectangle … Read more
This set of Computer Graphics Multiple Choice Questions & Answers (MCQs) focuses on “Other Polygon Clipping Algorithms”. 1. How many types of basic polygons are present? a) 4 b) 2 c) 10 d) 5 2. A polygon can be a figure whose all edges are not connected with another edge. a) True b) False 3. … Read more
This section of our 1000+ Computer Graphics multiple choice questions focuses on Anti Aliasing. 1. The distortion of information due to low-frequency sampling is known as a) Sampling b) Aliasing c) Inquiry function d) Anti-aliasing 2. To avoid losing information from periodic objects we need a) Sampling frequency twice b) Nyquist sampling frequency c) Both … Read more
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 2. How many polygons are used in this method? a) 4 b) 3 c) 2 d) 1 3. Only … Read more
This set of Computer Graphics test focuses 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 2. Which method of clipping is used against convex polygon? a) Lg N clipping algorithm b) Skala c) NLN … Read more
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 2. Liang-Barsky clipping algorithm computes _______ number of intersections than NLN line clipping. a) more b) less c) same d) … Read more
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 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 … Read more
This set of Computer Graphics Questions and Answers for Experienced people focuses on “Cohen-Sutherland Line Clipping”. 1. Cohen-Sutherland clipping is an example of _________________ a) polygon clipping b) text clipping c) line clipping d) curve clipping 2. The Cohen-Sutherland algorithm divides the region into _____ number of spaces. a) 8 b) 6 c) 7 d) … Read more
This 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 2. A polygon can be clipped using clipping operations. a) True b) False 3. Which vertex of … Read more
