## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Set No. 1

III B.Tech I Semester Supplementary Examinations, February 2007 COMPUTER GRAPHICS ( Common to Information Technology and Electronics & Computer Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Explain the terms i. Framebuﬀer ii. Resdution (b) Suppose an RGB raster system is to be designed using and 8 inch by 10 inch screen with a resolution of 100 pixels per inch in each direction. If we want to store 6 bits per primary color per pixel, how much storage (in bytes) do we need for the frame buﬀer? [10+6] 2. What is meant by aliasing? Discuss about the two antialiasing methods. [6+5+5] 3. (a) List the basic transformations which cause the physical distortion in the transformed object. (b) An object point P(x,y) is translated in the direction U = aI + bJ and simultaneously an observer moves in the direction U. Show that there is no apparent motion of the object point from the point of view of obsever. [8+8] 4. Find the viewing transformation that maps a window whose left corner is at (1,1) and upper right corner is at (3,5) on to a view port that has lower corner at (0,0) 1 [16] and upper right corner at 2 , 1 . 2 5. (a) Find the mirror reﬂection transformations with respect to three principle planes. (b) The transformation matrix Av denotes the alignment of an arbitrary vector with Z-axis. Give the matrix Av , explain the steps involved n reﬂecting an object about an arbitrary plane. [8+8] 6. (a) What is meant by bilinear interpolation? (b) Discuss about the computational complexity involved in each of the shading algorithms. [8+8] 7. (a) Explain the procedure followed in Bezier’s methods for curve generation. (b) What is the role of control points in Bezier’s approach? 8. Discuss about the graphical languages followed to achieve animation. ⋆⋆⋆⋆⋆ [10+6] [16]

1 of 1

Code No: RR311203

Set No. 2

III B.Tech I Semester Supplementary Examinations, February 2007 COMPUTER GRAPHICS ( Common to Information Technology and Electronics & Computer Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Discuss about the optical scanning mechanism followed in image scanners. (b) Discuss the functioning of joystick. [8+8] 2. (a) Distinguish the merits and demerits of scan line algorithm and ﬂood ﬁll algorithm. (b) Discuss about the super sampling approach followed for antialiasing. [10+6] 3. (a) Show that the composition of two rotations is additive that is, R(ϕ1 ). R(ϕ2 ) = R(ϕ1 + ϕ2 ). (b) Characterize the transformation with suitable matrix formulation, for the fol′ ′ lowing operations: x = x + a.y, y = bx + y. [8 + 8] 4. (a) 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). Find the end bit codes for the following points. i. A(-4,2) ii. B(-1,7) iii. C(-1,5) iv. D(3,8) (b) How do we determine whether a point p(x,y) lies to the left or to the right of a line segment joining the points A(x1 , y1 ) and B(x2 , y2)? [8+8] 5. Distinguish the transformations performed in 2-D graphics and 3-D graphics. Explain how many matrices are needed to deﬁne each of the basic transformations. [8+8] 6. (a) What are the advantages of mini max test in z-buﬀer algorithm? (b) A polygon has a plan equation ax + by + cz + d = 0. Suppose that we know the value of ‘z’ at a point (x, y). What is the easiest way to calculate the value of z at (x + 1,y) and at (x, y + 1)? [8+8] 7. Explain the steps involved in Bezier’s method for curve generation. 8. (a) What is meant by temporal aliasing? (b) Discuss about the linear interpolation based animation techniques. ⋆⋆⋆⋆⋆ 1 of 1 [16] [6+10]

Code No: RR311203

Set No. 3

III B.Tech I Semester Supplementary Examinations, February 2007 COMPUTER GRAPHICS ( Common to Information Technology and Electronics & Computer Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Explain the design issues in color CRT monitors. (b) Distinguish between CRT monitors and direct view storage tube (DVST) devices. [8+8] 2. What is meant by aliasing? Discuss about the two antialiasing methods. [6+5+5] 3. (a) Prove that the multiplication of two successive scaling matrices are commutative. (b) Show that two successive reﬂections about either of the coordinate axis is equivalent to the original input object. [8+8] 4. Discuss the steps involved in Sutherland-Hodgeman algorithm for polygon clipping. [16] 5. Derive the matrix form for perspective projection transformation using 3-demensional homogenous representation. With a neat sketch, describe various parameters involved in the matrix representation. [16] 6. (a) How is the depth of a polygon determined by the painter’s algorithm? (b) Assuming that one allows 128 depth value levels to be used, how much memory would a 512 × 512 pixel display require to store the Z-buﬀer? If the seence consists of 14 objects what is the frame buﬀer memory requirement. [8+8] 7. (a) State the blending function suitable for Bezier surface and explain the terms involved in it. (b) Demonstrate that Bezier curve is axis independent. 8. Discuss about diﬀerent methods of controlling animation. ⋆⋆⋆⋆⋆ [8+8] [16]

1 of 1

Code No: RR311203

Set No. 4

III B.Tech I Semester Supplementary Examinations, February 2007 COMPUTER GRAPHICS ( Common to Information Technology and Electronics & Computer Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Explain the design issues in color CRT monitors. (b) Distinguish between CRT monitors and direct view storage tube (DVST) devices. [8+8] 2. What is meant by aliasing? Discuss about the two antialiasing methods. [6+5+5] 3. (a) Show that the shearing factors applied in x and y directions are independent. That is Sha,1 ∗ Sh1,b = Sha.b. (b) Brieﬂy discuss about co-ordinate transformations. [8+8] 4. (a) Determine whether the vector joining the points A (5,7), B (10,8) intersects the line segment P(1,4) Q(20,4) using the Sutherland-Hodgeman algorithm. If intersects, ﬁnd the coordinates of intersection point. (b) Justify with suitable examples that the Sutherland-Hodgeman algorithm is suitable for clipping any polygon but the clipping polygon must be always convex shaped. [8+8] 5. (a) Find the mirror reﬂection transformations with respect to three principle planes. (b) The transformation matrix Av denotes the alignment of an arbitrary vector with Z-axis. Give the matrix Av , explain the steps involved n reﬂecting an object about an arbitrary plane. [8+8] 6. (a) What are the advantages of mini max test in z-buﬀer algorithm? (b) A polygon has a plan equation ax + by + cz + d = 0. Suppose that we know the value of ‘z’ at a point (x, y). What is the easiest way to calculate the value of z at (x + 1,y) and at (x, y + 1)? [8+8] 7. (a) Distinguish zero-order, ﬁrst-order and second-order continuity. (b) What is the organization of control points followed in Bezier’s method to ensure second order continuity? (c) What are the properties of Bezier’s curve? [5+5+6] 8. (a) Discuss the procedural control methods of animation. (b) What are the advantages of procedural control over full explicit control. [8+8] ⋆⋆⋆⋆⋆ 1 of 1

- R-handsonuploaded byAlexandre Santos
- Basics of R Command Sheetuploaded bySunitha Kishore
- Application of EXCEL in Teaching FEMuploaded byj.emmett.dwyer1033
- A Short Note on Matlab Usageuploaded byhlvijaykumar
- 0083uploaded byChintha Noviyanti
- Comminution Example 5301 Crushing 11uploaded byModelamientoDeProcesosMinerosSimmodmet
- proj1uploaded byVivek Tulsidas
- lect03.pdfuploaded byprabhudeen
- International Journal of Mathematics and Statistics Invention (IJMSI)uploaded byinventionjournals
- Algebra II Chapter 3 Testuploaded bytentinger
- CpE 514DS Syllabus v1_JCaneteuploaded byEugene Andrew Abuan
- 5. Foundation Embedded in a Layered Half-Spaceuploaded byararrati
- Cpp Assignment 1uploaded byPiyush Malhotra
- pma06_tebouluploaded byTomas Kyso Kyselica
- Math251_S2014_Exam1 (1)uploaded byuflilla
- ABAQUSmanualuploaded byHenrique Rodrigues Oliveira
- 1994 - Good Features to Track {CVPR'94}uploaded byDaniel Bastos Moraes
- JEE Syllabus _ IIT JEE Syllabusuploaded byayush
- mp-204_103uploaded byAgam Reddy M
- Physicsuploaded bylijo_john
- Advanced Mathuploaded byCarlo Galicia
- Matlab Basicsuploaded byDeepak Prakash Jaya
- Proof 2uploaded byKaushik Guha
- it1005labuploaded byhideto290
- Linear algebra for game developers ~ part 1 - Wolfire Games Bloguploaded byRyan Murray
- JNU-Phd-2009uploaded byGurvir Singh
- matricesuploaded byRheyniel Flores
- Matlab Lecturesuploaded byMalavika Mohan
- 1285057605 CBSE SamplePaper-2 XII Maths 2010 QuesSols0uploaded byneela94
- Matlab No. 12uploaded byearlygear

- r05320205 Switchgear and Protectionuploaded bySrinivasa Rao G
- r05320305 Design of Machine Members IIuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r5 402 Mba Management of Technology Set1uploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- Rr322305 Immunologyuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 42 Mca Advanced Java Programming Set1uploaded bySrinivasa Rao G
- 42 Mca Nr Programming in Javauploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r05320403 Microwave Engineeringuploaded bySrinivasa Rao G
- 41 Mca or Software Engineeringuploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- Nr 302 Mba Cost and Management Accounting Set1uploaded bySrinivasa Rao G
- Nr 31 Mca Database Management Systemsuploaded bySrinivasa Rao G
- Or 34 Mca Management Information Systemsuploaded bySrinivasa Rao G
- r5 410 Mba Management of Change Set1uploaded bySrinivasa Rao G
- Nr 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G
- r5 408 Mba Decision Support Systems Set1uploaded bySrinivasa Rao G
- r6 33 Mca Unix Networks Programming Set1uploaded bySrinivasa Rao G
- r6 48 Mca Mobile Computing Set1uploaded bySrinivasa Rao G
- r6 34 Mca Management Information Systems Set1uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- Nr-35-Mca-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 47 Mca Distributed Operating Systems Set1uploaded bySrinivasa Rao G
- Or 32 Mcacomputer Communication Networksuploaded bySrinivasa Rao G
- r5 304 Mba Enterprise Resource Planninguploaded bySrinivasa Rao G
- r5 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading