Ayush Goyal

Roll. No: 28
B. Tech C.S.E
3rd Year Section> A

Assignment No.2
CPU Scheduling

Que.1

Proces Arrival Burst Priori

s Time Time ty

P1 2 7 0

P2 1 10 4

P3 0 15 3

P4 4 11 2

P5 3 4 1

What is the average waiting time and average turnaround time for these
processes

with following algorithms?

i) FCFS

ii) SJF

iii) Round Robin (Time Slice=2ms)

iv) Priority Scheduling

Sol.s 1

What is the average waiting time and average turnaround time for these processes
  FCFS (First Come First Served)

FCFS schedules processes based on their arrival time. The process that arrives first is
executed first.

Execution Order:

> P3 (Arrival Time = 0)

> P2 (Arrival Time = 1)

> P5 (Arrival Time = 3)

> P1 (Arrival Time = 2)

> P4 (Arrival Time = 4)

Completion Times:

> P3: 15 (0 + 15)

> P2: 25 (15 + 10)

> P5: 29 (25 + 4)

> P1: 36 (29 + 7)

> P4: 47 (36 + 11)

Turnaround Times:

> P3: 15 > 0 = 15

> P2: 25 > 1 = 24

> P5: 29 > 3 = 26

> P1: 36 > 2 = 34

> P4: 47 > 4 = 43

Waiting Times:

> P3: 15 > 15 = 0

> P2: 24 > 10 = 14

> P5: 26 > 4 = 22

> P1: 34 > 7 = 27

> P4: 43 > 11 = 32

Average Waiting Time (AWT):

0+14+22+27+32 /5=19

Average Turnaround Time (ATAT):

15+24+26+34+43/5=28.4

 SJF (Shortest Job First)

SJF schedules processes based on the shortest burst time first. Among the processes
that are ready, the one with the shortest burst time is executed next.

Execution Order:

> P3 (Arrival Time = 0, Burst Time = 15)

> P5 (Arrival Time = 3, Burst Time = 4)

> P1 (Arrival Time = 2, Burst Time = 7)

> P4 (Arrival Time = 4, Burst Time = 11)

> P2 (Arrival Time = 1, Burst Time = 10)

Completion Times:

> P3: 15

> P5: 19 (15 + 4)

> P1: 26 (19 + 7)

> P4: 37 (26 + 11)

> P2: 47 (37 + 10)

Turnaround Times:

> P3: 15 > 0 = 15

> P5: 19 > 3 = 16

> P1: 26 > 2 = 24

> P4: 37 > 4 = 33

> P2: 47 > 1 = 46

Waiting Times:

> P3: 15 > 15 = 0

> P5: 16 > 4 = 12

> P1: 24 > 7 = 17

> P4: 33 > 11 = 22

> P2: 46 > 10 = 36

Average Waiting Time (AWT): 17.4

Average Turnaround Time (ATAT): 26.8

 Round Robin (Time Slice = 2 Ms)

To calculate the average waiting time (AWT) and average turnaround time (ATAT) for
Round Robin scheduling with a time slice of 2 ms, follow these steps:

Completion Times:

> P5: 14

> P1: 28

> P2: 32

> P3: 38

> P4: 50

Turnaround Times:

> P5: 14 > 3 = 11

> P1: 28 > 2 = 26

> P2: 32 > 1 = 31

> P3: 38 > 0 = 38

> P4: 50 > 4 = 46

Waiting Times:

> P5: 11 > 4 = 7

> P1: 26 > 7 = 19

> P2: 31 > 10 = 21

> P3: 38 > 15 = 23

> P4: 46 > 11 = 35

Average Waiting Time (AWT): 21 ms

Average Turnaround Time (ATAT): 30.4 ms

 Priority Scheduling

Priority Scheduling executes processes based on their priority (lower number

indicates higher priority). For processes with the same priority, FCFS is used.

Execution Order:

> P1 (Priority = 0)

> P5 (Priority = 1)

> P4 (Priority = 2)

> P3 (Priority = 3)

> P2 (Priority = 4)

Completion Times:

> P1: 7 + 2 = 9

> P5: 13 (9 + 4)

> P4: 24 (13 + 11)

> P3: 39 (24 + 15)

> P2: 49 (39 + 10)

Turnaround Times:

> P1: 9 > 2 = 7

> P5: 13 > 3 = 10

> P4: 24 > 4 = 20

> P3: 39 > 0 = 39

> P2: 49 > 1 = 48

Waiting Times:

> P1: 7 > 7 = 0

> P5: 10 > 4 = 6

> P4: 20 > 11 = 9

> P3: 39 > 15 = 24

> P2: 48 > 10 = 38

Average Waiting Time (AWT): 15.4

Average Turnaround Time (ATAT): 24.8

Que. 2

Proces Arrival Burst Priori

s Time Time ty

P1 0 6 3

P2 1 4 1

P3 2 5 2

P4 3 8 4

What is the average waiting time and average turnaround time for these
processes with following algorithms?

i) FCFS

ii) SJF

iii) Round Robin (Time Slice=3ms)

iv) Priority Scheduling

Sol.2
 FCFS (First Come first Served)
Execution Order:

> P1 (Arrival Time = 0)

> P2 (Arrival Time = 1)

> P3 (Arrival Time = 2)

> P4 (Arrival Time = 3)

Completion Times:

> P1: 6 (0 + 6)

> P2: 10 (6 + 4)

> P3: 15 (10 + 5)

> P4: 23 (15 + 8)

Turnaround Times:

> P1: 6 > 0 = 6

> P2: 10 > 1 = 9

> P3: 15 > 2 = 13

> P4: 23 > 3 = 20

Waiting Times:

> P1: 6 > 6 = 0

> P2: 9 > 4 = 5

> P3: 13 > 5 = 8

> P4: 20 > 8 = 12

Average Waiting Time (AWT): 6.25

Average Turnaround Time (ATAT): 12

 SJF (Shortest Job First)

Execution Order:

1. Calculate availability:

> P1: Arrival Time = 0, Burst Time = 6

> P2: Arrival Time = 1, Burst Time = 4

> P3: Arrival Time = 2, Burst Time = 5

> P4: Arrival Time = 3, Burst Time = 8

2. Sort based on burst time (if arrival time is the same, use FCFS):

> P1 (6 ms)

> P2 (4 ms)

> P3 (5 ms)

> P4 (8 ms)

3. Order of execution based on burst time:

> P2 (Arrival Time = 1, Burst Time = 4)

> P3 (Arrival Time = 2, Burst Time = 5)

> P1 (Arrival Time = 0, Burst Time = 6)

> P4 (Arrival Time = 3, Burst Time = 8)

Completion Times:

> P2: 5 (1 + 4)

> P3: 10 (5 + 5)

> P1: 16 (10 + 6)

> P4: 24 (16 + 8)

Turnaround Times:

> P2: 5 > 1 = 4

> P3: 10 > 2 = 8

> P1: 16 > 0 = 16

> P4: 24 > 3 = 21

Waiting Times:

> P2: 4 > 4 = 0

> P3: 8 > 5 = 3

> P1: 16 > 6 = 10

> P4: 21 > 8 = 13

Average Waiting Time (AWT): 6.5

Average Turnaround Time (ATAT): 12.25

 Round Robin (Time Slice = 3 Ms)

Execution Order:

> Cycle 1: P1(3), P2(3), P3(3), P4(3)

> Cycle 2: P1(3), P2(1), P3(3), P4(3)

> Cycle 3: P1(0), P3(2), P4(3)

> Cycle 4: P3(0), P4(5)

> Cycle 5: P4(2)

Completion Times:

> P1: 3 (1st Cycle) + 3 (2nd Cycle) = 6 + 3 = 9

> P2: 3 (1st Cycle) + 1 (2nd Cycle) = 4 + 6 = 10

> P3: 3 (1st Cycle) + 3 (2nd Cycle) + 2 (3rd Cycle) = 8 + 7 = 15

> P4: 3 (1st Cycle) + 3 (2nd Cycle) + 3 (3rd Cycle) + 2 (4th Cycle) = 11 + 9 = 20

Turnaround Times:

> P1: 9 > 0 = 9

> P2: 10 > 1 = 9

> P3: 15 > 2 = 13

> P4: 20 > 3 = 17

Waiting Times:

> P1: 9 > 6 = 3

> P2: 9 > 4 = 5

> P3: 13 > 5 = 8

> P4: 17 > 8 = 9

Average Waiting Time (AWT): 6.25

Average Turnaround Time (ATAT): = 12

  Priority Scheduling

Execution Order:

1. Sort by priority:

> P2 (Priority = 1)

> P3 (Priority = 2)

> P1 (Priority = 3)

> P4 (Priority = 4)

2. Order of execution:

> P2 (Arrival Time = 1, Burst Time = 4)

> P3 (Arrival Time = 2, Burst Time = 5)

> P1 (Arrival Time = 0, Burst Time = 6)

> P4 (Arrival Time = 3, Burst Time = 8)

Completion Times:

> P2: 5 (1 + 4)

> P3: 10 (5 + 5)

> P1: 16 (10 + 6)

> P4: 24 (16 + 8)

Turnaround Times:

> P2: 5 > 1 = 4

> P3: 10 > 2 = 8

> P1: 16 > 0 = 16

> P4: 24 > 3 = 21

Waiting Times:

> P2: 4 > 4 = 0

> P3: 8 > 5 = 3

> P1: 16 > 6 = 10

> P4: 21 > 8 = 13

Average Waiting Time (AWT): 6.5

Average Turnaround Time (ATAT): 12.25

Que.3

Proces Arrival Burst Priorit

s Time Time y

P1 2 5 3

P2 1 3 1

P3 0 8 2

P4 3 6 4

What is the average waiting time and average turnaround time for these
processes with following algorithms?

i) FCFS

ii) SJF

iii) Round Robin (Time Slice=2ms)

iv) Priority Scheduling

Sol.3
 FCFS (First Come First Served)
Execution Order:

> P3 (Arrival Time = 0)

> P2 (Arrival Time = 1)

> P1 (Arrival Time = 2)

> P4 (Arrival Time = 3)

Completion Times:

> P3: 8 (0 + 8)

> P2: 11 (8 + 3)

> P1: 16 (11 + 5)

> P4: 22 (16 + 6)

Turnaround Times:

> P3: 8 > 0 = 8

> P2: 11 > 1 = 10

> P1: 16 > 2 = 14

> P4: 22 > 3 = 19

Waiting Times:

> P3: 8 > 8 = 0

> P2: 10 > 3 = 7

> P1: 14 > 5 = 9

> P4: 19 > 6 = 13

Average Waiting Time (AWT): 7.25

Average Turnaround Time (ATAT): 12.75

 SJF (Shortest Job First)

Execution Order:

1. Calculate availability:

> P3 (Arrival Time = 0, Burst Time = 8)

> P2 (Arrival Time = 1, Burst Time = 3)

> P1 (Arrival Time = 2, Burst Time = 5)

> P4 (Arrival Time = 3, Burst Time = 6)

2. Sort by burst time, considering the arrival times:

> P2 (3 ms)

> P1 (5 ms)

> P4 (6 ms)

> P3 (8 ms)

3. Order of execution:
 > P2 (Arrival Time = 1, Burst Time = 3)

> P1 (Arrival Time = 2, Burst Time = 5)

> P4 (Arrival Time = 3, Burst Time = 6)

> P3 (Arrival Time = 0, Burst Time = 8)

Completion Times:

> P2: 4 (1 + 3)

> P1: 9 (4 + 5)

> P4: 15 (9 + 6)

> P3: 23 (15 + 8)

Turnaround Times:

> P2: 4 > 1 = 3

> P1: 9 > 2 = 7

> P4: 15 > 3 = 12

> P3: 23 > 0 = 23

Waiting Times:

> P2: 3 > 3 = 0

> P1: 7 > 5 = 2

> P4: 12 > 6 = 6

> P3: 23 > 8 = 15

Average Waiting Time (AWT): 5.75

Average Turnaround Time (ATAT): 11.25

 Round Robin (Time Slice = 2ms)

Execution Order:

> Cycle 1: P3(2), P2(2), P1(2), P4(2)

> Cycle 2: P3(4), P2(1), P1(2), P4(2)

> Cycle 3: P3(6), P1(2), P4(2)

> Cycle 4: P3(8), P4(4)

> Cycle 5: P4(6)

Completion Times:

> P3: 8 ms (8 > 0)

> P2: 5 ms (5 > 1)

> P1: 12 ms (12 > 2)

> P4: 20 ms (20 > 3)

Turnaround Times:

> P3: 8 > 0 = 8

> P2: 5 > 1 = 4

> P1: 12 > 2 = 10

> P4: 20 > 3 = 17

Waiting Times:

> P3: 8 > 8 = 0

> P2: 4 > 3 = 1

> P1: 10 > 5 = 5

> P4: 17 > 6 = 11

Average Waiting Time (AWT): 4.25

Average Turnaround Time (ATAT): 9.75

 Priority Scheduling

Execution Order:

1. Sort by priority:

> P2 (Priority = 1)

> P3 (Priority = 2)

> P1 (Priority = 3)
 > P4 (Priority = 4)

2. Order of execution:

> P2 (Arrival Time = 1, Burst Time = 3)

> P3 (Arrival Time = 0, Burst Time = 8)

> P1 (Arrival Time = 2, Burst Time = 5)

> P4 (Arrival Time = 3, Burst Time = 6)

Completion Times:

> P2: 4 (1 + 3)

> P3: 12 (4 + 8)

> P1: 17 (12 + 5)

> P4: 23 (17 + 6)

Turnaround Times:

> P2: 4 > 1 = 3

> P3: 12 > 0 = 12

> P1: 17 > 2 = 15

> P4: 23 > 3 = 20

Waiting Times:

> P2: 3 > 3 = 0

> P3: 12 > 8 = 4

> P1: 15 > 5 = 10

> P4: 20 > 6 = 14

Average Waiting Time (AWT): 7

Average Turnaround Time (ATAT): 12.5