This preview shows page 1. Sign up to view the full content.
Unformatted text preview: directory tree shown in Figure 11.4. a. UL6F, zin9d b. O,#Oizdz c. #z99zx d. Ix!*ai*,S, e. ,T!czIsi#I f. 2D 2!xTizdz 27. Show the relative path to each of the following files or directories using the directory tree shown in Figure 11.5. a. #!O,#9DFz when the working directory is the root directory b. #!O,#9DFz when the working directory is z9O c. IxD 9,## when the working directory is R9D#D9Dz d. zz/i9d9 when the working directory is F, N 28. What is the worst bottleneck in a computer system? 29. Why is disk scheduling concerned more with cylinders than with tracks and sectors? 30. Name and describe three disk-scheduling algorithms....
View Full Document
This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.
- Fall '10