The implementation of the operating system schedul
4.0
1. Use a "first come, first served (FCFS)" algorithm and the "shortest job first (SJF)" algorithm simulates job scheduling. Requirements: Enter the job according to the order of arrival of each job requires running time, according to the scheduling algorithm outputs the average turnaround time. For example (FCFS), enter: 8 (arrival time 0), 5 (arrival time 2), 7 (arrival time 3), 1 (arrival time 6) Note: The format of any input, as long as the output of the average turnaround time can be. 2. Analog "FIFO (FIFO)" algorithm is FIFO Analog "least recently used (LRU)" LRU algorithm Analog "Best replacement (OPT)" algorithm OPT