#include

#include

#include

#define MAXNUMBER $100$

typedef struct $\{$

char id$[10]$;

int arrival$\_$time;

int burst$\_$time;

int wait$\_$time;

int turnaround$\_$time;

$\}$ Process;

Process allprocess$[$MAXNUMBER$]$;

$//$it will collect all data from file and find how many time cost.

int read$\_$processes$($const char $*$filename$)\{$

$//$by helpful hints

int i $=0$;

int allticks $=0$;

FILE $*$file $=$ fopen$($filename$,"$r$")$;

if $($file $==$ NULL$)\{$

printf$("$Unable to open file

$")$;

exit$($EXIT$\_$FAILURE$)$;

$\}$

while$($fscanf$($file$,"\%[^,],\%$d$",$allprocess$[$i$].$id$,$&allprocess$[$i$].$burst$\_$time$)==2)\{$

allprocess$[$i$].$arrival$\_$time $=$ i;

allprocess$[$i$].$wait$\_$time $=0$;

allprocess$[$i$].$turnaround$\_$time $=0$;

allticks $+=$ allprocess$[$i$].$burst$\_$time;

i$++$;

$\}$

fclose$($file$)$;

return allticks;

$\}$

void fcfs$($int num$\_$processes$)\{$

int P $=0$;

Process working$[$MAXNUMBER$]$;

printf$("$First Come First Served

$")$;

for$($int i $=0$; i $<$ num$\_$processes; i$++)\{$

if$($i $==$ allprocess$[$i$].$arrival$\_$time$)\{$

working$[$i$]=$ allprocess$[$i$]$;

$\}$

printf$("$T$\%$d : P$\%$d $-$ Burst left $\%$d$,$ Wait time $\%$d$,$ Turnaround time $\%$d

$",$i$,$working$[$P$].$arrival$\_$time,working$[$P$].$burst$\_$time,working$[$P$].$wait$\_$time,working$[$P$].$turnaround$\_$time$)$;

if$($P $<$ i$)\{$

if$($i $<$ number$\_$process$)\{$

for$($int tmp $=$ P;$($i$-$tmp$)!=0$;tmp$++)\{$

working$[$tmp$+1].$wait$\_$time$++$;

$\}$

$\}$else$\{$

for$($int tmp $=$ P;$($number$\_$process $-$ tmp$)!=0$;tmp$++)\{$

working$[$tmp$+1].$wait$\_$time$++$;

$\}$

$\}$

$\}$

if$($working$[$P$].$burst$\_$time $!=0)\{$

working$[$P$].$burst$\_$time$--$;

working$[$P$].$turnaround$\_$time$++$;

$\}$else$\{$

P$++$;

$\}$

$\}$

$\}$

void sjf$($int num$\_$processes$)\{$

$//$ Your SJF implementation goes here

$\}$

void round$\_$robin$($int num$\_$processes, int quantum$)\{$

$//$ Your Round Robin implementation goes here

$\}$

int main$($int argc, char $*$argv$[])\{$

if $($argc $<3||$ argc $>4)\{$

printf$("$Wrong format, please use correct format

$")$;

return EXIT$\_$FAILURE;

$\}$

int num$\_$processes $=$ read$\_$processes$($argv$[$argc $-1])$;

if $($strcmp$($argv$[1],"-$f$")==0)\{$

fcfs$($num$\_$processes$)$;

$\}$ else if $($strcmp$($argv$[1],"-$s$")==0)\{$

sjf$($num$\_$processes$)$;

$\}$ else if $($strcmp$($argv$[1],"-$r$")==0)\{$

if $($argc $!=4)\{$

printf$("$For Round Robin, provide a time quantum.

$")$;

return EXIT$\_$FAILURE;

$\}$

int quantum $=$ atoi$($argv$[2])$;

if $($quantum $<=0)\{$

printf$("$Time quantum must be a positive integer.

$")$;

return EXIT$\_$FAILURE;

$\}$

round$\_$robin$($num$\_$processes, quantum$)$;

$\}$ else $\{$

printf$("$Invalid algorithm option.

$")$;

return EXIT$\_$FAILURE;

$\}$

return EXIT$\_$SUCCESS;

$\}$

why it has core dumped