Tuesday, 05 22nd

Last update09:44:47 AM

Login With Facebook

Combinestudy

Downloads
Overview Search Downloads Up
Download details
Solution Fall 2010 CS604 2
(0 votes)

Using Non-preemptive SJF algorithm answer the following questions using the table below:

 

Process

Arrival Time

Burst Time

P2

0.0

12

P3

3.0

8

P4

5.0

4

P1

10.0

10

P5

12.0

6

i-                    Develop Gantt showing the execution of the processes in the order mentioned.

ii-                  Waiting times for each process.

iii-                Average waiting time.

 

 

 

Part b: 10

Using Preemptive SJF algorithm answer the following questions using the same table:

i-                    Develop Gantt showing the execution of the processes in the order mentioned.

ii-                  Waiting times for each process.

iii-                Average waiting time.

 



Data

Size 123.31 KB
Downloads 31
Created 2010-11-26 17:53:18
Created by Umad
Changed at 2010-11-26 18:04:10

Please register or login to download files from this category.