Ignou Mcs-042 Solved Assignment 1424

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


IGNOU4U.BLOGSPOT.COMemp%ye! #i(e! transmitters at is%an!s %$ate! at ran)es # severa% tens # *i%meters. Themain a!vanta)e # the ALOHA ran!m a$$ess s$heme was simp%i$ity. Termina%s $antransmit their !ata re)ar!%ess # the a$tivity # ther termina%s. I# a messa)e is s&$$ess#&%the "ase statin sen!s an a$*nw%e!)ement ver a #ee!"a$* $hanne%. I# the termina% !esnt re$eive! an a$*nw%e!)ement, the termina% retransmits the messa)e a#ter waitin) aran!m time. The !e%ay is main%y !etermine! "y the pr"a"i%ity that a pa$*et is ntre$eive! +"e$a&se # inter#eren$e #rm anther transmissin, $a%%e! a $%%isin- an! theavera)e va%&e # the ran!m waitin) time "e#re a retransmissin is ma!e.

Collision Resolution

Later st&!ies revea%e! that, #r an in#inite pp&%atin # &sers an! &n!er $ertain $hanne%$n!itins, the ALOHA system is &nsta"%e. Pa$*ets %st in a $%%isin are retransmitte!, "&t the retransmissin a)ain e(perien$es a $%%isin. This may set ## an ava%an$he # retransmissin attempts. A%mst s&re%y, the "a$*%), i.e., the n&m"er # previ&s%y&ns&$$ess#&% pa$*ets that nee! t "e retransmitte!, )rws "eyn! any #inite "&n!. Onemeth! t miti)ate insta"i%ity is t !ynami$a%%y a!apt the ran!m waitin) times # a%%termina%s i# the "ase statin nti$es that many $%%isins $$&r. (amp%es # meth!s tens&re sta"i%ity are /ynami$ 0rame Len)th +/0L- ALOHA, "y 0rits S$h&te, r theSta$* A%)rithm "y Bris Tsy"a*v et a%. /0L &ses a $entra%i1e! $ntr%, mastere! "y the "ase statin, whi%e the sta$* a%)rithm is a !e$entra%i1e! meth!.

 ALOHA in Mobile Radio Nets

The ALOHA $n$ept is very $mmn%y &se! in m!ern wire%ess $mm&ni$atinsystems. The $a%% set'&p pr$e!&re # a%mst any +ana%) r !i)ita%- $e%%&%ar te%ephnesystem &ses sme *in! # ALOHA ran!m a$$ess. B&t the per#rman$e !i##ers #rm whatne w&%! e(pe$t in a wire%ine netwr*.In a ra!i $hanne%, pa$*ets may "e %st "e$a&se # si)na% #a!in) even i# n $nten!in)ther si)na% is present. On the ther han!, pa$*ets may "e re$eive! s&$$ess#&%%y !espiteinter#eren$e #rm $mpetin) termina%s. This is $a%%e! 2re$eiver $apt&re3. This e##e$t has asi)ni#i$ant in#%&en$e n the thr&)hp&t. Optim&m #re&en$y re&se #r ALOHA 5an!m A$$ess netwr*s !i##ers #rm #re&en$yre&se #r te%ephny, "e$a&se the per#rman$e $riteria !i##er +thr&)hp&t 6 !e%ay vers&s&ta)e pr"a"i%ity, respe$tive%y-. The "est re&se pattern #r an ALOHA system is t &sethe same #re&en$y in a%% $e%%s.



0 Replies to “Ignou Mcs-042 Solved Assignment 1424”

Lascia un Commento

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