The file system is part of the kernel. The PCB must be memory resident. A FIFO scheduler can cause starvation. It is impossible for them to deadlock. Stack allocation is better than heap allocation.
Compilers resolve external references.
O You have been asked to design the disk scheduling algorithm for a new computer sys tem. The system will support a GUI front end and will be used for both interactive use and for disk intensive applications. Explain why each suggestion is reasonable. Then describe the algorithm you will implement and explain why. SSTF is reasonable if you are trying to maximize throughput, which you'll want to do for the disk-intensive applications.