🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← 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 →
  1. Q1. Which disk scheduling algorithm always picks the nearest request?
  2. Q2. Which disk scheduling algorithm is also called the "elevator" algorithm?
  3. Q3. Which file allocation method makes random access slow?
  4. Q4. In Unix, where is a file's NAME stored?
  5. Q5. Head at 50, requests 40 and 90 only. Total movement with SSTF?
  6. Q6. Head at 50, moving towards 0, requests 10, 60 and 90 (tracks 0–199). What is the total head movement with SCAN?
  7. Q7. With the same requests, how does LOOK differ from SCAN?
  8. Q8. The original name of a file is deleted, but a hard link to it still exists. What happens to the data?
  9. Q9. Which file allocation method keeps all of a file's block addresses together in one index block (as Unix inodes do)?
  10. Q10. Why does disk scheduling matter much less on an SSD?