import matplotlib.pyplot as plt

class Process:

def $\_\_$init$\_\_($self$,$ num, Arrival$\_$time, Burst$\_$time, Comes$\_$back$\_$after, Priority$)$:

self.num $=$ num

self.Arrival$\_$time $=$ Arrival$\_$time

self.Burst$\_$time $=$ Burst$\_$time

self.remaining$\_$time $=$ Burst$\_$time

self.Comes$\_$back$\_$after $=$ Comes$\_$back$\_$after

self.Priority $=$ Priority

#$===========================================================================================================================$

def FirstComeFirstServed$($processes$)$:

TurnAroundTimeTotalwithSupposed$\_$p $=0$

TurnAroundTime $=0$

WaitingTime $=0$

GanttChart $=[]$

TurnAroundTimeTotal $=0$

WaitingTimeTotal $=0$

processes.sort$($key$=$lambda y: y$.$Arrival$\_$time$)$

Size $=0$

currentnTime $=0$

Timer $=0$

while Timer $<200$:

for process in processes:

if process.Arrival$\_$time $<=$ currentnTime and Timer $<200$:

if currentnTime $+$ process.Burst$\_$time $<=200$:

Size $+=1$

GanttChart.append$(($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$))$

print$($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$)$

currentnTime $+=$ process.Burst$\_$time

TurnAroundTime $=$ currentnTime $-$ process.Arrival$\_$time

TurnAroundTimeTotal $+=$ TurnAroundTime

WaitingTime $=$ TurnAroundTime $-$ process.Burst$\_$time

WaitingTimeTotal $+=$ WaitingTime

Timer $=$ currentnTime

else:

currentnTime $=200$

Timer $=$ currentnTime

TurnAroundTime $=$ currentnTime $-$ process.Arrival$\_$time

TurnAroundTimeTotalwithSupposed$\_$p $+=$ TurnAroundTime $+$ TurnAroundTimeTotal

TurnAroundTimeTotalwithSupposed$\_$p $=$ TurnAroundTimeTotalwithSupposed$\_$p $/$ Size

break

average$\_$waiting$\_$time $=$ WaitingTimeTotal $/$ Size

average$\_$turnaround$\_$time $=$ TurnAroundTimeTotal $/$ Size

return GanttChart, average$\_$waiting$\_$time, average$\_$turnaround$\_$time, TurnAroundTimeTotalwithSupposed$\_$p

#$===========================================================================================================$

def shortest$\_$Job$\_$First$($processes$)$:

GanttChart $=[]$

temp $=0$

ready$\_$queue $=[]$

waiting$\_$queue $=[]$

currentnTime $=0$

Timer $=0$

Size $=0$

TurnAroundTimeTotalwithSupposed$\_$p $=0$

TurnAroundTime $=0$

WaitingTime $=0$

TurnAroundTimeTotal $=0$

WaitingTimeTotal $=0$

GanttChart.append$(($processes$[0].$num, currentnTime, currentnTime $+$ processes$[0].$Burst$\_$time$))$

currentnTime $+=$ processes$[0].$Burst$\_$time

processes.sort$($key$=$lambda y: $($y$.$Burst$\_$time$))$

Size $+=1$

while Timer $<200$:

for process in processes:

if Timer $<200$:

if currentnTime $+$ process.Burst$\_$time $<=200$:

if waiting$\_$queue:

found$\_$waiting $=$ False

for waiting$\_$process in waiting$\_$queue:

if temp $>=$ waiting$\_$process.Comes$\_$back$\_$after:

ready$\_$queue.append$($waiting$\_$process$)$

waiting$\_$queue.remove$($waiting$\_$process$)$

found$\_$waiting $=$ True

break # Exit the waiting queue loop after adding processes to the ready queue

else: break

if not found$\_$waiting:

ready$\_$queue.append$($process$)$

running$\_$process $=$ ready$\_$queue.pop$(0)$

GanttChart.append$(($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$))$

print$($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$)$

waiting$\_$queue.append$($running$\_$process$)$

Size $+=1$

temp $+=$ process.Burst$\_$time

currentnTime $+=$ process.Burst$\_$time

TurnAroundTime $=$ currentnTime $-$ process.Arrival$\_$time

TurnAroundTimeTotal $+=$ TurnAroundTime

WaitingTime $=$ TurnAroundTime $-$ process.Burst$\_$time

WaitingTimeTotal $+=$ WaitingTime

Timer $=$ currentnTime

else:

running$\_$process $=$ ready$\_$queue.pop$(0)$

GanttChart.append$($

$($running$\_$process.num, currentnTime, currentnTime $+$ running$\_$process.Burst$\_$time$))$

print$($process$.$num, currentnTime, currentnTime $+$ process.Burst$\_$time$)$

waiting$\_$queue.append$($running$\_$process$)$

temp $+=$ running$\_$process.Burst$\_$time

currentnTithis is my code for this project Faculty of Engineering & Technology

Department of Electrical & Comp