First Come First Serve Scheduling Algorithm || Operating System || with Animation

preview_player
Показать описание
In this lecture on FCFS CPU scheduling algorithm, we will discuss the working of first come first serve algorithm with animation. FCFS algorithm is a non-preemptive CPU scheduling technique in which a process is allocated CPU based on its arrival time. The process which arrives first is allocated the CPU first. The video also explains how to calculate waiting time and how to calculate turnaround time. The other CPU scheduling algorithms are SJF, Round Robin, SRTF, Priority scheduling etc.
We will discuss FCFS algorithm with example.


Reference Links:
For PPT refer:

Other Playlists:

Was this tutorial about FCFS scheduling algorithm in Operating System helpful? If so, please share. Let me know your thoughts in the comments.

#os #dextutor #fcfs #cpuscheduling
Рекомендации по теме
Комментарии
Автор

Paritosh
Avg. Waiting time = 6.8
Avg. Turnaround time = 11.4

rikhireel
Автор

Abubakr
Avg. waiting time = 4.8
Avg. turnaround time = 9.4

octane
Автор

avg.waiting time=6.8
avg.turnaround time=11

shuvroshovon