If you have done threads with Java, you could programme each of the scheduling algorithms, and simulate the operation and obtain statistics using random data.
If you have not done threads, you can still simulate the operation of the scheduling, by assuming a discrete (constant) time for each operation.
We will be glad to help you with your work, but we do not write the programme for you.
Can you create a java program that will make a CPU SCHEDULER w/ First Come First Serve,Round Robin,Priority Scheduling(Preemptive & Non-Preemptive)& Shortest Job First(Preemptive & Non-Preemptive)
that will compute for Waiting time,Average waiting time,turnaround time and throughput
1 answer
1 answer