Subject
Computer Science
Topic
Computer Hardware
Which disk scheduling algorithm favors the nearest request to minimize seek time?
Which disk scheduling algorithm favors the nearest request to minimize seek time?
ক)
FCFSখ)
SSTF (Shortest Seek Time First)গ)
SCAN (Elevator)ঘ)
C-LOOK onlyExplanation
SSTF reduces average seek by serving the closest track next. It can starve far requests, so SCAN/C-SCAN variants sweep across the disk for fairness. SSDs don’t benefit from such policies; they are nearly seek-free. Modern OSes adapt per storage type.Related questions
Which is best for cleaning Mylar-protected LCD screens?ESD potential decreases with the use of a:Which FRU is clearly an input/output device?A COM port is a ______ port.Which device uses IRQ 6 by default?With two IDE hard drives, the primary partition of the second drive becomes drive letter:Key difference between USB and IEEE 1394 (FireWire) is that:Which specification covers PC Card (“PCMCIA”) hard cards?