Consider the following set of processes with arrival times and
CPU execution times given in milliseconds. A process with a
larger priority number has a higher priority. If any assumptions
made by you, state them.
(i) Draw the Gantt charts illustrating the execution of these
processes using the FCFS, SJF, Round Robin
(with quantum = 1) and Priority Based Scheduling algorithms.
(ii) Also calculate the average turn around time, average waiting
time, processor utilization and throughput for each of the
algorithms mentioned in (i).
MCS-041 Solved Assignment
Course Code : MCS-041 Solved Assignment
Course Title : Operating Systems
Assignment Number : MCA(4)/041/Assignment/16-17
Maximum Marks : 100
Weightage : 25%
Last Dates for Submission : 15th
October, 2016 (For July 2016 Session)15th
April, 2017 (For January 2017 Session)
No more offers for this product!
There are no inquiries yet.