Question

Assignment -2 1) Consider the processes P1, P2, P3, P4, P5 given in the below table, arrives for execution in the same order, with arrival time 0, and given burst time. Find the average waiting time using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm and draw the Gantt chart. Process Burst Time(ms) P1 5 P2 24 P3 16 P4 10 P5 3 2) All the following 5 processes arrive at time 0, in the order given the burst time are as follows. Consider the FCFS, SJF (non-preemptive) and RR (quantum = 10ms) scheduling algorithms for the set of processes. Which algorithm would give the minimum average waiting time? And draw the Gantt chart. Process Burst Time(ms) P1 10 P2 29 P3 3 SP4 7 P5 12 3) Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in the same order, with arrival time 0, and given burst time. Find the average waiting time using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm and draw the Gantt chart. Process Burst Time(ms) P1 21 P2 3 P3 6 P4 2 Note: First Come First Serve (FCFS) Shortest Job First (SJF) Round Robin (RR)

          Assignment -2
1) Consider the processes P1, P2, P3, P4, P5 given in the below table, arrives for execution
in the same order, with arrival time 0, and given burst time. Find the average waiting
time using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm
and draw the Gantt chart.
Process	Burst Time(ms)
P1	5
P2	24
P3	16
P4	10
P5	3
2) All the following 5 processes arrive at time 0, in the order given the burst time are as
follows. Consider the FCFS, SJF (non-preemptive) and RR (quantum = 10ms)
scheduling algorithms for the set of processes. Which algorithm would give the
minimum average waiting time? And draw the Gantt chart.
Process	Burst Time(ms)
P1	10
P2	29
P3	3
SP4	7
P5	12
3) Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in
the same order, with arrival time 0, and given burst time. Find the average waiting time
using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm and
draw the Gantt chart.
Process	Burst Time(ms)
P1	21
P2	3
P3	6
P4	2
Note: First Come First Serve (FCFS)
Shortest Job First (SJF)
Round Robin (RR)

Assignment -2
1) Consider the processes P1, P2, P3, P4, P5 given in the below table, arrives for execution
in the same order, with arrival time 0, and given burst time. Find the average waiting
time using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm
and draw the Gantt chart.
Process Burst Time(ms)
P1 5
P2 24
P3 16
P4 10
P5 3
2) All the following 5 processes arrive at time 0, in the order given the burst time are as
follows. Consider the FCFS, SJF (non-preemptive) and RR (quantum = 10ms)
scheduling algorithms for the set of processes. Which algorithm would give the
minimum average waiting time? And draw the Gantt chart.
Process Burst Time(ms)
P1 10
P2 29
P3 3
SP4 7
P5 12
3) Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in
the same order, with arrival time 0, and given burst time. Find the average waiting time
using the FCFS, SJF and RR, Time Quantum is 5ms scheduling algorithm and
draw the Gantt chart.
Process Burst Time(ms)
P1 21
P2 3
P3 6
P4 2
Note: First Come First Serve (FCFS)
Shortest Job First (SJF)
Round Robin (RR)

Added by Anna F.

Question

Please give Ace some feedback