The original input was: 3  0 1 5 1  0 1 5 1  3 1 5 1 
The (sorted) input is:  3  0 1 5 1  0 1 5 1  3 1 5 1 

This detailed printout gives the state and remaining burst for each process

Before cycle    0:   unstarted  0  unstarted  0  unstarted  0.
Before cycle    1:     running  1      ready  0  unstarted  0.
Before cycle    2:     blocked  1    running  1  unstarted  0.
Before cycle    3:     running  1    blocked  1  unstarted  0.
Before cycle    4:     blocked  1    running  1      ready  0.
Before cycle    5:       ready  0    blocked  1    running  1.
Before cycle    6:     running  1      ready  0    blocked  1.
Before cycle    7:     blocked  1    running  1      ready  0.
Before cycle    8:       ready  0    blocked  1    running  1.
Before cycle    9:     running  1      ready  0    blocked  1.
Before cycle   10:     blocked  1    running  1      ready  0.
Before cycle   11:       ready  0    blocked  1    running  1.
Before cycle   12:     running  1      ready  0    blocked  1.
Before cycle   13:  terminated  0    running  1      ready  0.
Before cycle   14:  terminated  0 terminated  0    running  1.
Before cycle   15:  terminated  0 terminated  0    blocked  1.
Before cycle   16:  terminated  0 terminated  0    running  1.
The scheduling algorithm used was First Come First Served

Process 0:
	(A,B,C,IO) = (0,1,5,1)
	Finishing time: 12
	Turnaround time: 12
	I/O time: 4
	Waiting time: 3

Process 1:
	(A,B,C,IO) = (0,1,5,1)
	Finishing time: 13
	Turnaround time: 13
	I/O time: 4
	Waiting time: 4

Process 2:
	(A,B,C,IO) = (3,1,5,1)
	Finishing time: 16
	Turnaround time: 13
	I/O time: 4
	Waiting time: 4

Summary Data:
	Finishing time: 16
	CPU Utilization: 0.937500
	I/O Utilization: 0.750000
	Throughput: 18.750000 processes per hundred cycles
	Average turnaround time: 12.666667
	Average waiting time: 3.666667