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

3.4M views
•
May 19, 2018
by
Gate Smashers
YouTube video player
L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System

Transcript

Hello Friends, Welcome to Gate Smashers Let's understand the concept of shortest job first scheduling algorithm with a numerical So in the numerical first we have given here Four processes P1, P2, P3, P4 Their arrival time and burst time is given It'll be given to you in almost all numerical What we need to find is completion time, turnaround time,... Read More

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from Gate Smashers 📚

AI Syllabus for NTA UGC NET: Priority Topics to Study thumbnail
AI Syllabus for NTA UGC NET: Priority Topics to Study
Gate Smashers
Lec-17: Introduction to Game Playing | Learn Game Playing Algorithms with Example thumbnail
Lec-17: Introduction to Game Playing | Learn Game Playing Algorithms with Example
Gate Smashers
Lec-77: Domain Name Server(DNS) & its types in Hindi | All about DNS thumbnail
Lec-77: Domain Name Server(DNS) & its types in Hindi | All about DNS
Gate Smashers
Unit Testing with examples in Software Engineering thumbnail
Unit Testing with examples in Software Engineering
Gate Smashers
What Are the Key Differences Between Datagram and Virtual Circuit Switching? thumbnail
What Are the Key Differences Between Datagram and Virtual Circuit Switching?
Gate Smashers
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term) thumbnail
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)
Gate Smashers