Pariyar, Subash2021-11-262021-11-262008https://hdl.handle.net/20.500.14540/6149Without I/O, computers are not usable to users. We know that I/O from secondary memories like disk is slower operations. Scheduling of I/O requests such that response time of requests and become as possible as low and also requests does not suffer from the problem of a starvation is big issue in our computer systems. In this project simulates a disk having 200 tracks, implements different existing disk scheduling algorithms for that simulated disk and seek time of these algorithms for given I/O request set is compared and analyzed.en-UScomputer systemsimplements different existing diskThesis