Final answer:
To determine the ATT under FIFO, SJF, and SRT scheduling algorithms, calculate the waiting time for each process. For FIFO, sum up the lengths of all the processes that arrived before it. For SJF, find the length of the shortest process that arrived before it. For SRT, find the length of the currently running process and subtract the elapsed time.
Step-by-step explanation:
In order to determine the average turnaround time (ATT) under different scheduling algorithms, we need to calculate the waiting time for each process. For FIFO (First-In-First-Out), the waiting time for each process can be calculated by summing up the lengths of all the processes that arrived before it. For example, if process p arrives at time 0 and q arrives at time 1, the waiting time for q would be 3 time units, because p has a length of 3. So the total waiting time for q would be 3 + 3 = 6 time units.
For SJF (Shortest Job First), the waiting time for each process can be calculated by finding the length of the shortest process that arrived before it. For example, if process q arrives at time 1, the waiting time for q would be 3 time units, because p is the shortest process that arrived before q and its length is 3. So the total waiting time for q would be 3 + 3 = 6 time units.
For SRT (Shortest Remaining Time), the waiting time for each process can be calculated by finding the length of the currently running process and subtracting the time that has already elapsed. For example, if process p arrived at time 0 and is currently running with 1 time unit remaining, and process q arrives at time 1, the waiting time for q would be 2 time units, because p still has 1 time unit remaining. So the total waiting time for q would be 2 + 1 = 3 time units.