Knowee
Questions
Features
Study Tools

find average turnaround time using FCFSProcess Arrival Time Burst Time wt tat ctP1 0 8 0 8 8P2 1 4 7 11 12P3 2 9 10 19 21P4 3 5 18 23 26Formula usedTATi = Wti + BTiCTi = TATiCTi+1 = Cti + BTi+iWti+1=CTi-ATi+1

Question

find average turnaround time using FCFSProcess Arrival Time Burst Time wt tat ctP1 0 8 0 8 8P2 1 4 7 11 12P3 2 9 10 19 21P4 3 5 18 23 26Formula usedTATi = Wti + BTiCTi = TATiCTi+1 = Cti + BTi+iWti+1=CTi-ATi+1

🧐 Not the exact question you are looking for?Go ask a question

Solution

The given table represents the processes with their arrival time, burst time, waiting time (wt), turnaround time (tat), and completion time (ct). The FCFS (First Come First Serve) scheduling algorithm is used here.

The table is as follows:

Process Arrival Time Burst Time Waiting Time Turnaround Time Completion Time
P1 0 8 0 8 8
P2 1 4 7 11 12
P3 2 9 10 19 21
P4 3 5 18 23 26

The formulas used are:

  • Turnaround Time (TAT) = Waiting Time (WT) + Burst Time (BT)
  • Completion Time (CT) = Turnaround Time (TAT)
  • Next Completion Time (CTi+1) = Current Completion Time (CTi) + Next Burst Time (BTi+1)
  • Next Waiting Time (WTi+1) = Current Completion Time (CTi) - Next Arrival Time (ATi+1)

To find the average turnaround time, we add up all the turnaround times and divide by the number of processes.

So, the average turnaround time = (8 + 11 + 19 + 23) / 4 = 15.25 units.

This problem has been solved

Similar Questions

Consider the given table below and find Completion time (CT), Turn-around time (TAT), Waiting time (WT), Response time (RT), Average Turn-around time and Average Waiting time in case of FCFS scheduling. Process ID Arrival time Burst time P1 2 2 P2 5 6 P3 0 4 P4 0 7 P5 7 4a.The waiting time for process P1 is 9msb.The waiting time for process P1 is 0msc.The waiting time for process P1 is 8msd.The waiting time for process P1 is 4ms

Solve following example by FCFS and SJF CPU schedulingalgorithm. Draw Gantt Chart and calculate Average Waiting Timeand Average Turnaround time.Process Arrival Time Burst TimeP0 0 10P1 1 6P2 3 2P3 5 4

Suppose that the following processes arrive for execution at the times indicated.Each process will run for the amount of time listed. In answering the questions, usenonpreemptive scheduling, and base all decisions on the information you have at the timethe decision must be made.Process Arrival Time Burst TimeP1 0.0 8P2 0.4 4P3 1.0 1a. What is the average turnaround time for these processes with the FCFSscheduling algorithm?b. What is the average turnaround time for these processes with theSJF scheduling algorithm?c. The SJF algorithm is supposed to improve performance, but notice that we choseto run process P1 at time 0 because we did not know that two shorter processes wouldarrive soon. Compute what the average turnaround time will be if the CPU is left idle forthe first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 arewaiting during this idle time, so their waiting time may increase. This algorithm could becalled future-knowledge scheduling.Exercises 3.Consider the following set of processes, with the length of the CPU burstgiven in milliseconds:Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3

find average turnaround time using preemptive SJF ProcessArrival TimeBurst TimeP108P214P329P435

Consider the following three processes in the FCFS.Process ID. Brust-time. Arrival-timeP1 3 3P2 6 6P3 9 9What is the average waiting time?2345

1/2

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.