Bissoy.com
Doctors Medicines MCQs Q&A

In a computer, Disk scheduling involves deciding

In a computer, Disk scheduling involves deciding Correct Answer The order in which disk access requests must be serviced

Disk scheduling is the technique that the operating system uses to determine which pending request to service next.

If the desired disk drive and controller are available, the request can be serviced immediately.

If the drive or controller is busy, any new requests for service will be placed in the queue of pending requests for that drive.

Related Questions

How to enter in the Global Market? Arrange serially.
1. Deciding whether to go abroad.
2. Deciding on the marketing organisation.
3. Deciding how to enter the market.
4. Deciding on marketing programme.
5. Deciding in which market to enter.
Let disk request come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at the time when the disk driver is reading from cylinder 20. If the seek time is 6 ms per cylinder, then the total seek time for the disk arm scheduling time algorithm (FCFS - First Come First Serve) is:
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at a time when the disk drive is reading from cylinder 20. The seek time is 6 ms/cylinder. The total seek time, if the disk arm scheduling algorithms is first-come-first-served is
You are the administrator of Windows 2000 Server computer. Your computer has a span volume that consists of areas on three physical hard disks on the server. The three disks support hot swapping. You regularly backup the span volume by using windows backup. One of the disk fail, you replace the disk with a new un-partitioned disk. You want to recover the span volume and disk data as soon as possible. What should you do?
You install your boot volume on volume C on your Windows 2000 Server computer. You mirror volume C on dynamic Disk 1. Two years later, during routine server maintenance, you open Disk Management and find that the status of volume C is Failed Redundancy. The status of Disk 1 is Missing. You attempt to reactivate Disk 1, but the status of volume C does not return to Healthy. What should you do next?
Your Windows 2000 Server computer contains a stripe set with parity on a four-disk array. You convert the stripe set with parity to a dynamic RAID-5 volume. Six months later, users report that disk access on the server is slower than it had been on the previous day, You use Disk Management and discover that the status of the third disk in the array is Missing. You want to recover the failed RAID-5 volume. What should you do first?
Your Windows 2000 Server computer contains a stripe set with parity on a four-disk array. You convert the stripe set with parity to a dynamic RAID-5 volume. Six months later, users report that disk access on the server is slower than it had been on the previous day. You use Disk Management and discover that the status of the third disk in the array is missing. You want to recover the failed RAID-5 volume. What should you do first?
A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a
In this figure, 3 types of scheduling using preemptive scheduling policies is shown. Which of the following options is correctly referring to each of these scheduling types?
One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?