📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Consider three processes P1, P2, and P3 with burst times

    10, 5, and 8 respectively. All arrive at time 0. Using the Shortest Job First (SJF) non-preemptive scheduling algorithm, what is the average waiting time?
    A 6.0 Correct Answer Incorrect Answer
    B 7.67 Correct Answer Incorrect Answer
    C 8.33 Correct Answer Incorrect Answer
    D 10.0 Correct Answer Incorrect Answer
    E 11.67 Correct Answer Incorrect Answer

    Solution

    Processes: P1 (10), P2 (5), P3 (8)            Order of execution (SJF non-preemptive): P2, P3, P1            P2: Starts at 0, finishes at 5. Waiting time = 0.            P3: Starts at 5, finishes at 13. Waiting time = 5.            P1: Starts at 13, finishes at 23. Waiting time = 13.            Total waiting time = 0 + 5 + 13 = 18            Average waiting time = 18 / 3 = 6.0

    Practice Next
    ask-question