Once each process is done processing its "Burst Time", it goes to the waiting queue,

then "Comes back" to the ready queue after the time shown.

You are required to simulate the CPU schedule for a period of

$2$

$0$

$0$

$$time units.

For each of the following scheduling algorithms, your program must show the Gantt

chart, average waiting time, and average turnaround time.

$1$

$-$

$$First Come First Served.

Shortest Job First.

$3$

$-$

$$Shortest Remaining Time First.

$4$

$-$

$$Round Robin, with q

$=$

$5$

$5$

$-$

$$Preemptive Priority Scheduling, with aging; where priority is decremented by

$1$

$$if the process remains in the ready queue for

$5$

$$time units.

$6$

$-$

$$Non

$-$

preemptive Priority Scheduling, with aging; where priority is

decremented by

$1$

$$if the process remains in the ready queue for

$5$

$$time units.

For this assignment, you may use any programming language of your choosing.

Snipping Tool

Hint: You should create a process that initially creates the

$7$

$$processes$,$ and

continuously updates the status of the processes, and another process that schedules

those processes, and plots the results.

The termination time of a process is the last time it was in execution inside the CPU. To

calculate the waiting time, we consider the last time the process entered into execution.

Any remaining time until the end of the

$2$

$0$

$0$

$$period is considered as the process being

terminated and not waiting.write the code in python and dont forget to deal with comes back after as waiting queue and the cpu temante at

$2$

$0$

$0$

$$units time

$.$and i will provide the output that should beFaculty of Engineering & Technology

Department of Electrical & Computer Engineering

ENCS$3390$: Operating System Concepts

First Semester, $2023/2024$

Programming Task $2$

Published: Dec $6,2023.$ Due: Jan $2,2023$ by midnight.

Consider the following set of processes:

Once each process is done processing its $$Burst Time$,$ it goes to the waiting queue,

then $$Comes back$$ to the ready queue after the time shown.

You are required to simulate the CPU schedule for a period of $200$ time units.

For each of the following scheduling algorithms, your program must show the Gantt

chart, average waiting time, and average turnaround time.

$1-$ First Come First Served.

$2-$ Shortest Job First.

$3-$ Shortest Remaining Time First.

$4-$ Round Robin, with q $=5$

$5-$ Preemptive Priority Scheduling, with aging; where priority is decremented by

$1$ if the process remains in the ready queue for $5$ time units.

$6-$ Non$-$preemptive Priority Scheduling, with aging; where priority is

decremented by $1$ if the process remains in the ready queue for $5$ time units.

For this assignment, you may use any programming language of your choosing.

Process Arrival Time Burst Time Comes back

after

Priority

P$101023$

P$21842$

P$331463$

P$44781$

P$56530$

P$57461$

P$78692$

Hint: You should create a process that initially creates the $7$ processes, and

continuously updates the status of the processes, and another process that schedules

those processes, and plots the results.