Question

Process Arrival Time Burst Time P1 0 15 P2 3 2 P3 4 6 P4 8 2 P5 12 10 Draw four Gantt chart that illustrate that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive SJF, non-preemptive SJF. b. What is the waiting time of each process for each of the scheduling algorithms?

          Process
Arrival Time
Burst Time
P1
0
15
P2
3
2
P3
4
6
P4
8
2
P5
12
10
Draw four Gantt chart that illustrate that illustrate the execution
of these processes using the following scheduling algorithms:
FCFS, Preemptive SJF, non-preemptive SJF.
b. What is the waiting time of each process for each of the
scheduling algorithms?

Process
Arrival Time
Burst Time
P1
0
15
P2
3
2
P3
4
6
P4
8
2
P5
12
10
Draw four Gantt chart that illustrate that illustrate the execution
of these processes using the following scheduling algorithms:
FCFS, Preemptive SJF, non-preemptive SJF.
b. What is the waiting time of each process for each of the
scheduling algorithms?

Added by Shawn B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Amany Waheeb

Step 1

Step 1: Create a process timeline based on the given information The table shows 5 processes (P1-P5) with their arrival times and burst times: - P1: Arrival time = 0, Burst time = 15 - P2: Arrival time = 3, Burst time = 2 - P3: Arrival time = 4, Burst time = 6 - Show more…

Show all steps

Thanks for your feedback!

Aniline Lucime Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive SJF, non-preemptive SJF. b. What is the waiting time of each process for each of the scheduling algorithms?