Blog Post by Admin


Posted on 2014-07-11 04:53:00


I need it by tomorrow

I need it by tomorrow. Pin ItClick here to get this question answered. 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. (HINT for problems 1 and 2: Review Module 6 section 2.1.2 for the definitions of these scheduling algorithms and Self-Assessment problems 1-4.) 1. (2 points) If the Round Robin Scheduling algorithm is used, which process completes second and why? At what time does it complete? 2. (2 points) If the Round Robin with Priority Queues Scheduling algorithm is used, which process completes second and why? At what time does it complete? 3. (3 points) 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. (3 points) 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 ___ First-fit ___ Best-fit ___ Worst-fitI need it by tomorrow. Pin It 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. (HINT for problems 1 and 2: Review Module 6 section 2.1.2 for the definitions of these scheduling algorithms and Self-Assessment problems 1-4.) 1. (2 points) If the Round Robin Scheduling algorithm is used, which process completes second and why? At what time does it complete? 2. (2 points) If the Round Robin with Priority Queues Scheduling algorithm is used, which process completes second and why? At what time does it complete? 3. (3 points) 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. (3 points) 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 ___ First-fit ___ Best-fit ___ Worst-fitClick here to get this question answered.


Blog Search

Services You Can Count On

Do you find it hard to find the time to write your essays? Do you lack confidence in your essay-writing skills? universalessaywriting.com is here to help you. We have the widest range of academic services in the industry. No matter what it is that you need written, count on our team of professional essay writers to help.