Question

Suppose that the head of a moving disk with 200 tracks, numbered 0 to 199, currently serving a request at track 143 and has just finished a request at track 125. The queue of pending track requests is kept in FIFO order: 86, 147, 91, 177, 94, 150, 102, 175, 130 For each of the following disk scheduling algorithms, indicate the number of head movements (i.e. distance in tracks) needed to satisfy these pending requests.1. FCFS 2. SSTF 3. SCAN 4. C-SCAN 5. C-LOOK

Answer 1

Explanation:

❥︎

» » Hearthacker « «

${\large\blue{\mathbb\fcolorbox{aqua}{darkblue}{● QUESTION:}}}$

❥︎

______________________

${\large\blue{\mathbb\fcolorbox{aqua}{darkblue}{● ANSWER:}}}$

${\bold{\green{❥︎ \: Dᴇғɪɴɪᴛɪᴏɴ:}}}$

➪

${\bold{\green{❥︎\: Exᴀᴍᴘʟᴇ:}}}$

➪

_____________________

${\large\bold\orange{》 ❥︎ \:ꀍꏂ \: ꓄ꌚ \: ꀍᖘꌚ \: ꌩꀎ \:♡︎ 《}}》❥︎ꀍꏂ꓄ꌚꀍᖘꌚꌩꀎ♡︎《$

______________________

${\red{\huge\underbrace{Be\: Happy}}}$