Q2. Suppose that the following processes arrive for execution at the times indic

Question

Q2. Suppose that the following processes arrive for execution at the times indicated. Each process will run the amount of time listed. In answering the questions, use non- preemptive scheduling and base all the decisions on the information you have at the time the decision must be made Process P1 P2 P3 Arrival Time 0.0 0.4 1.0 Burst Time 4 (10 points) What is the average waiting time for these processes with the FCFS scheduling algorithm? a. b. (10 points) What is the average waiting time or these processes with the SUF scheduling algorithm?

Explanation / Answer

Q2:

a) FCFS

0------------------------------------8-----------------------------------12-----------------------------------13

Average waiting time = (0+8+12)/3 = 6.67

b) SJ

0.0--1.0----------------------------------2---------------------------------6---------------------------------14

Average waiting time = (1+2+6)/3 = 3

Do ask if any doubt. Please upvote.

P1 P2 P3

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.