please show me how you work it and the output, compile in function
CS 444 Operating System Project The purpose of this project is familiarizing students with three different scheduling algorithms to run processes. The first algorithm is Round Robin by assigning time quantum to each process. At a certain point the priority algorithm takes place. In order to be fair to shortest job and prevent them from starvation, the shortest job algorithm takes place. At certain time quantum the priority algorithm task place again. Each process is given a time quantum. There ill we several 1/0 request which would cause interrupt. Your task is to create a process. Once the process is created then it is moved to the ready queue and from ready queue moves to running phase for execution. if there is an interrupt then the process is moved to the waiting queue, in this case /o queue, and once the /0 is handled then it is ready for execution depending on algorithm. Process Create Waiting Running Process Ready Queue Terminate if process is complete VO Wait Queue VO Interrupt Each process execution begin with CPU burst followed by VO burst which is CPU burst. 1. Each process can be in CPU cycle with maximum 100 time an 1/0 request then after 50 time quantum process can enter to the CPU cycle quantum or 100 time burst. if there is 2. it is moved to the I/O waiting queue and next based on the priority algorithm. 3. A process with higher priority can't wait more than 3so time 4. Only one vO request can be completed at each time 5. If the wait time for process/processes the shortest job first algorithm,. processes take turn to enter to the CPU cycle base on the take turn to enter to the CPU oycle base on the Quantum st job algorithm applied each ntum, If there is an VO request then ater then each process can be in CPU cycle with maximum of s0 est then after 35 time quantum it is removed to the lO in 6 Once shortest job algorithm app time quantum. l CS 444 Operating System Project The purpose of this project is familiarizing students with three different scheduling algorithms to run processes. The first algorithm is Round Robin by assigning time quantum to each process. At a certain point the priority algorithm takes place. In order to be fair to shortest job and prevent them from starvation, the shortest job algorithm takes place. At certain time quantum the priority algorithm task place again. Each process is given a time quantum. There ill we several 1/0 request which would cause interrupt. Your task is to create a process. Once the process is created then it is moved to the ready queue and from ready queue moves to running phase for execution. if there is an interrupt then the process is moved to the waiting queue, in this case /o queue, and once the /0 is handled then it is ready for execution depending on algorithm. Process Create Waiting Running Process Ready Queue Terminate if process is complete VO Wait Queue VO Interrupt Each process execution begin with CPU burst followed by VO burst which is CPU burst. 1. Each process can be in CPU cycle with maximum 100 time an 1/0 request then after 50 time quantum process can enter to the CPU cycle quantum or 100 time burst. if there is 2. it is moved to the I/O waiting queue and next based on the priority algorithm. 3. A process with higher priority can't wait more than 3so time 4. Only one vO request can be completed at each time 5. If the wait time for process/processes the shortest job first algorithm,. processes take turn to enter to the CPU cycle base on the take turn to enter to the CPU oycle base on the Quantum st job algorithm applied each ntum, If there is an VO request then ater then each process can be in CPU cycle with maximum of s0 est then after 35 time quantum it is removed to the lO in 6 Once shortest job algorithm app time quantum. l
