2023 Dec Computer Graphics Paper PDF

D2 C...

D2 C BC A4 B 35 Paper / Subject Code: 50925 / Computer Graphics D1 C2 2B CD 5F BC A4 2D 16 35 1 2B CD CD CA 4C 5F 2D 6 35 A B BD 1 B CD A C F D2 Time: 3 Hours Total Marks: 80 65 8F 4 C 35 DA D 1 2 5C N.B. 1. Question No. 1 is compulsory B A 4C 5F C 8F C 02 2. Attempt any 3 from remaining questions. 2D 6 5 A D 1 F3 5C 70 CD FB 3. Assume any suitable data if necessary and justify the assumptions. A 4C 65 1B DC 2 35 DA C8 0 A1 0 CD B 5F 7 Q.1 Attempt any Four 4x5=20 25 5C 1B 8F DC BB 16 00 3 C D 1. Compare DDA and BRESENHAM line drawing algorithm. FB CA 5F B7 5 D2 BC 2 16 5 8 0 1 BD C2 2. Give application of computer graphics. F3 C B 0 CD A B7 25 D2 A4 65 8F DC B 3. Explain with neat diagram rasterization. 00 1 2 A1 5C 2B CD CD C FB B7 A4 C 4. Give fractal dimension of KOCH curve. 2 D 35 B C8 0 D1 D 2 B 0 D C 5F FB B7 5 D2 5. Define Projection, Describe perspective projection with neat diagram. C C A4 02 16 35 B C8 1 BD 2 B 70 D CD CA 4C F 25 D2 5C 5 1B 8F 6 A BB Q.2 20 BD 00 1 2 F3 5C D CD CA 4C B7 D2 C 5 8F 1. Given a triangle ABC where A(0,0), B(10,10) and C(20,0), scale the given triangle ABC 2- 02 16 5 A B D D1 C2 3 5C B 70 D unit in X direction and 0.5-unit in Y direction. Find out the new coordinate of triangle ABC B A F D2 5C BC 5 F 4 DC 02 1B 16 after scaling. A 8.in 2 3 5C 70 2B CD CD FB CA C 5F B A4 02 2. Explain with neat diagram Sutherland and Hodgman polygon clipping algorithm in detail. 2D 16 5 8 BB D1 BD 3 C 70 D A 4C F 25 BC D2 5C 5 B 8F C 6 A 0 D1 es D Q.3 20 1 C2 F3 C 2B 0 D B CA 7 5 BC 5C 65 B 8F A4 2 2D 1. Derive window to viewport coordinate transformation. 00 D1 D 1 3 5C 2B CD 4C FB CA 5F B7 BC 2. Give properties of Bezier curve. 02 2D DA 16 35 ot 8 1 D C 2B 70 CD 4C FB CA 5F 5 5C 1B 2 2D DA BB 16 8 0 BD Q.4 20 F3 5C 0 D C CA 7 D2 5C un C 65 A4 1B 8F 02 BB 1. Derive Mid-point circle generation algorithm. BD A1 C2 F3 C 70 CD D 25 2 BC 65 A4 DC B 8F 2. Give principles of animation D 35 00 1 A1 2 5C B D CD FB 4C F B7 2 5C 65 DC 02 m 2D DA B D1 Q.5 20 A1 F3 2B 70 FB C 5C BC 65 4 DC 1B 2D 1. Explain with neat diagram Area Sub division (Warnock’s) algorithm to remove hidden A 8 A1 F3 5C 2B CD CD FB 4C surfaces. 65 C 2 2D 5 DA 8 BB 00 BD A1 3 5C 2. Derive matrix for 2D rotation transformation. 4C F B7 D2 C 65 F C 2 35 A C8 00 BD A1 C2 D 5F B7 5 5C F A4 C 02 16 C8 Q.6 Attempt any Four 20 1 D F3 0 CD CD FB CA B7 5 65 02 1. Explain point clipping algorithm. BB 35 C8 1 D A1 0 CD FB 5F B7 5 D2 2. Give pseudo code for 4-connect Boundary fill algorithm. C 02 BB 16 C8 1 BD 0 CD CA 3. Give transformation matrix for 3D – Translation, Scaling, Rotation (about x, y, z axis) B7 5 D2 F 2 BB C8 00 1 BD C2 4. Explain with neat diagram composite transformation for scaling. CD B7 25 D2 4 8F DA BB 00 1 5. Given a line AB where A(0,0) and B(1,3) find out all the coordinate of line AB using DDA C2 5C CD B7 D2 5C algorithm. 4 02 DA BB D1 C2 70 ************ D2 C C 4 1B 35 DA BB C2 CD F D2 C 65 4 37894 Page 1 of 1 35 DA BB 1 C2 CA F D2 C 65 4 35 DA A1 C2 5F C A4 DC C8FBDCA165F35CDA4C2D2BBCD1B70025 16 35