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


    Question

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

    5, 8 milliseconds respectively. All arrive at time 0. If they are scheduled using the Shortest Job First (SJF) non-preemptive algorithm, what is the average waiting time?
    A 4.33 ms Correct Answer Incorrect Answer
    B 6.00 ms Correct Answer Incorrect Answer
    C 7.00 ms Correct Answer Incorrect Answer
    D 7.67 ms Correct Answer Incorrect Answer
    E 8.33 ms Correct Answer Incorrect Answer

    Solution

    Answer :B) 6.00 ms.

    Practice Next
    ask-question