Which disk scheduling algorithm seeks the closest track next? Group of answer choices FCFS SSTF SCAN C-SCAN
Added by Daniel B.
Step 1
The question is asking which disk scheduling algorithm selects the next track based on proximity to the current track. Show more…
Show all steps
Your feedback will help us improve your experience
Breanna Ollech and 63 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
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
Breanna O.
Akash M.
6) On a disk with 200 cylinders, numbers 0 to 199, compute the number of tracks the disk arm must move to the satisfy the entire request in the disk queue. Assume the last request received was at track 100. The queue in FIFO order contains requests for the following tracks, 55, 58, 39, 18, 90, 160, 150, 38, 184. Perform the computation to find the seek length for the following scheduling algorithm. (i) FCFS (ii) SSTF (iii) SCAN (iv) C-SCAN (v) LOOK
Madhur L.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD