Shortest Job First

Q1. Explain Shortest Job First (SJF).

Q2. What is the classification of Shortest Job First Scheduling Algorithm?

Q3. Explain Non-preemptive Shortest Job First Scheduling with example.

Q4. Does arrival time of processes effect scheduling, if yes, than explain with example.

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 and 2. The processes are assumed to have arrived at time 0, then draw Gantt Chart and calculate average turnaround and waiting time using Shortest Job First Algorithm.

Q6. Explain Preemptive Shortest Job First.

Q7. Consider the following Gantt Chart:

P1 P2 P3 P2 P4 P1

0                2                 4            5                               7                            11                       16

Calculate Turnaround Time and Waiting Time by using Preemptive 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                        1  

Draw Gantt Chart and calculate average turnaround and waiting time using Shortest Job First Scheduling Algorithm.

Q9. What are the drawbacks of SJF?

Leave a Reply

Your email address will not be published. Required fields are marked *

%d bloggers like this: