OS-UNIT-02 (Lecture-13)

 SCHEDULING ALGORITHMS-I

UNIT-02 (Lecture-13) 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 notes I explained about the concept of Scheduling Algorithm in Operating System. There are six Scheduling Algorithms are mostly used in Operating System such as First Come First Serve (FCFS), Shortest Job Next (SJN), Priority Scheduling, Shortest Remaining Time, Round Robin Scheduling & Multiple-Level Scheduling. I also explained about the timing concept of Timing in Scheduling Algorithms. The important Timing in Scheduling Algorithms are Arrival Time, Completion Time, Burst Time, Turn Around Time & Waiting Time. This lecture is covered more on each Scheduling Algorithm in details with the help of diagram as well as point-wise.

Some related concepts covered in this lecture are:

1. Concept of Scheduling Algorithm
2. Concept of Timing in Scheduling Algorithm
3. Types of Scheduling Algorithm
4. Explanation of each Scheduling Algorithm

• Tweet
• Share
• Share
• Share
• Share

Related Post