First Come First Served Scheduling (Solved Problem 1)

preview_player
Показать описание
Operating System: First Come First Serve (FCFS) Scheduling Algorithm in OS.
Topics discussed:
1) The Convoy Effect in Operating Systems.
2) A solved problem on the First Come, First Served Scheduling Algorithm.

Music:
Axol x Alex Skrindo - You [NCS Release]

#OperatingSystemByNeso #OperatingSystem #FCFS #SchedulingAlgorithms #os
Рекомендации по теме
Комментарии
Автор

Thankyou so much! You explained it very well so we can understand easily

vivienchristy
Автор

clearing such a Big topic in short time is really Talent of U

ajaylathwal
Автор

Very helpful video. It helped me solve an exam excercise. Thank you my friend. Liked.

RavingPain
Автор

I dont know why it is called burst time but not just execution time lol

gavin
Автор

Very nice explanation. Which understand properly thank you so much for sharing it.

priyankasr
Автор

Nice Series really keep going, i was asking if u can share videos about deadlock because i found it a bit hard to understand by myself & thanks in advance .

johnmourad
Автор

Bro... I seen evry youtober video but they said but not completely so u explained us the right way of getting crrect marks .well done

KusurSiddaram
Автор

thank it helps me to understand a lot.

thali-cj
Автор

Nice sir in your teaching is good i am easily understand

yokesht
Автор

This help me on my final exam. Thank very much.

johnvincentaligarbes
Автор

thanks a lot neso academy for providing such easy explanations

devangseksaria
Автор

Thanks alot . There explanation is very simple and easy to understand.

jablaklandry
Автор

Teaching was a god level that's why I love neso academy ❤

MrAryya
Автор

In layman
Turnaround time is.... Process ke ready queue mein aane se, fully execute/termination tak ka time

And waiting time is ready queue mein aane se, running state/cpu allocate hone tak ka time is waiting....

rahuljindal
Автор

Amazing video it cleared all my doubts😊

rabeakhatoon
Автор

at 11:00 I think it is more intuitive to think of the waiting time's formula as the scheduled time(being the time it got to use the CPU) minus the arrival time.

cobi
Автор

It is preemptive or non preemptive? How will we know that?

VoiceOfBasumatary
Автор

sir in making the gantt chart when we have to choose between p2 and p4, we should take the p4 1st bcz it result to less average waiting time

chiragsidana
Автор

thanks for video, please upload these to ur website. PLS

TuanNguyen-rxvf
Автор

Sir, why should P5 must wait for 9 units of time... Since it came late and ntg to do with P1? Pls clarify my doubt

Samatha