Using Java

Purpose: The objective of this assignment is to become familiar with some of the CP scheduling algorithms. You will be implementing two scheduling algorithms while tracki measures of scheduling effectiveness In this assignment you will be implementing two basic CPU scheduling algorithms. T CPU burst time of the processes that must be scheduled will be input from the comma line. You will profile the performance of these algorithms by tracking the measures effectiveness average waiting time average turnaround time Description of Assignment Implementing the following CPU scheduling algorithms using Java with the assumpti that all jobs are CPU bound and all given at the same time First Come First Served (FCFS) Non-Preemptive Shortest Job First (SJF) Profile the performance of these algorithms by tracking the following measures effectiveness which are defined below The waiting time for a process reflects the total amount of time spent by th process in the ready queue. The average waiting time reports the average for t set of processes that were scheduled The turnaround time for a process is the difference between a job's submissi and completion times. The average turnaround time reports the average for th set of processes that were scheduled Requirements of Task 1. You need to read the CPU Burst Time of processes for your scheduling algorith from the keyboard as follows Please enter the CPU Burst Time for Process #1 (-1 to exit) : 10 Please enter the CPU Burst Time for Process #2 (-1 to exit): 29 Please enter the CPU Burst Time for Process #3 (-1 to exit): 3 Please enter the CPU Burst Time for Process #4 (-1 to exit): 7 Please enter the CPU Burst Time for Process #5 (-1 to exit) : 12 Please enter the CPU Burst Time for Process #6 (-1 to exit): -1