← All topics
Quiz: Files and Disk Scheduling: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. Which disk scheduling algorithm always picks the nearest request?
- Q2. Which disk scheduling algorithm is also called the "elevator" algorithm?
- Q3. Which file allocation method makes random access slow?
- Q4. In Unix, where is a file's NAME stored?
- Q5. Head at 50, requests 40 and 90 only. Total movement with SSTF?
- Q6. Head at 50, moving towards 0, requests 10, 60 and 90 (tracks 0–199). What is the total head movement with SCAN?
- Q7. With the same requests, how does LOOK differ from SCAN?
- Q8. The original name of a file is deleted, but a hard link to it still exists. What happens to the data?
- Q9. Which file allocation method keeps all of a file's block addresses together in one index block (as Unix inodes do)?
- Q10. Why does disk scheduling matter much less on an SSD?