Please help me to solve these problems
- Six jobs arrive as in the following table with arrival times, burst times and priorities as indicated below:
JOB ARR, Time BURST, Time Pri
A 0 6 3
B 1 3 2
C 3 4 2
D 5 5 1
E 6 4 3
F 7 6 2
Note: ties in any scheduling scenario ties will be broken using a process’ priority
For the process in the above table, for FCFS, SNJ, STR, Priority (preemptive), and Round Robin (slice = 3)(swap processes before adding new processes to the queue) show
a. (4 pts) When each process is running
b. (2 pts) Average wait time
c. (2 pts) Average response time
d. (2 pts) Average turnaround time
- Six jobs arrive as in the following table with arrival times, burst times and priorities as indicated below. Also indicated are when and for how long each process needs for I/O. Processes returning from I/O use an interrupt with priority 0 and return after any process swap.
Note: ties in any scheduling scenario ties will be broken using a the ready queue
For the process in the above table, for FCFS, SNJ, STR, and Round Robin (slice = 3)(swap processes before adding new processes to the queue) show
a. (4 pts) When each process is running
b. (2 pts) Average wait time
c. (2 pts) Average response time
d. (2 pts) Average turnaround time