Skip to content
THE CS NOTES

L-2 Process Scheduling ▶️

L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS

Section titled “L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS”

L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling

Section titled “L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling”

L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

Section titled “L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example”

L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System

Section titled “L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System”

L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS

Section titled “L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS”

L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm

Section titled “L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm”

L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example

Section titled “L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example”

L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System

Section titled “L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System”

L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question

Section titled “L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question”

L-2.10: Multi Level Queue Scheduling | Operating System

Section titled “L-2.10: Multi Level Queue Scheduling | Operating System”

L-2.11: Multilevel Feedback Queue Scheduling | Operating System

Section titled “L-2.11: Multilevel Feedback Queue Scheduling | Operating System”