This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: P2, P3, P4, P5, all at time 0. Describe how these processes will be executed using round-robin (RR) scheduling, with a time quantum of 2. (2 points) Process Execution Time P1 10 P2 1 P3 2 P4 1 P5 5 4. Assume that a computer s memory is broken up into the following partitions (in the order given), and that we have the following list of programs to be loaded: 100K Process Name Memory Needed P1 150K P2 400K 500K P3 75K P4 350K 200K 600K BrieFy describe how the irst-it, Best-it, and Worst-it algorithms would load these programs into memory. (2 pts each) 5. EXTRA CREDIT: Consider the following sequence of disk I/O requests: 83, 38, 75, 15, 61, 65, 47, 99, 38, 23 Assume that the read/write head starts at position 50. How far will the head move to handle all of these requests using a shortest-seek-time-rst (SST) strategy? (3 pts)...
View Full Document
This note was uploaded on 09/14/2011 for the course CSE 110 taught by Professor Shaunakpawagi during the Spring '08 term at SUNY Stony Brook.
- Spring '08
- Computer Science