Non-Preemptive Shortest Job First Algorithm

In this video, we walk you through the Non-Preemptive Shortest Job First (SJF) CPU scheduling algorithm using a clear numerical example. You’ll learn how to construct the Gantt chart, calculate Turnaround Time (TAT), and determine Waiting Time (WT) for each process step by step.

Non-preemptive SJF is one of the most efficient scheduling algorithms when it comes to reducing average waiting time. This tutorial is perfect for computer science students and anyone preparing for operating systems exams.

📌 Topics Covered:
• What is Non-Preemptive SJF Scheduling?
• How to select the next process
• Gantt Chart construction
• Calculating Completion Time
• Calculating Turnaround Time (TAT)
• Calculating Waiting Time (WT)
• Average TAT and WT