Roll No. : Invigilator's Signature :.. GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70

Size: px

Start display at page:

Download "Roll No. : Invigilator's Signature :.. GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70"

Norah Moody
5 years ago
Views:

1 Name : Roll No. : Invigilator's Signature :.. CS/MCA/SEM-4/MCA-402/ GRAPHICS AND MULTIMEDIA Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers in their own words as far as practicable. GROUP A ( Multiple Choice Type Questions ) 1. Choose the correct alternatives for the following : 10 1 = 10 i) In direct coding of RGB values with 4-bits per primary colour, how many colours are possible for each pixel? a) 1024 b) 2048 c) 4096 d) 256. ii) On compressing a string using Run Length Encoding, it becomes What is the original ( uncompressed ) string? a) b) c) d) either (a) or (b) [ Turn over

2 iii) Dragging in computer graphics can be achieved through a) Translation b) Rotation c) Scaling d) Mirror reflection. iv) If P 0, P 1, P 2 be the control points ( in sequential ordering ) then the Bezier curve must pass through a) P 0 and P 1 b) P 1 and P 2 c) P 2 and P 0 d) points close to P 0, P 1 and P 2. v) Which of the following is incorrect? a) Successive Rotations and Scaling are Additive, while Successive Translations are Multiplicative b) Successive Translations & Rotations are Additive, while Successive Scaling is Multiplicative c) Successive Translations & Scaling are Additive, while Successive Rotations are Multiplicative vi) d) None of these. Bresenham line algorithm is better than DDA algorithm because it is based on a) floating point arithmetic b) integer arithmetic c) slope is between 0 and 1 d) none of these

3 vii) Which of the following techniques is used in Midpoint Subdivision algorithm? a) Binary Search b) Bubble sort c) Linear Search d) Sequential search. viii) To draw two smoothly joining Quadratic Bezier curves, ix) one needs a) 5 control points b) 10 control points c) 9 control points d) 8 control points. Aspect ratio means a) ratio of vertical point by horizontal points b) ratio of horizontal points by vertical point c) both of these d) none of these. x) Morphing means a) Changing position b) Changing shapes c) Changing colours d) Scaling up & down [ Turn over

4 GROUP B ( Short Answer Type Questions ) Answer any three of the following. 3 5 = a) Deduce Bresenham s Line Drawing Algorithm, showing clearly the mathematical calculations involved. b) Bresenham s Line Drawing Algorithm is much faster than the DDA Line Drawing Algorithm. Justify What is an offline Transformation? Obtain a transformation that reduces a rectangle ABCD, with the coordinates A ( 0, 0 ), B ( 5, 0 ), C ( 5, 4 ) and D ( 0, 4 ), to half its size, keeping the point D fixed. 4. What is the difference between window and viewport? What do you mean by clipping? What is an applet? How will you use java applets in HTML file? Explain key frames and twinning with examples. What advantages of computer assisted animation?

5 GROUP C ( Long Answer Type Questions ) Answer any three of the following = a) What is a Viewport? b) Obtain the overall transformation matrix for a 2-D viewing transformation from a WINDOW with coordinates of its corners at ( xw min yw min ) ( xw max yw max ) and to a VIEWPORT with corner coordinates at ( xv min yv min ) & ( xv max yv max ). c) Clip the line segment AB ( figure below ) against the clipping window PQRS using Mid-point subdivision algorithm. S y = 6 x = 3 A ( 1, 5 ) B ( 3, 8 ) R x = 2 P y = 1 Q d) Write and explain the Warnock Algorithm [ Turn over

6 8. a) What are Hypertext and Hypermedia? b) How is HTML different from DHTML? c) Which tag in HTML is used to insert horizontal rule in a web-page? Describe its atributes. d) Describe the <frameset> tag used in HTML. e) How can we format subscripts and superscripts in HTML? f) Describe briefly any two of the following file-formats : i) bmp ii) tiff iii) gif a) Prove that scaling is always commutative with rotation. b) Derive the composite matrix when reflection is taken with respect to x = a straight line where a is constant. c) Prove that inverse rotation matrix is equal to inverse of the rotation matrix a) Write the scan line polygon filling algorithm and explain associated data structure. b) Generate the seed fill algorithm for polygon filling. c) What is Aliasing? How can we reduce the Aliasing?

7 11. Write short notes any three : 3 5 a) Cohen-Sutherland Line Clipping b) B-Spline curves c) Shadow masking d) GKS e) JPEG Compression Technique [ Turn over

Roll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70

Roll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70 Name : Roll No. :.... Invigilator's Signature :.. CS/MCA/SEM-4/MCA-402/2011 2011 GRAPHICS AND MULTIMEDIA Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates