Assignment 01
1. What is the difference between Raster and Random Scan?
2. Distinguish between pixel ratio and aspect ratio.
3. What do you understand by shadow mask CRT? Give its advantages and
disadvantages.
4. Consider two raster systems with resolutions of 640* 480 and 1280* 1024.
How many pixels could be accessed per second in each of these systems by a
display controller that refreshes the screen at a rate of 60 frames per second?
5. Consider the line from (5, 5) to (13, 9). Use the bresenham algorithm
to rasterize the line.
6. Elaborate the midpoint circle generating algorithm, outlining its principles
and benefits.
7. Explain the function of a video controller in a graphics system.
8. Discuss in detail the two primary types of computer graphics: vector graphics
and raster graphics. Compare and contrast their fundamental characteristics,
applications, and advantages in various industries.
9. Explain the fundamental characteristics of Digital Differential Analyzer (DDA) and
Bresenham's line drawing algorithms, discussing their respective strengths and
weaknesses in rendering lines in computer graphics.
10. What are the applications of Computer graphics?
11. How many clippers are used by Sutherland Hodgeman for polygon clipping?
12. Define aspect ratio and types of retracing?
13. Why do we need Video Controller? Also define the architecture of Raster Scan
System?
14. What are the disadvantages of DDA algorithm? Also write Bresenham’s Line
Drawing algorithm for negative slope.
15. Write Mid-Point Circle algorithm and predict the pixels in any octant of circle for
radius =12 pixels with its centre at origin?
16. What are the components of computer graphics?
17. Explain aliasing and ant aliasing.
18. Explain curve clipping and text clipping with examples.
19. What is the difference between Bresenham and DDA Line drawing algorithms?
20. What do you understand by shadow mask CRT? Give its advantages and
disadvantages
21. .
22.
Assignment 02
1. Use the Cohen –Sutherland algorithm to clip line P 1 (70, 20) and P2 (100, 10)
against a window lower left hand corner (50, 10) and upper right hand
corner (80, 40).
2. Obtain the mirror reflection of the triangle formed by the vertices A(0,3),B(2,0)
and C(3,2) about the line passing through the points (1,3) and (–1, –1).
3. What do you understand by clipping? Give Liang Barsky’s line clipping
algorithm.
4. Define composite transformations and illustrate how they are constructed by
combining basic transformations. Explain with examples how multiple
transformations are applied successively to achieve a composite
transformation.
5. Compare and contrast the Cohen-Sutherland and Liang-Barsky algorithms in
terms of their computational complexity, efficiency, and handling of various
types of clipping scenarios
6. What are the criteria that should be satisfied by a good line drawing
algorithm? Explain.
7. Translate the square ABCD whose co-ordinates are A(0,0), B(3,0), C(3,3) and
D(0,3) by 2 units in both directions and then scale it by 1.5 units in x-direction
and 0.5 units in y-direction.
8. Elaborate on curve clipping techniques in computer graphics. Discuss the
challenges and methods involved in clipping curves, highlighting the key
algorithms used.
9. Explain Window-to-Viewport transformation in detail.
10. Why are Homogeneous co-ordinates used for transformation computations in
computer graphics?
11. What do you mean transformation in computer graphics?
12. Describe Cohen Sutherland line Clipping Algorithm what is its limitations?
13. Describe Weiler Atherton Polygon Clipping Algorithm with example.
14. Given a clipping window A(20,20),B(60,20), C(60,40),D(20,40).Using Sutherland Cohen
Algorithm find the visible portion of line segment joining the points P(40,80),Q(120,30).
15.
