R16 Code No: 135BY * JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD SY B. Tech III Year I Semester Examinations, August - 2022 COMPUTER GRAPHICS (Common to CE, CSE, IT) Max. Marks: 75 Answer any five questions All questions carry equal marks 1a) Compare stergscan systems with random scan systems used in computer graphics. b) Explain al on: mid-point circle generating algorithm, [748] 2a) Write DDA line Gsm and explain with suitable example. b) Describe about fl filling algorithm. 18+7] 3.a) Summarize about diffe posite transforms used in 2-D geometrical transforms. po: b) Explain the working of say —Hodgeman polygon clipping algorithm with suitable example. 1748] 4a) Describe about window to view-por je transformation with an example. b) Determine a sequence of basic trans that are equivalent to the y-direction shearing matrix, [78] 5.a) Describe about 3-D objects representation usin presentation, b) Compare Hermite curve, Bezier curve and B-splin€ c [847] 6.a) Describe about the following 3-D geometric ranma) i) translations and ii) rotations b) Summarize about sweep representations of 3-D objects, [8471 7.a) — Explain about classification of different visible surface detecti b) Describe about basic illumination models. [8+7] 8.a) What are the different computer animation languages used in computer gra b) Explain about general computer animation functions with examples As} _ i)‘Code No: 135BY R16 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, February - 2022 COMPUTER GRAPHICS (Common to CE, CSE, IT) Ti urs SD Answer any five questions Max. Marks: 75 All questions carry equal marks Gi ‘on CRT device. Write DD: ihm to draw a line and state its advantages and disadvantages. [7+8] Explain boundary Describe the chi [748] Explain types and operat ping. Write Cohen Sutherland thm. (748) Explain 2D Scaling and rotat Mprosion Write about shear transformations. 1748] ‘Compare parallel Vs perspective vvociod Explain Bezier curves. 1748] Elaborate 3D viewing. What is B-spline curve and explain its repression. [748] Describe Phong shading method. Describe area sub division surface detection method. 1748] Explain raster animation method and its components. Explain different methods for motion specification, ==-00000--Code No: 135BY R16 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD. B. Tech III Year I Semester Examinations, March - 2021 ‘COMPUTER GRAPHICS (Common to CE, CSE, IT) Answer any five questions All questions carry equal marks Discuss i npr’ Algorithm. Find the of pixels that lie on line segment having end points (5,8) and (2,4). ‘Max. Marks: 75 (748) Write a note on varigfs video display devices. Write boundary fillin; [847] Discuss the stages involved af 2 ‘ansformation pipeline. Write polygon clipping algort (8+7] Explain Cohen Sutherland algorithm. Explain composite transformation for franslaj6ff scaling and rotation. (748) Explain 3D viewing in detail. Derive the transformation matrix for Bezier cur [7+8] Derive the transformation matrix for rotation about au is. us} Explain classification of visibility surface detection algorit Explain about constant-intensity shading algorithm. [8+7] Explain about the computer animation languages. Explain about the key frame system, (7+8]JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD 1B. Tech I Year I Semester Examinations, May/June - 2019, ‘S. COMPUTER GRAPHIC (Connon to CE.CSEID) Max. Marks: 75, ote: ygMbaion paper contains vo prs A and Par@A i gfpusory which care 25 marks, Answer all questions in Pat A. Pat B consis “Acre any oe fll question fom eachunit, Exch question caries vomit Cyne %) PART-A sna b) Write the differences botwdés a general graphics system designed for a programmer and one designed fora specific applic, sich as architect GI ©) Define rotation ofan object and wryPequaglgt rut a {Differentiate a window roma vewpor. BI ©) Geto ran f gral hee dlgonl asomaion ise, (2 1) Compate Octres and BSP Trees i 8) Write a short note on sea ie py 4h) How wireframe displays might be generated us visible-surface detection methods? (31 i) Define animation. by 3) Gives noe on aster animation > i O spor 2.) Setup a procedure fora parallel implementation of the midpoint crcl 'b) Draw and explain the architecture ofa rastr-graphies system witha disp 0 S 3.a)__Diseuss the boundary fll and flood- il algorithms in detail 'b) Compare and contrast the operating characteristics of random scan systems and rat sean systems. [se 4, Give 2D transformation matrix for: a) Rotation ) Scaling [sss oR 5.a) List out and explain the steps involved in Sutherland-Hodgeman polygon clipping algorithm, 'b) Write short notes on Reflection transformation [551 6. Write an example, explain 3D transla and rotation 10) OR How to setup view volume using the window boundaries for parallel and perspectives projectors? Exp 110) 4 program to display the visible surfaces of convex polyhedron using the BSP- md {10} oR 9, Phuygate the steps involved in Depth buffer algorithm for Hidden surface removal and Gornpgé with A.- Buffer method, 0} 10a) Explaed animation languages. b) Give note « jotion Specification, [545] OR 11, Listand expla Somputer-animation Fanetions 0) a 7Code No: 135BY JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, November/December - 2018 ‘COMPUTER GRAPHICS (Common to CE, CSE, IT) J paper contains two parts A and B. ‘of Siti 10 marks have a,b, ¢ as sub questions. R16 Max. Marks: 75 “compulsory which carries 25 marks. Answer all questions in Part A. Part B Answer any one full question from each unit. Each question caries ranr-a 0. (25 Marks) J.a) List some of the if (2) b) Write the drawbacks of ith. BI) ©) Write the properties of hom 's coordinates. fey 4 apna 3D show tora i Wh icqunt swe? ey 1) Wt pnion of Reis bt Ws uaa? i 3) Wt ath vans of ck aed ) 3 2) RMAC Se pan non i } Eaphin bout ect maton speciation tt rant 2 2a) FapinDDA ean ri indi 3) Compas san em and do ante. on 4) Witt ep raving gin, 3) Expand th orig pe fade ay he 42) Wie Sathand Hadgmanlgrhn ®) Poe to tn matin ae ame R= RR By on 52) Write Cyas-ek ine pin sg 'b) Explain about composite transformation. [5+5] 62) xin 3D compote tansomatin for sein. rion. 3) Duvet vantematon na for Hest cue (51 on 1a) Conpr parla especie pret b) Explain Bezier curves in detail. [545] $2) xn -hufig met for hide face detection $) Expat spar eecton sl he ong iss) on pin shut oman shang agri, smn ote nhl we sri detection iss) oa ido rang sige feo » EB ter animation in detail. [545] on 112) expan dg/ dpe system indi Ean Spr of uimaton sosacs ist SaCode No: 135BY R16 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, October - 2020 COMPUTER GRAPHICS S& (Common to CE, CSE, IT) rs Max, Marks: 75 S Answer any five questions e4 AI questions carry equal marks Describe T with neat sketch, U5) 2a) b) 4a) b) 5.a) b) 6.a) b) Ta) b) Baa) Develop and i Explain about {a flood-fill algorithm to fill the interior of any specified area, ation method with neat sketch. [87] Explain the Sutl .en subdivision algorithm for line clipping. 15} Write a short note on view! mation. Briefly explain about Reflecti [8+7] Give a detailed note about Hermite’ fa Give brief note about the approaches {OffowegoRelipping in 3-D space. [8+7] Explain the various methods for generation of alt surfaces. ‘What are the characteristics of perspective proj@xgion®2,Bxplgin [8+7] Describe about the raster animations. [847] Explain in detail about BSP trees. Write a short note on Warnock’s algorithm. [87] Discuss about the techniques to achieve the simple animation - R ~--00000---Code No: 135BY R16 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, September - 2021 COMPUTER GRAPHICS (Common to CE, CSE, IT) Max. Marks: 75 Answer any five questions & All questions carry equal marks La) List ig characteristics for the following display technologies: raster refresh systems, refregh systems, plasma panels and CDs. b) Set upa moc parallel implementation of the midpoint ellipse algorithm. [8+7] 2a) Write a boundary-fill ire jgefill an 8-connected region. b) Write a procedure to fill 1 i f give ellipse with specified pattern. [8+7] 3.a) Discuss why the Sutherland-HodggffaMgolygon clipping algorithm works for only convex clipping regions. b) Contrast the efficiency of Cohen-Si iang-Barsky line clipping algorithms. [8+7] 4.a) _ Derive the transformation matrix for rotatior i b) Explain about the 2D viewing function. [847] 5. Briefly explain the Bezier and B-Spline surfaces. [15] 6. Derive the transformation matrix for Hermite curve. {15} 7. Distinguish between object-space and image space methods of face detection algorithms. Give examples for each. [15] 8.a) Explain briefly about key frame systems. b) Design a storyboard layout and accompanying key frames for an animation polyhedron. +8] 7