Problem #7: Suppose that the following processes arrived as shown in the following table: Process Burst time (ms) Arriva

[answerhappygod]

Problem 7 Suppose That The Following Processes Arrived As Shown In The Following Table Process Burst Time Ms Arriva 1 (32.55 KiB) Viewed 32 times

Problem 7 Suppose That The Following Processes Arrived As Shown In The Following Table Process Burst Time Ms Arriva 2 (24.95 KiB) Viewed 32 times

Problem 7 Suppose That The Following Processes Arrived As Shown In The Following Table Process Burst Time Ms Arriva 3 (23.17 KiB) Viewed 32 times

Problem #7: Suppose that the following processes arrived as shown in the following table: Process Burst time (ms) Arrival time Priority PI 12 0 5 P2 7 1 4 P3 4 3 P4 2 9 2 P5 6 10 1 P6 3 13 2 1. Draw the Gantt charts that illustrate the execution of these processes using the A-Shortest-Remaining-Time-First (SRTF) scheduling algorithm 1-0 B- Preemptive priority scheduling algorithm 1-0 2. what is the waiting time of each process and the average waiting time for each of the scheduling algorithms? Waiting time SRTF preemptive Priority PI P2 P3 P4 P5 P6 Average waiting time Page 5 of 3

Problem # 8: Suppose that the following processes arrived in the order: P1, P2, P3, P4. Ps. Po Process Burst time Priority (ms) P₁ 10 3 P₂ 12 5 P₁ 4 2 P₁ 2 1 Ps 8 1 P 9 3 1. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: A-First-Come, First-Served (FCFS) scheduling algorithm 1-0 B-Shortest-Job-First (SJF) scheduling algorithm 1-0 C- Round Robin (RR) scheduling algorithm with time slice (quantum) = 5 ms 1-0 Page 6 of 7

D- Non-preemptive priority scheduling algorithm 1-0 2. What is the waiting time of each process and the average waiting time for each of the scheduling algorithms? [1ptx 7] FCFS SJF Waiting Time RR (quantum = 5) Non- preemptive Priority P1 P2 P3 P4 Page 7 of 7 PS P6 P7 Average waiting time