[Solved] In last- in-first- out, disk scheduling policy

Q.	In last- in-first- out, disk scheduling policy
A.	Recently received request is entertained at the last.
B.	Recently received request is entertained first.
C.	Requests are selected at random
D.	None of these.
Answer» B. Recently received request is entertained first.

2.6k

Do you find this helpful?

View all MCQs in

Operating System Advanced

Discussion

No comments yet

Related MCQs

In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on
In disk scheduling, the shortest service time first policy selects the disk request that
In shortest service time first policy, applied on disk scheduling, the disk request is selected
In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a
RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.
Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.
If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects