Ignou Mcs-053 Solved Assignment 2013-14 School


Chapter-1 Introduction To Program Development
Chapter-2 ‘C’ Concepts & Programming Involving Pointers, Functions & Files
Chapter-3 Understanding A Program (Must Read)
Chapter-4 Some More Examples
Chapter-5 Topic Wise Examples
1. Solution Paper - June 2005
2. Solution Paper - Dec 2005
3. Solution Paper - June 2006
4. Solution Paper - Dec 2006
5. Solution Paper - June 2007
6. Solution Paper - Dec 2007
7. Solution Paper - June 2008
8. Solution Paper - Dec 2008
9. Solution Paper - June 2009
10. Solution Paper - Dec 2009
11. Solution Paper - June 2010
12. Solution Paper - Dec 2010
13. Solution Paper - June 2011
14. Solution Paper - Dec 2011
15. Solution Paper - June 2012
16. Solution Paper - Dec 2012
Rs.150 (Minimum Discount 40%) and Postage Charges Extra
No. of Pages : 272
Author : Dinesh Verma, S.Roy
ISBN : 81-89086-42-1.

Yes! I am interested

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

0 Thoughts to “Ignou Mcs-053 Solved Assignment 2013-14 School

Leave a comment

L'indirizzo email non verrà pubblicato. I campi obbligatori sono contrassegnati *