SJF Scheduling with CPU & IO Processes 🖥️

CORRECTION: At 4.40 I compared process time(20,30,10) but here we will compare the total CPU Burst time only to select the shortest job.
CPU Burst Time for P1 = 10(excluding IO time),
P2 = 15,
P3 = 5.
So we compare (10,15,5) and allocates the CPU to P3 as it is having shortest Burst Time.

Discussed the Shortest Job First(Non-Preemptive) CPU Scheduling Algorithm with processes containing CPU time and IO time.

See Complete Playlists:

Placement Series: https://www.youtube.com/playlist?list=PLdo5W4Nhv31YvlDpJhvOYbM9Ap8UypgEy

Data Structures and Algorithms: https: https://www.youtube.com/playlist?list=PLdo5W4Nhv31bbKJzrsKfMpo_grxuLl8LU

Dynamic Programming: https://www.youtube.com/playlist?list=PLdo5W4Nhv31aBrJE1WS4MR9LRfbmZrAQu

Operating Systems: //www.youtube.com/playlist?list=PLdo5W4Nhv31a5ucW_S1K3-x6ztBRD-PNa

DBMS: https://www.youtube.com/playlist?list=PLdo5W4Nhv31b33kF46f9aFjoJPOkdlsRc


Connect & Contact Me:

Facebook: https://www.facebook.com/Jennys-Lectures-CSIT-Netjrf-316814368950701/
Quora: https://www.quora.com/profile/Jayanti-Khatri-Lamba
Instagram: https://www.instagram.com/jayantikhatrilamba/