Scheduling algorithm
1. FCFS (First Come First Serve) Scheduling Algorithm: Input n processes with Arrival Time (AT) and Burst Time (BT). Sort processes by Arrival Time. For the first process: Completion Time (CT) = AT + BT For each next process: CT = max(previous CT, current AT) + BT Calculate Turnaround Time (TAT) = CT - AT. Calculate Waiting Time (WT) = TAT - BT. Calculate average TAT and WT. Pseudo Code: text Start Input n For i = 1 to n Input AT[i], BT[i] Sort processes by AT CT[1] = AT[1] + BT[1] For i = 2 to n CT[i] = max(CT[i-1], AT[i]) + BT[i] EndFor For i = 1 to n TAT[i] = CT[i] - AT[i] WT[i] = TAT[i] - BT[i] EndFor Calculate average TAT and WT Print CT, TAT, WT, Average TAT, Average WT End 2. SJF (Shortest Job First) Non-preemptive Scheduling Algorithm: Input n processes with Arrival Time (AT) and Burst Time (BT). Initialize time = 0 and completed process count = 0. While all processes are not completed: Select...