Non preemptive: Once a process is selected, it runs until either it is blocked for an I/O or some event, or it is terminated. The process, that requires shortest time to complete execution, is served first. Question-1 Explain Shortest Job First (SJF) scheduling algorithms with illustration. (1) Explain Shortest Job First (SJF) scheduling algorithms with illustration. Lists of Long Descriptive type Questions that may be asked in Written Exams. Here in this section of Operating System Long Questions and Answers,We have listed out some of the important Long Questions with Answers on Shortest Job First (SJF) scheduling algorithms which will help students to answer it correctly in their University Written Exam.
0 Comments
|
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
March 2023
Categories |