Get premium membership and access questions with answers, video lessons as well as revision papers.

Explain how priority scheduling algorithm differ from shortest job first algorithm in a computer system

      

Explain how priority scheduling algorithm differ from shortest job first algorithm in a computer system

  

Answers


Davis
In priority scheduling, each process is assigned a priority, and priority is allowed to run, while in shortest job first algorithm, the waiting job with the smallest estimated time to completion is next.When the CPU is available, it is assigned the process that has the smallest next cpu burst.
Githiari answered the question on November 17, 2017 at 06:09


Next: Explain the concept of Non-formal curriculum
Previous: Differentiate between database and database system

View More Computer Studies Questions and Answers | Return to Questions Index


Learn High School English on YouTube

Related Questions