subject

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, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made.

Process Arrival Time Burst Time
P1 0.0 8
P2 0.4 4
P3 1.0 1
a) What is the average turnaround time for these processes with the FCFS scheduling algorithm?

b) What is the average turnaround time for these processes with the SJF scheduling algorithm?

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 06:00
In outlook how can cherie look at the details of an event that appears on the month view of her calendar? check all that apply. by switching to the detail view by switching to the week view by switching to the day view by right-clicking on the event by double-clicking on the event by highlighting the event
Answers: 2
question
Computers and Technology, 22.06.2019 22:30
The qwerty keyboard is the most common layout of keys on a keyboard
Answers: 3
question
Computers and Technology, 23.06.2019 23:00
How do you know if the website is secure if you make a purchase
Answers: 2
question
Computers and Technology, 24.06.2019 01:30
Suppose a cpu with a write-through, write-allocate cache achieves a cpi of 2. what are the read and write bandwidths (measured by bytes per cycle) between ram and the cache? (assume each miss generates a request for one block.)
Answers: 1
You know the right answer?
Suppose that the following processes arrive for execution at the times indicated. Each process will...
Questions
question
English, 12.01.2022 18:40
question
Spanish, 12.01.2022 18:40
question
Geography, 12.01.2022 18:40
question
Mathematics, 12.01.2022 18:40