<33; i + +)
{if (i == 17) (В«% cВ», 197); (В«% cВ», 196);
} (В«% cВ», 180); (temp! = NULL)
{count + +; (kk == 1)
{printf (" n t t% c% d.% c% 3d% cВ», 179, temp-> process_no, 179, temp-> btime, 179);
} (kk == 2)
{if (temp == q)/* First Process In The Ready Queue */
{wtime = 0; + = temp-> btime; + = wtime;
}
{wtime = total; + = temp-> btime; + = wtime;
} (В« n t t% c% d.% c% 3d% cВ», 179, temp-> process_no, 179, wtime, 179);
} = temp-> link;
} (В« n t t% cВ», 192); (i = 1; i <33; i + +)
{if (i == 17) (В«% cВ», 193); (В«% cВ», 196);
} (В«% cВ», 217); (kk == 2)
{printf (" nThe Average Waiting Time (% d% c% d) =% .2 fВ», avg, 246, count, float (avg/float (count)));
}
} chart (struct node ** q)
{(В« n"); (В« nThe Glant Chart Is As Follows: - n"); node * temp, * temp1, * temp2, * temp3, * temp4; = * q; temp1 = * q; temp2 = * q; temp3 = * q; temp4 = * q; sum = 0; float sfactor; (temp4! = NULL)
{sum + = temp4-> btime; = temp4-> link;
} (sum <80)
{sfactor = 1.0;
}
{sfactor = (sum% 80)/float (sum);
} i, k = 0; (В«% dВ», k); (temp3! = NULL)
{if ((sfactor * temp3-> btime) == 0)
{goto harsh;
} (i = -1; i <= (sfactor * temp3-> btime); i + +)
{printf («»);
} + = temp3-> btime; (В«% dВ», k);: = temp3-> link;
} (В« n"); (temp! = NULL)
{if (temp == * q)
{(В«% c% cВ», 218,196); ((sfactor * temp-> btime) == 0)
{goto last;
} (i = -1; i <= (sfactor * temp-> btime); i + +)
{printf ("% cВ», 196);
} (temp-> link! = NULL)
{printf ("% cВ», 194);
}
{printf ("% cВ», 191);
}
}
{if ((sfactor * temp-> btime) == 0)
{goto last;
} (i = -1; i <= (sfactor * temp-> btime); i + +)
{printf ("% cВ», 196);
} (temp-> link! = NULL)
{printf ("% cВ», 194);
}
{printf ("% cВ», 191);
}
}: = temp-> link;
} (В« n"); (В«% ...
