CS604 Assignment No 2 Solution Spring 2018
Here, I am providing you "Solution of CS-604 Assignment No 2 Due Date 29-05-2018
Note: Please don't make exact copy of this document and make Changes in this assignment, write it in your own words always correct any errors if you found. I am not responsible for zero Marking.
Update: If you want to source file in docx format then just visit the link given below to download Solution file of CS604
Update: If you want to source file in docx format then just visit the link given below to download Solution file of CS604
How to Download the File : Watch video below to see the steps to download file
Instructions
Steps 1: Click at link given above
2: Enter Captcha Code
3: Wait for 8 Seconds
4: Click at Link Generated below the captcha box
5: That's it. You have downloaded
Note: We guarantee you that our site is 100% Malware and virus free so please Please Disabled your Ad-blocker to Download the file from our site..
|
If you still facing any problem then please let me know about your problem regarding downloading file and leave a comment below because your feed back is very important to us to make our website more reliable and useful.
CS604 Assignment No. 2 Solution explanation is given below;
Solution
A) You are required to provide the Gantt chart for non-preemptive SJF
(Shortest Job First) scheduling algorithm. Calculate the waiting time for each
process and average waiting time.
b) You are required to provide the Gantt chart for preemptive SJF
(Shortest Job First) or STRF (Shortest Remaining Time First) scheduling
algorithm. Calculate the waiting time for each process and average waiting
time.
Answer
c) From the above calculations, you have to mention the name of scheduling
algorithm which performs better in term of average waiting time.
Answer
From the above calculations it is proved that preemptive sjf
is better in term of avgerage waiting time
NOTE: IF YOU
FOUND ANY MISTAKE THEN CORRECT IT PLEASE DON’T MAKE EXACT COPY OF THIS
SOLUTION, MAKE CHANGES TO AVOID ZERO MARKING. IM NOT RESPONSIBLE FOR IT.
0 Comments