Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 5

Computer Graphics Question Bank

UNIT 1 Short Answer Questions: 1. Explain the term Computer Graphics. 2. Discuss the types of computer graphics. 3. Write the important applications of computer graphics. 4. Differentiate between Raster and Vector Graphics. 5. Differentiate between bitmap and pixmap. 6. Explain the components of CRT in brief. 7. Compare the merits and demerits of raster scan and flat panel displays. 8. Briefly explain plasma panel display. 9. Explain the working of LCD. 10.List the advantages of interactive graphics. 11.Explain the working of direct view storage tubes(DVST), give advantages and disadvantages also. 12. Define pixel and pixel value. 13.How DDA differs from Bresenhams Line drawing algo. 14.Discuss and explain Bresenhams algo for circle generation. 15.What is meant by anti aliasing? Numerical: 1. Implement the DDA algo and show how it draws a line whose end points is (4,4) and (-3,0). 2. Consider the line from 0,0 to 4,6. Use the simple DDA algo to rasterize the line. 3. Consider the line from 0, 0 to -6,-6. Use the simple DDA algo to rasterize the line. 4. Consider the line from 20, 10 to 30,18. Use the simple DDA algo to rasterize the line. 5. Consider the line from 5, 5 to 13,9. Use the Bresenhams algo to rasterize the line. 6. Consider the line from 10, 20 to 18,30. Use the Bresenhams algo to rasterize the line.

7. Consider the line from 0,0 to 6,6. Use the simple DDA algo to rasterize the line. UNIT 2 Short Answer Questions: 1. Write a procedure for rotation and translation transformation. Derive reflection metrics for reflection about X axis. (2009-2010, 10 marks) 2. Why are homogenous coordinates used for transformation computation in computer graphics? 3. How do you perform shear in two dimensions. 4. What is clipping and clip window? 5. Define Window and Viewport. 6. 7. Write and compare Cohen-Sutherland line clipping and Liang-Barsky line clipping. [2009-2010 ,10 marks] 8. What is window to view point coordinate transformation. Numerical: 1. Translate a square ABCD with coordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units in x direction and 3 units in y direction. 2. Scale the square ABCD with coordinates A(0,0), B(3,0), C(3,3), D(0,3) 3 units in x and y direction. 3. Rotate an object defined by coordinates A (0, 0), B (1, 0), C (1, 1), D (0, 1) by 45 about origin. 4. Obtain a matrix for an object by 45 about origin. 5. Calculate the coordinates after shearing transformation on the square A(0,0), B(2,0), C(2,2) and D(0,2) when shearing factors are 2 and 4. 6. Prove that two scaling transformations are commute i.e. S1S2=S2S1. 7. Prove that two 2D rotations about the origin are commute i.e. R1R2=R2R1. 8. Perform a 45 rotation of triangle A(0,0), B(1,1), C(5,2) a. About the origin. b. About the point (-1,-1). 9. The triangle ABC is A (0, 0) B (5, 0) and C (0, 5). The shearing transformation with x=3 and y=4.

10. A triangle ABC is A (2, 2) B (4, 2) and C (4, 4). Find the transformed coordinates when a. 90 rotation about origin. b. Reflection about line y=-x. 11.Translate the square ABCD whose coordinates are A(0,0), B(3,0), C(3,3), D(0,3) by 2 units in both direction and then scale it by 1.5 units in x direction and 0.5 units in y direction. 12.Find the transformation matrix that transforms the square ABCD whose center is at (2, 2) is reduced to half of its size, with center still remaining at (2, 2). The coordinates are A (0, 0), B (0, 4), C (4, 4), D (4, 0). 13.Consider a square A (1, 0), B (0, 0), C (0, 1), D (1, 1). Rotate the square ABCD by 45 clockwise about A (1, 0). 14.Magnify the triangle with vertices A (0, 0), B (1, 1), C (5, 2) to twice its size while keeping C (5,2) fixed. 15.Prove that 2D rotation and scaling is commutative if Sx=Sy or = n(hint R.S=S.R if Sx=Sy) 16.The reflection along the line y=x is equivalent to the reflection along the x axis followed by counter clockwise rotation by degrees. Find the value of . 17.Show that reflection through x axis followed by reflection through the line y=-x is equivalent to rotation about the origin. 18.Show that reflection through the line y=-x is equivalent to reflection relative to y axis followed by counter clockwise rotation by 90. 19. A mirror is placed vertically such that it passes through the points (10,0) and (0,10). Find the reflected view of triangle ABC with coordinates A(5,5) B(20,40) and C(10,70). 20.Prove that simultaneous shearing in both direction(x & y direction) is not equal to composition of shear along x axis followed by shear in y axis. 21.Write a 2x2 transformation matrix for each of the following rotations about the origin: a. Counter clockwise by b. Counter clockwise by /2 c. Clockwise by /2 d. Counter clockwise by 5/4

22. Find out the final coordinates of a figure bounded by the coordinates (1,1) , (3,4), (5,7) and (10,3) when rotated about a point (8,8) by 30 in clockwise direction and scaled by two units in x direction and 3 units in y direction. 23.Find the reflection of a point A (5,9) about the line y=x+5. 24.Let R be the rectangular window whose lower left-hand corner is at L(3,1) and upper right-hand corner is at R (2,6). If the line segment is defined with two points with A(-4,2) and B(-1,7). 25. Use cohen Sutherland algorthim to find the visible portion of the line P(40,80) Q(120,30) inside the window, the window is defined as ABCD: A(20,20) B(60,20) C(60,40) and D(20,40). 26.Use Cohen Sutherland algorithm to clip line P1(70,20) and P2(100,10) against a window lower left corner (50,10) and upper right hand corner(80,40). 27.Given a clipping window A (20, 20) B(60,20) C(60,40) D(20,40). Using Cohen Sutherland Algorithm find the visible portion of line segment joining the points P (40,80) Q(120,30). 28. A clipping window ABCD is specified as A(0,0) B(40,0) C(40,40) D(0,40). Using midpoint subdivision algorithm, find the visible portion. If any of the line segment joining the points P(-10,20) and Q(50,10). 29.Given a clipping window P (0, 0) Q (30,0) R(30,20) S(0,20). Using Cohen Sutherland Algorithm find the visible portion of line segment joining the points A (10,30) B(40,0). 30. Suppose that a window has its lowest left corner at (-2,-1) and its upper right corner at (3,2). Using Sutherland Cohen Line Clipping algo find the visible portion if any of the line segment joining the points (-3,1) and (1,2). 31.A window is defined as (0,0) (1023,0) (1023,1023) and (0,1023). Using Cohen Sutherland algorithm clip the line P1(-307,631) P2(820,-136). 32.A window is defined as (0,0) (1023,0) (1023,1023) and (0,1023). A line P(-307,631) Q(820,-136) is passing through the window. Use Midpoint Subdivision algorithm find out the visible portion of the line. 33. A clipping window is specified as (0,0) (40,0)(40,40)(0,40). A line having end points P (-20,70) Q(20,30) is passing through window. Use midpoint algorithm to clip the line.

You might also like