The original input was: 3 1 5 30 3 1 5 30 4 0 5 30 3 The (sorted) input is: 3 0 5 30 3 1 5 30 3 1 5 30 4 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 4 unstarted 0 unstarted 0. Before cycle 2: running 3 ready 0 ready 0. Before cycle 3: running 2 ready 0 ready 0. Before cycle 4: running 1 ready 0 ready 0. Before cycle 5: blocked 2 running 3 ready 0. Before cycle 6: blocked 1 running 2 ready 0. Before cycle 7: ready 0 running 1 ready 0. Before cycle 8: ready 0 blocked 2 running 4. Before cycle 9: ready 0 blocked 1 running 3. Before cycle 10: ready 0 ready 0 running 2. Before cycle 11: ready 0 ready 0 running 1. Before cycle 12: running 2 ready 0 blocked 4. Before cycle 13: running 1 ready 0 blocked 3. Before cycle 14: blocked 1 running 5 blocked 2. Before cycle 15: ready 0 running 4 blocked 1. Before cycle 16: ready 0 running 3 ready 0. Before cycle 17: ready 0 running 2 ready 0. Before cycle 18: ready 0 running 1 ready 0. Before cycle 19: running 3 blocked 2 ready 0. Before cycle 20: running 2 blocked 1 ready 0. Before cycle 21: running 1 ready 0 ready 0. Before cycle 22: blocked 2 ready 0 running 1. Before cycle 23: blocked 1 running 4 blocked 4. Before cycle 24: ready 0 running 3 blocked 3. Before cycle 25: ready 0 running 2 blocked 2. Before cycle 26: ready 0 running 1 blocked 1. Before cycle 27: running 1 blocked 2 ready 0. Before cycle 28: blocked 1 blocked 1 running 3. Before cycle 29: ready 0 ready 0 running 2. Before cycle 30: ready 0 ready 0 running 1. Before cycle 31: running 2 ready 0 blocked 1. Before cycle 32: running 1 ready 0 ready 0. Before cycle 33: blocked 3 running 3 ready 0. Before cycle 34: blocked 2 running 2 ready 0. Before cycle 35: blocked 1 running 1 ready 0. Before cycle 36: ready 0 blocked 1 running 3. Before cycle 37: ready 0 ready 0 running 2. Before cycle 38: ready 0 ready 0 running 1. Before cycle 39: running 3 ready 0 blocked 3. Before cycle 40: running 2 ready 0 blocked 2. Before cycle 41: running 1 ready 0 blocked 1. Before cycle 42: blocked 2 running 3 ready 0. Before cycle 43: blocked 1 running 2 ready 0. Before cycle 44: ready 0 running 1 ready 0. Before cycle 45: ready 0 blocked 2 running 5. Before cycle 46: ready 0 blocked 1 running 4. Before cycle 47: ready 0 ready 0 running 3. Before cycle 48: ready 0 ready 0 running 2. Before cycle 49: ready 0 ready 0 running 1. Before cycle 50: running 3 ready 0 blocked 3. Before cycle 51: running 2 ready 0 blocked 2. Before cycle 52: running 1 ready 0 blocked 1. Before cycle 53: blocked 1 running 5 ready 0. Before cycle 54: ready 0 running 4 ready 0. Before cycle 55: ready 0 running 3 ready 0. Before cycle 56: ready 0 running 2 ready 0. Before cycle 57: ready 0 running 1 ready 0. Before cycle 58: ready 0 blocked 1 running 4. Before cycle 59: ready 0 ready 0 running 3. Before cycle 60: ready 0 ready 0 running 2. Before cycle 61: ready 0 ready 0 running 1. Before cycle 62: running 2 ready 0 blocked 1. Before cycle 63: running 1 ready 0 ready 0. Before cycle 64: blocked 2 running 5 ready 0. Before cycle 65: blocked 1 running 4 ready 0. Before cycle 66: ready 0 running 3 ready 0. Before cycle 67: ready 0 running 2 ready 0. Before cycle 68: ready 0 running 1 ready 0. Before cycle 69: ready 0 blocked 1 running 2. Before cycle 70: ready 0 ready 0 running 1. Before cycle 71: running 5 ready 0 blocked 4. Before cycle 72: running 4 ready 0 blocked 3. Before cycle 73: running 3 ready 0 blocked 2. Before cycle 74: running 2 ready 0 blocked 1. Before cycle 75: running 1 ready 0 ready 0. Before cycle 76: blocked 2 running 4 ready 0. Before cycle 77: blocked 1 running 3 ready 0. Before cycle 78: ready 0 terminated 0 running 5. Before cycle 79: ready 0 terminated 0 running 4. Before cycle 80: ready 0 terminated 0 running 3. Before cycle 81: ready 0 terminated 0 running 2. Before cycle 82: ready 0 terminated 0 running 1. Before cycle 83: running 1 terminated 0 blocked 4. Before cycle 84: blocked 3 terminated 0 blocked 3. Before cycle 85: blocked 2 terminated 0 blocked 2. Before cycle 86: blocked 1 terminated 0 blocked 1. Before cycle 87: running 2 terminated 0 ready 0. Before cycle 88: running 1 terminated 0 ready 0. Before cycle 89: blocked 2 terminated 0 running 1. Before cycle 90: blocked 1 terminated 0 blocked 1. Before cycle 91: running 4 terminated 0 ready 0. Before cycle 92: running 3 terminated 0 ready 0. Before cycle 93: terminated 0 terminated 0 running 3. Before cycle 94: terminated 0 terminated 0 running 2. The scheduling algorithm used was First Come First Served Process 0: (A,B,C,IO) = (0,5,30,3) Finishing time: 92 Turnaround time: 92 I/O time: 21 Waiting time: 41 Process 1: (A,B,C,IO) = (1,5,30,3) Finishing time: 77 Turnaround time: 76 I/O time: 11 Waiting time: 35 Process 2: (A,B,C,IO) = (1,5,30,4) Finishing time: 94 Turnaround time: 93 I/O time: 25 Waiting time: 38 Summary Data: Finishing time: 94 CPU Utilization: 0.957447 I/O Utilization: 0.531915 Throughput: 3.191489 processes per hundred cycles Average turnaround time: 87.000000 Average waiting time: 38.000000