Skip to content

Mcs 53 Solved Assignment Of Allama

MCS-053 Computer Graphics and Multimedia – Solved Assignment 2017-2018

by Aditya Singh on October 19, 2017

There are Eight questions in this assignment (each carrying 10 marks). 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.

  1. 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). Compare DDA algorithm and Bresenham Line generation Algorithm? Show step by step execution of Bresenham Line Generation algorithm for drawing a line having endpoints (2, 3) and (9, 8).
  2. What is the major difference between Cohen Sutherland and Cyrus beck line clipping algorithms? Briefly Discuss both algorithms with suitable example. In Cyrus Beck line clipping algorithm, How will you determine whether the point of intersection between line and clipping window is Potentially Entering (PE) or Potentially Leaving (PL). Derive the expression for t with respect to ith edge and PQ (line to be clipped) in the context of Cyber Beck line clipping algorithm. Use the Cohen Sutherland line clipping algorithm to clip the line segment PQ having coordinates P(20, 30) and Q (100, 100). The clipping window ABCD‟s coordinates are – A(0,0), B(40,0), C(40,40) and D(0,40)
  3. How Euclidean Coordinate System Differs from Homogeneous Coordinate system? What is the advantage of Homogeneous Coordinate system over Euclidean Coordinate System? Assume a polygon ABCDE having coordinates A(0,0), B(10,10), C(10,2), D(5,5), E(7,6) is subjected to the counter-clockwise rotation of 45° about an axis passing through the centroid of the polygon . Find the transformed coordinates of the polygon ABCDE. You should represent the transformation using Homogeneous Coordinate System
  4. Draw the tree structure to discuss the Taxonomy of Projection, in computer graphics. Compare and contrast Parallel & Perspective projection, in detail. i.e with suitable examples, equations, expressions etc. What is isometric projection? Derive a general transformation matrix for isometric projection. Obtain an isometric view of a cube of the unit size lying on the origin. What is vanishing point in context of projections, in computer graphics? Consider a cube of size 4 units that is lying on the origin, obtain the perspective projection of this cube on z=0 plane having the centre of projection at E(0,0,-2) . Can we find the vanishing point(s) for this projection?
  5. What is the utility of Bezier Curves in Computer Graphics? Write the properties of the Bezier curves and prove all properties. What do you understand by the Parametric Continuities and Geometric Continuities in context of Bezier Curves? Discuss both type of continuities with suitable expressions, equations and examples. Explain the role of control points in Bezier Curves. Draw a Bezier curve having the control points as P0(0, 0), P1(2, 5), P2(5, 9), P3(10, 20). Calculate the coordinates of the points on the curve corresponding to the parameter u = 0.2, 0.4, 0.6. Draw a rough sketch of the curve and show coordinates of various points on it?
  6. Explain the following with suitable examples:
    1. Windowing Transformations
    2. Scan Line Polygon Fill Algorithm
    3. Z-Buffer Algorithm
    4. Sweep representations
    5. Simulating Accelerations in Computer Animations
  7. Explain the following in the context of computer Graphics and multimedia, use suitable diagram and /or mathematical equations or example in your explanation.
    1. Shading and its types
    2. Reflection and its types
    3. Animation and its types
    4. Audio File Formats and its type
    5. Video File Formats and its types
  8. Differentiate between the following:
    1. Key frame animation and Cel animation
    2. Analog and Digital Sound
    3. Hypermedia and hypertext
    4. Painting tools and drawing tools
    5. Random Scan Display Devices and Raster Scan Display Devices
    6. Computer Graphics and Animation
    7. Interlaced and progressive scan
    8. Compression and decompression in digital video
    9. Hypermedia and hypertext (x) Ray tracing and Ray casting.

Tagged as: mca, mcs053, solved assignment

MCS-041 Operating Systems – Solved Assignment 2017-2018

by Aditya Singh on February 24, 2018

MCS-041 Operating Systems – Solved Assignment 2017-2018

This assignment has five questions which carries 80 marks. Rest 20 marks are for viva voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanation. Please go through the guidelines regarding assignments given in the Programme Guide.

  1. With the aid of a diagram, describe what happens during the “fetchexecute” cycle. Include a description of how interrupts are detected. List various types of interrupts. Also explain in detail what happens when an interrupt occurs?
  2. Question:
    1. Explain the meaning and importance of the following terms with respect to CPU scheduling of processes: CPU bound, I/O bound, Pre-emptive, non-pre-emptive, turnaround time, normalised turnaround time and response ratio.
    2. Consider the following set of processes with arrival time and CPU execution time given in milliseconds. A process with a larger priority number has a higher priority. If any assumptions made by you, state them.
      1. Draw the Gantt charts illustrating the execution of these processes using the FCFS, SJF, Round Robin(with quantum = 2 ).
      2. Also calculate the average turn around time, average waiting time, processor utilization and throughput for each of the algorithms mentioned in (i).
    3. Explain the trade-offs involved in choosing the size of a time slice for a round robin algorithm
  3. Describe the following disk scheduling policies: First Come First Serve (FCFS), Shortest Seek Time First, SCAN, C-SCAN, Look and C-Look. Show the disk arm movement and calculate the number of tracks traversed using all of the policies if the disk has 200 tracks and the requested tracks, in the order received, are 55, 58, 39, 18, 90, 160, 150, 38, 184.
  4. Write an interactive C/C++ program for implementing the Banker’s Algorithm.
  5. Discuss in detail the features, Process management, Memory management, I/O Management, File management and Security and Protection in Linux Operating System.

Tagged as: mca, mcs, mcs-041, solved assignment