written 6.9 years ago by | modified 3.0 years ago by |
Assume the latest request received was at track 345 and the head is moving towards track 0. the queue in FIFO order contains request for the following tracks. 123,874,692,475,105,376. Perform the computation for the following scheduling algorithms. i)FIFO ii)SSTF iii)SCAN
Subject: Operating System
Topic: STORAGE MANAGEMENT
Difficulty: Hard