Question

Let's assume your ID number is 012345678. It contains nine digits. Consider one extra digit and add this at the end of your ID number. For example, if you chose 9, then you have 10 digits. We have a system with five processes and among the above-mentioned ten digits, the first five digits are the arrival time and the last 5 digits are the Burst time. 0 1 2 3 4 5 6 7 8 9 Arrival time Burst Time Therefore, Processes P1 to P5 arrive at 0, 1, 2, 3, and 4 respectively for execution. P1 with burst time (BT) 5, P2 with BT 6, P3 with BT 7, P4 with BT 8, and P5 with BT 9. **If you got any burst time 0 then replace it with the digit 9. Now complete the following table with your own ID: Process Arrival Time Burst time P1 P2 P3 P4 P5 Draw Gantt charts that illustrate the execution of the processes using SRTF, and Round Robin (with time quantum:2) scheduling algorithms and finally determine a suitable scheduling algorithm based on their average waiting time. Show the details of the calculation.

          Let's assume your ID number is 012345678. It contains nine digits. Consider one extra digit and add this at the end of your ID number. For example, if you chose 9, then you have 10 digits. We have a system with five processes and among the above-mentioned ten digits, the first five digits are the arrival time and the last 5 digits are the Burst time.
0 1 2 3 4 5 6 7 8 9
Arrival time Burst Time
Therefore, Processes P1 to P5 arrive at 0, 1, 2, 3, and 4 respectively for execution. P1 with burst time (BT) 5, P2 with BT 6, P3 with BT 7, P4 with BT 8, and P5 with BT 9.
**If you got any burst time 0 then replace it with the digit 9.
Now complete the following table with your own ID:
Process Arrival Time Burst time
P1
P2
P3
P4
P5
Draw Gantt charts that illustrate the execution of the processes using SRTF, and Round Robin (with time quantum:2) scheduling algorithms and finally determine a suitable scheduling algorithm based on their average waiting time. Show the details of the calculation.

Let's assume your ID number is 012345678. It contains nine digits. Consider one extra digit and add this at the end of your ID number. For example, if you chose 9, then you have 10 digits. We have a system with five processes and among the above-mentioned ten digits, the first five digits are the arrival time and the last 5 digits are the Burst time.
0 1 2 3 4 5 6 7 8 9
Arrival time Burst Time
Therefore, Processes P1 to P5 arrive at 0, 1, 2, 3, and 4 respectively for execution. P1 with burst time (BT) 5, P2 with BT 6, P3 with BT 7, P4 with BT 8, and P5 with BT 9.
**If you got any burst time 0 then replace it with the digit 9.
Now complete the following table with your own ID:
Process Arrival Time Burst time
P1
P2
P3
P4
P5
Draw Gantt charts that illustrate the execution of the processes using SRTF, and Round Robin (with time quantum:2) scheduling algorithms and finally determine a suitable scheduling algorithm based on their average waiting time. Show the details of the calculation.

Added by Susana S.

Question

Please give Ace some feedback