AIM: Write a C program to simulate Shortest Job First CPU scheduling policy with and without Arrival Time.

Description: In this policy processes are structured in a ready state on the basis of Shortest Job vi

d

Burst Time: Time spent in the running state. $[$Read$]$

Wait Time: Time spent in the ready queue. $[$Start time $-$ arrival time$]$

Start Time: Time at which Process started its execution

$[$Equals to arrival $($for initial process$)$ or finish time of previous process$]$

Finish Time: Time at which Process finished its execution $[$start time $+$ burst time$]$

Turnaround Time: Time period between its Arrival and Finish. $[$Finish time $-$ arrival time$]$

Algorithm:

Start

Read process name, arrival time and burst time

Calculate wait time and turnaround time for each process

Calculate average wait time and turnaround time

Display tabular from of all processes with attributes as follows

$\backslash$table$[[\backslash$table$[[$Process$],[$Name$]],\backslash$table$[[$Arrival$],[$Time$]],\backslash$table$[[$Burst$],[$Time$]],\backslash$table$[[$Wait$],[$Time$]],\backslash$table$[[$Start$],[$Time$]],\backslash$table$[[$Turn$],[$Around$],[$Time$]],\backslash$table$[[$Finish$],[$Time$]]],[$P$0,0,10,,,,],[$P$1,1,15,,,,],[$P$2,3,5,,,,],[$P$3,5,25,,,,]]$

Display average wait time and turnaround time

Stop