Part 4: Answer the following questions [4 marks] Three processes with process IDs P1, P2, P3 with estimated completion time 9, 5, 6 milliseconds respectively enter the ready queue together. A new process P4 with estimated completion time 1ms enters the 'Ready' queue after 2ms. A new process P5 with estimated completion time 2ms enters the 'Ready' queue after 3ms. Assume all the processes contain only CPU operation and no I/O operations are involved. Calculate the waiting time and Turn Around Time (TAT) for each process and the Average waiting time and Turn Around Time (Assuming there is no I/O waiting for the processes) in preemptive SJF based scheduling algorithm.
Added by Michael G.
Close
Step 1
P1: arrival = 0, burst = 9 P2: arrival = 0, burst = 5 P3: arrival = 0, burst = 6 P4: arrival = 2, burst = 1 P5: arrival = 3, burst = 2 Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 65 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Exercise 3.2.1: Scheduling with FIFO, SJF, and SRT. (a) For the 5 processes described below, draw a timing diagram showing when each process executes under FIFO, SJF, and SRT. (b) Determine the ATT for each scheduling algorithm for the 5 processes.
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD