Lesson 10 of 26 • 13 upvotes • 11:32mins
This lesson covers SJF or shortest job first scheduling algorithm with the help of an example. Here we'll ses how to calculate : - Completion time - TAT - Waiting time
26 lessons • 5h 17m
Lesson 1 - Introduction to OS
13:47mins
Lesson 3 - Context Switching and Process States
12:34mins
Lesson 2 - Process and PCB
12:52mins
Lesson 4 : Process Transition Diagram and Types of scheduler
9:46mins
Lesson 5 - Process Queue and Types of Scheduler
13:30mins
Lesson 6 - Previous years' GATE Questions
11:50mins
Lesson 7 - CPU Scheduling
13:28mins
Lesson 8 - FCFS Scheduling
14:28mins
Lesson 8 - FCFS Scheduling(Convoy Effect)
11:43mins
Lesson 9 - SJF Scheduling
11:32mins
Lesson 9 - SJF Scheduling(Part 2)
10:58mins
Lesson 10 - SRTF Scheduling
9:59mins
Lesson 11 - Previous Years GATE Questions on CPU Scheduling
12:13mins
Lesson 12 - Priority Scheduling
10:51mins
Lesson 13 - Priority Scheduling(Preemptive)
11:31mins
Lesson 14 - Round Robin Scheduling
13:13mins
Lesson 15 - LJF Scheduling
10:08mins
Lesson 17 - HRRN Scheduling
11:06mins
Lesson 18 - Previous Years'GATE Question on LRTF Scheduling
13:56mins
Lesson 16 - LRTF Scheduling
14:06mins
Lesson 20: Practice Questions on CPU Scheduling with I/O time
11:47mins
Lesson 21 : Previous Years' GATE Questions
13:02mins
Lesson 23 : Previous Years' GATE Questions
11:52mins
Lesson 19 : Practice questions from CPU Scheduling with I/O time
13:07mins
Lesson 22 : Previous Years' GATE Problems
13:27mins
Lesson 24: Least Completed Next Scheduling Algorithm
10:03mins