Question: consider the following set of processes: Process Arrival time Priority CPU burst P1 0 3 3 P2 1 2 5 P3 3 2 2 P4

consider the following set of processes:

Process

Arrival time

Priority

CPU burst

P1

0

3

3

P2

1

2

5

P3

3

2

2

P4

9

1

2

For each of the following scheduling algorithms, draw a Gantt chart showing which process will be running in the CPU and calculate the average waiting and the average turnaround time.

  1. a) SJF (preemptive)

  2. b) Priority (non-preemptive)

  3. c) Priority (preemptive)

  4. d) RRwithq=2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!