## Shortest Job First.

Q62. Define Shortest Job First. Ans. The ready queue is sorted on the basis of the process size entering the

## Drawbacks of SJF

Q9. What are the drawbacks of SJF? Ans. We allocate CPU to shortest job so the job with more burst

## 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

## Preemptive Shortest Job First

Q6. Explain Preemptive Shortest Job First. Ans. If a new process arrives with CPU burst length less than remaining time

## Numerical Solved by SJF

Q5. 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

## Shortest Job First

Q1. Explain Shortest Job First (SJF). Q2. What is the classification of Shortest Job First Scheduling Algorithm? Q3. Explain Non-preemptive