Question Paper Details:
University: Rajasthan Technical University
Course: B.Tech Computer science & engineering
Subject: Computer Graphics & Mulitmedia Techniques
Exam Year: Nov-Dec 2011
Year or Semester: Fourth year/ Seventh Semester
Paper Code: 7E4241
Course: B.Tech Computer science & engineering
Subject: Computer Graphics & Mulitmedia Techniques
Exam Year: Nov-Dec 2011
Year or Semester: Fourth year/ Seventh Semester
Paper Code: 7E4241
Unit-I
1. a) What is scan conversion. Explain Raster Scan system with the help of block diagram. [Marks 8]
b) In a Raster system with resolution 2560*2048. How many pixels could be accessed per second by a display controller that Refresh the screen at a rate of 60 frames per second. Also calculate access time per pixel in the system. [Marks 8]
OR
1. a) Explain Bresenham’s Line Drawing Algorithm. Also write it’s procedure in any programming language.
[Marks 8]
b) Explain basic principle to draw a circle. Also Explain mid-point circle Algorithm. [Marks 8]
Unit-II
2. a) What is the need of transformation’s between coordinate system. Explain with example. [Marks 8]
b) Derive a formula to Rotate a point by theta degree. [Marks 8]
OR
2. a) Explain Cohen-Sutherland line clipping algorithm with region code details. [Marks 8]
b) Generate Transformation Matrix for all possible 2D Reflections. [Marks 8]
Unit-III
3. Implement depth Buffer Algorithm to display visible surfaces of a given polyhedron. Is there any relation in definition of the object and storage requirements of the depth buffer? Explain. [Marks 16]
OR
3. Write a procedure to display 2D, cubic Bezier curves given a set of 4 control points in XY plane. [Marks 16]
Unit-IV
4. Write a Routine to convert RGB color model to HSV color model. [Marks 16]
OR
4. Explain phong and fast phong shading using a suitable object. [Marks 16]
Unit-V
5. Write short notes on:-
a) Difference between SCSI and IDE.
b) Authoring Tools. [Marks 8*2]
OR
5. Write short notes on:-
a) MPEG file format
b) Animation techniques. [Marks 8*2]
Return to Question Paper