Total No. of Questions 18] [Total No. of Pages 2
M.Sc. DEGREE EXAMINATION, MAY 2017
Second Year
Computer Science
COMPUTER GRAPHICS
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any three questions.
Q1) Discuss about various input and hard copy devises with neat sketch.
Q2) Derive Bresenhams's line drawing algorithm. Plot a line by using Bresenham's line
generation algorithm from to
Q3) State and explain about Cohen Sudherland line clipping algorithm with example.
Q4) What is meant by parallel and perspective projections? Derive matrix for perspective
projections.
Q5) Discuss various classifications of visible surface detection methods.
SECTION B × 4 20)
Answer any Five questions
Q6) Differentiate raster scan display and random scan display.
Q7) Write about inside and outside tests.
Q8) Prove that 2 successive 2 D rotation are additive
i.e., R(θ1). R(θ1 θ2)
Q9) Briefly explain about polygon clipping.
Q10) Describe different input modes.
Q11) Write about visible line and surface identification.
Q12) Explain about 2 D scaling and translation.
Q13) Describe the 3 display methods.
SECTION C × 1
Answer all questions
Q14) Define aspect ratio.
Q15) Define composite transformation
Q16) What is meant by viewing pipe line?
Q17) Define shearing.
Q18) Define orthogonal projection.