Introduction - If you have any usage issues, please Google them yourself
Disk scheduling algorithms require: 1. The realization of the three algorithms: 1. First Come First Served 2. Shortest seek priority (the teacher will give the current head position) 3. Elevator Algorithm 2. Track service order from the specified text file (TXT files) out of 3. Output: First line: The service tracks the order of the second line: Road show that the total number of mobile, including the procedures: FIFO, shortest seek priority scheduling algorithm, elevator algorithm VC++ Debugging through