gantt chart maker for scheduling algorithms

The waiting time for process P3 will be 7ms + 9ms because P3 will have to wait for both process P1 and P2 to complete their execution then only the CPU will be allocated to process P3. The waiting time for process P2 will be 7ms because P2 have to wait for process P1 to complete its execution then only CPU will be allocated to P2. Now, the waiting time for process P1 will be 0ms because P1 arrived at 0ms and didn't have to wait for any other processes to execute first. The CPU burst time for process P4 is 5ms. And in the second output screen we will get the Gantt chart of our inputs. There will be two output screens for our program, In first screen we will give our inputs to the program and it will print out the waiting time & turn around time for all the process individually and also the average waiting time and average turnaround time of the processes. Outtextxy( 80, 460, 'Do Not Press Any Key! This screen will be cleared automatically in 10s.') Printf( ' Average turn around time : %d', avg_turnaround_time / no) Printf( ' Average waiting time : %d', avg_waiting_time / no) Printf( ' Turn around time for process P%d : %d ', i, cpuburst + temp_tat) Printf( ' Waiting time for process P%d : %d', i, cpuburst + temp_wt) Printf( ' Enter CPU burst for process P%d : ', i) Printf( ' Enter number of processes : ') Printf( ' First Come First Serve Process Scheduling : ')

Initgraph(& gdriver,& gmode, 'C: \TC \BGI ') Int cpuburst, avg_waiting_time = 0, avg_turnaround_time = 0 Int temp1 = 0, temp2 = 0, i, j, no, temp_tat, temp_wt, sum = 0 This is a program for First Come First Serve Process Scheduling by Lectures.

Gantt chart maker for scheduling algorithms