Question Bank CG
Question Bank CG
QUESTION BANK
SEMESTER V
UNIT I
SHORT NOTES: -
1. LCD
2. DDA Line Algorithm
3. Color CRT Monitors
4. Virtual Reality
5. Framework for Interactive Graphics
6. Antialiasing
7. Frame Buffer
8. Plasma Panels
9. Computer Graphics
10. Bit map, Pixel map and Resolution.
11. Aspect Ratio
12. Pixel
13. Interlacing
14. CRT
15. Horizontal and vertical retrace
16. Types of computer graphics
17. Refresh CRT
18. Persistence
19. Area Sampling
20. Raster Scan
21. Random Scan
22. DVST
23. Emissive Vs Non Emissive Displays
24. Scan Conversion
25. Scan Conversion of line using slope intercept equation
26. What is the eight-way symmetry of a circle?
LONG ANSWERS: -
1. What is the Conceptual framework of Interactive Graphics? What are its advantages?
2. Differentiate between Random Scan and Raster Scan Display.
3. How does Bresenham’s Line Drawing Algorithm work? Derive its equations.
4. What is Antialiasing? What is the need for antialiasing? Explain its different
techniques.
5. What is Bresenham’s Circle Drawing Algorithm? Explain its working and derive its
equations.
6. Explain Midpoint Circle drawing Algorithm.
7. Numericals on DDA, Bresenham Line and Bresenham Circle.
8. What are the different types of flat panel displays?
UNIT II
Short Notes: -
1. What is Clipping? Explain different types of clipping.
2. What is point clipping? Write the conditions for point clipping.
3. Explain Window to Viewport Clipping.
4. What is homogeneous coordinate system?
5. What is the matrix representation of 2-D rotation?
6. What is the significance of 4-bit code of line clipping?
7. What are the types of transformations?
8. What are basic Geometric transformations?
9. What is translation? Give example.
10. What is scaling? Give example.
11. What is rotation? Give example.
12. What is reflection? Give example.
13. What is reflection? Discuss all the cases of reflection and give all the matrix.
14. What is shearing? Write the matrix.
15. What are 3D Transformations? Discuss the different 3-D transformations in brief.
LONG ANSWERS: -
1. Describe Cohen Sutherland algorithm for line clipping with suitable example. Give its
limitations.
2. Explain the working of Cyrus Beck Line Clipping Algorithm.
3. Prove that two successive transformation 2D scaling are multiplicative in nature.
4. Give the transformation matrices for the various 2D transformations in homogeneous
coordinates.
5. Numericals on 2D Transformations.
UNIT III
UNIT IV
1. What is Projection? Explain different types of projection in detail.
2. What are hidden surfaces?
3. Explain depth sorting method of hidden surface removal in detail.
4. What is the difference between orthographic and oblique projection?
5. Explain Z buffer method of hidden surface removal in detail.
6. How is perspective projection different from parallel projection?
7. Explain the concept of vanishing point w.r.t projection.
8. Discuss the painter’s algorithm in brief.
9. Differentiate between Quadtrees and Octrees. (Last Year Ques paper)
10. Differentiate between U and U* Operators (Last Year Ques paper)
11. Prove that blending function of open uniform B-Spline curve is equal to that of
Bezier curve for d=n+1. (Last Year Ques paper)