MCA Semester –II (2019-2022)

Assignment questions

Consider five processes P1,P2,P3,P4 and P5 with their arrival times,

required CPU burst (ms), and priorities as shown in the following table.

Process P1 P2 P3 P4 P5
Arrival time 0 1 4 4 5
CPU Burst(ms) 10 6 4 2 5
Priority 4 4 1 2 4

Assume that the priority number means the higher priority. Compute the
average waiting time and average turnaround time of processes for each
of the following scheduling algorithms. Also determine which of the
following scheduling algorithms result in minimum waiting time.
a. FCFS
b. SJF
c. Non-preemptive priority based
d. Round Robin(if CPU time slice is 2 ms)