IGNOU MCA MCS-053 SOLVED ASSIGNMENTS 2014-2015 OPERATING SYSTEMS V FIFTH SEMESTER
Ans: Comming soon. Now follow - How to write Best ASSIGNMENTS / ANSWERS by Yourself
Computer Graphics and Multimedia MCS-053
There are four questions in this assignment. Answer all the questions. 20 Marks are for viva-voce. You may use illustrations and diagrams to enhance explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.
Q.1. Write a program in C/C++ to generate line segment between two points, by using DDA line generation Algorithm. Your program should map each and every step of pseudo algorithm, in the form of comments. What are the advantages and disadvantages of using DDA algorithm for line generation? List the steps of the algorithm. Use this algorithm to draw a line with endpoints (2, 3) and (9, 8).
Q.2. Write the Bresenham Circle Generation Algorithm and use it to draw a circle with radius r = 10, determine positions along the circle octants in 1st Quadrant from x = 0 to x = y.
Q.3. What is line clipping? Compare Cohen Sutherland Line Clipping Algorithm with the Cyrus Beck line clipping algorithm. Explain the Cyrus Beck line clipping algorithm with the help of an example. How Cyrus Back line clipping algorithm, clips a line segment, if the window is non-convex?
Q.4. Explain the Homogeneous Coordinate System with the help of an example. Assume that a triangle ABC has the coordinates A(0, 0), B(5,8), C(4,2). Find the transformed coordinates when the triangle ABC is subjected to the clockwise rotation of 45° about the origin and then translation in the direction of vector (1, 0). You should represent the transformation using Homogeneous Coordinate System.
Q.5. What are Bezier Curves? Briefly discuss their properties, with the help of the proof for each of the property. How Bezier surfaces contributes to the world of computer games and simulations? Given p0(1, 1); p1(2, 3); p2(4, 3); p3(3, 1) as vertices of Bezier Curve. Determine 3 points on Bezier Curve.
Q.6. Why do you need to use visible-surface detection in Computer Graphics? Explain Scan Line method along with the algorithm for the visible-surface detection with the help of an example. How scan line method is different to z-buffer method?
Q.7. Explain the following terms in the context of computer Graphics using suitable diagram and /or mathematical equations or one example.
i) Depth Buffer Method
ii) Area Subdivision Method
iii) Basic Ray Tracing Algorithm
iv) Projections and its Types
Q.8. Compare and contrast the following:
i) Interlaced and progressive scan
ii) Compression and decompression in digital video
iii) Hypermedia and hypertext
iv) Types of Bitmap and Vector graphics
v) Ray tracing and Ray casting
No comments:
Post a Comment