Question: please solve all those qustions in ditals 1. Solve the following problem by using Shortest Job First algorithm, draw Gantt Chart and calculate average waiting
please solve all those qustions in ditals

1. Solve the following problem by using Shortest Job First algorithm, draw Gantt Chart and calculate average waiting time. 2. Considering a system with five processes P0 through P4 and three resources types A,B,C. Resource type A has 9 instances, B has 13 instances and C has 10 instances. Suppose at time to following snapshot of the system has been taken: By applying Banker's algorithm 1. What will be the content of need matrix? 2. Is the system in safe state? If yes, then what is the safe sequence? 3. Calculate average waiting time and draw Gantt chart for the following table using Shortest Job First Preemptive method. 4. Consider the following page reference string: 1,3,2,3,4,2,1,3,4,2,1,4,5,1,3. How many page faults would occur for the optimal relacement algorithm (ORA), assuming three frames
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
