creating a Gantt chart for different types of scheduling algorithms.

1. , Suppose the processes arrive in this
order
Process Burst time
P1 5
P2 4
P3 3
P4 6
Gannt chart:
Average waiting time =
2. Solve the shortest job first
Shown below is the workload for 5 jobs arriving at time zero in the order given below
Create a First come first serve scheduling algorithm
P1,P2,P3,P4
Process Arrival time
P1 0.0
P2 2.0
P3 3.0
P4 4.0
P5 5.0
Gannt chart:
Burst time
10
9
3
7
4
Average waiting time = _____________________________________
3. Solve the Round robin scheduling , Time quantum = 2
Process
P1
P2
P3
P4
P5
Gannt chart:
Average waiting time
Burst time
6
5
2
3
7
4.. Solve the Priority scheduling .
Process Burst time
P1 9
P2 1
P3 3
P4 1
P5 6
Gannt chart:
Average waiting time
Priority
3
1
3
4
2
5. Given the following memory configuration and a request to allocate a 18 k
block. Where is the memory location after the allocation of 18 k block, using the
First-Fit, Best-Fit, and Next-Fit and worst fit algorithms.
Note: Point out the fits in the following figure:
Free
Allocated
25k
40k
100k
20k
10k