OS-UNIT-02 (Lecture-14)

 SCHEDULING ALGORITHMS-II

UNIT-02 (Lecture-14) As per S.B.T.E. Syllabus, Bihar

Dear Reader, this exclusive notes are prepared based on the State Board of Technical Education (SBTE) syllabus for polytechnic students. In this exclusive notes I clearly explained about the difference between Preemptive and Non-Preemptive Scheduling Algorithms in point-wise. The concept of Preemptive & Non-Preemptive are explained for your understanding. I also explained about the concept of Shortest Remaining Time First Job Scheduling (SRTF) in details with point manner. Advantages and Disadvantages of SRTF covered in this notes. The concept of Shortest Job First CPU Scheduling is explained which belong from Non-Preemptive. Priority CPU Scheduling with different Arrival Time is also explained in this notes with example and diagram for your better understanding.

Some related concepts covered in this lecture are:

1. Concept of Preemptive & Non-Preemptive Scheduling Algorithm
2. Difference between Preemptive & Non-Preemptive Scheduling Algorithm
3. Shortest Remaining Time First (SRTF) Job Scheduling Algorithm
4. Advantages and Disadvantages of Shortest Remaining Time First (SRTF) Job Scheduling 
5. Shortest Job First CPU Scheduling Algorithm
6. Priority CPU Scheduling with different Arrival Time

• Tweet
• Share
• Share
• Share
• Share

Related Post