Question

Given the following queue - 95, 180, 34, 119, 11, 123, 62, 64 - with the Read-write head initially at track 50 and the tail track being at 199, demonstrate the following disk scheduling algorithms: 1. First Come-First Serve (FCFS) 2. Shortest Seek Time First (SSTF) 3. Elevator (SCAN) 4. Circular SCAN (C-SCAN) 5. LOOK 6. C-LOOK

Name: given the following queue 95 180 34 119 11 123 62 64 with the read write head initially at the track 50 and the tail track being at 199 demonstrate the following disk scheduling algorithms f 11646
Uploaded: 2024-05-30T03:43:20-08:00
Duration: 1 min 7 s
Channel: Breanna Ollech
Description: given the following queue 95 180 34 119 11 123 62 64 with the read write head initially at the track 50 and the tail track being at 199 demonstrate the following disk scheduling algorithms f 11646

          Given the following queue - 95, 180, 34, 119, 11, 123, 62, 64 - with the Read-write head initially at track 50 and the tail track being at 199, demonstrate the following disk scheduling algorithms:
1. First Come-First Serve (FCFS)
2. Shortest Seek Time First (SSTF)
3. Elevator (SCAN)
4. Circular SCAN (C-SCAN)
5. LOOK
6. C-LOOK

Added by Darrell C.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Breanna Ollech

05/30/2024

Step 1

First Come-First Serve (FCFS): In this algorithm, the requests are served in the order they arrive. So, the order of servicing the requests will be: 50 -> 95 -> 180 -> 34 -> 119 -> 11 -> 123 -> 62 -> 64 Total head movement: (95-50) + (180-95) + (180-34) + Show more…

Show all steps

Thanks for your feedback!

Given the following queue - 95, 180, 34, 119, 11, 123, 62, 64 - with the Read-write head initially at track 50 and the tail track being at 199, demonstrate the following disk scheduling algorithms: 1. First Come-First Serve (FCFS) 2. Shortest Seek Time First (SSTF) 3. Elevator (SCAN) 4. Circular SCAN (C-SCAN) 5. LOOK 6. C-LOOK