Question

Topic 1: Simulation of CPU scheduling algorithms (Java Programming) Process Scheduling algorithms: Choose scheduling algorithms a) Non Preemptive Priority Process Burst time Arrival time Priority PO 6 0 3 P1 4 1 3 P2 6 5 1 P3 6 6 1 P4 6 7 5 P5 6 8 6 Pre-assigned case 1. User should be able to enter the details about the processes such as Arrival Time, Burst Time, Priority, Time Quantum for Round Robin assigned at the beginning of simulation and the number of processes can range from 3 to 10. 2. Executing the program should show the Gantt chart (visual form) of each algorithm. 3. Calculation of a) Turnaround time for each process b) Total and Average Turnaround time for the entire processes c) Average Waiting time for each process d) Total and Average Waiting time for the entire processes

          Topic 1:
Simulation of CPU scheduling algorithms (Java Programming)
Process Scheduling algorithms: Choose scheduling algorithms
a) Non Preemptive Priority
Process	Burst time	Arrival time	Priority
PO	6	0	3
P1	4	1	3
P2	6	5	1
P3	6	6	1
P4	6	7	5
P5	6	8	6
Pre-assigned case
1. User should be able to enter the details about the processes such as Arrival Time, Burst Time,
Priority, Time Quantum for Round Robin assigned at the beginning of simulation and the
number of processes can range from 3 to 10.
2. Executing the program should show the Gantt chart (visual form) of each algorithm.
3. Calculation of
a) Turnaround time for each process
b) Total and Average Turnaround time for the entire processes
c) Average Waiting time for each process
d) Total and Average Waiting time for the entire processes

Topic 1:
Simulation of CPU scheduling algorithms (Java Programming)
Process Scheduling algorithms: Choose scheduling algorithms
a) Non Preemptive Priority
Process Burst time Arrival time Priority
PO 6 0 3
P1 4 1 3
P2 6 5 1
P3 6 6 1
P4 6 7 5
P5 6 8 6
Pre-assigned case
1. User should be able to enter the details about the processes such as Arrival Time, Burst Time,
Priority, Time Quantum for Round Robin assigned at the beginning of simulation and the
number of processes can range from 3 to 10.
2. Executing the program should show the Gantt chart (visual form) of each algorithm.
3. Calculation of
a) Turnaround time for each process
b) Total and Average Turnaround time for the entire processes
c) Average Waiting time for each process
d) Total and Average Waiting time for the entire processes

Added by Jeffery P.

Question

Please give Ace some feedback