Numerical Solved by Shortest Job First Scheduling Algorithm
Q8. Consider the following: Arrive Time Process Burst Time 0 P1 10 1 P2 4 2 P3 3 3 P4
Read moreQ8. Consider the following: Arrive Time Process Burst Time 0 P1 10 1 P2 4 2 P3 3 3 P4
Read moreQ5. Consider the set of process P1,P2,P3,P4 and P5 having burst time as 10,1,2,1 and 5 ms and priority 5,1,3,4
Read moreQ1. Explain Shortest Job First (SJF). Q2. What is the classification of Shortest Job First Scheduling Algorithm? Q3. Explain Non-preemptive
Read more