*This preview shows
pages
1–2. Sign up to
view the full content.*

This ** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **order C, B, E, A, D and the time slice is 3 units of time. Compute the time required to execute jobs A through E with the following assumptions. a. The context switching takes 1 time unit. b. None of the jobs require IO. c. We follow a policy that a higher priority jobs always succeeds in preempting. 4. Suppose we have two resident processes P1 and P2 with the following burst time observed during the last four CPU allocations. 1 Using an exponential averaging technique predict the next burst time for P1 and P2. 5. Given the following data: a. Create the Gantt chart for FCFS Scheduling and compute the turnaround time for Process 3. b. Create Gantt chart for Shortest Remaining time. What is the difference between the average times for FCFS and Shortest Remaining time? 2...

View Full
Document