For problems 1 and 2, a computer has the following four processes that have arrived in the ready queue in the sequence shown below. NOTE: Time slicing is not used, therefore, there are no mandatory time outs.
Process 1 has a run time of 25 seconds, a priority of 1, and it will require 10 seconds of I/O after 10 seconds of execution.
Process 2 has a run time of 20 seconds, a priority of 2, and it will require 10 seconds of I/O after 5 seconds of execution.
Process 3 has a run time of 25 seconds and a priority of 2.
Process 4 has a run time of 20 seconds and a priority of 1, and it will require 15 seconds of I/O after 10 seconds of execution.
1. If the Round Robin Scheduling algorithm is used, which process completes second and why? At what time does it complete?
2. If the Round Robin with Priority Queues Scheduling algorithm is used, which process completes second and why? At what time does it complete?
3. Explain the trade-offs between contiguous, noncontiguous linked, and noncontiguous indexed file allocation. In particular, note if each can be efficiently used for sequential and random access methods.
4. Using a variable-partitioned multiprogramming memory, which of the four holes shown below will be used to satisfy a 55 KB program requirement under the conditions of:
|
0-10 KB
|
10-55 KB
|
55-140 KB
|
140-215 KB
|
215-260 KB
|
260-330 KB
|
330-350 KB
|
350-410 KB
|
410-470 KB
|
|
occupied
|
Hole A
|
occupied
|
Hole B
|
occupied
|
Hole C
|
occupied
|
Hole D
|
occupied
|